Localized solutions of sparse linear systems for geometry processing

Philipp Herholz Timothy A. Davis Marc Alexa

TU Berlin Texas A&M TU Berlin

Abstract Computing solutions to linear systems is a fundamental building block of many geometry processing algorithms. In many cases the Cholesky factorization of the system matrix is computed to subsequently solve the system, possibly for many right-hand sides, using forward and back substitution. We demonstrate how to exploit sparsity in both the right-hand side and the set of desired solution values to obtain significant speedups. The method is easy to implement and potentially useful in any scenarios where linear problems have to be solved locally. We show that this technique is useful for geometry processing operations, in particular we consider the solution of diffusion problems. All problems profit significantly from sparse computations in terms of runtime, which we demonstrate by providing timings for a set of numerical experiments.

Preprint (3MB)

@Article{Herholz:2017:lgp, journal = {ACM Transaction on Graphics (Proc. of Siggraph Asia)}, title = {{Localized solutions of sparse linear systems for geometry processing}}, author = {Philipp Herholz, Timothy A. Davis, and Marc Alexa}, pages = {8}, volume= {36}, number= {6}, year = {2017}, DOI = {https://doi.org/10.1145/3130800.3130849}, }