Sparsified Cholesky and Multigrid Solvers for Connection Laplacians

STOC, pp. 842-850, 2016.

Cited by: 84|Bibtex|Views66|DOI:https://doi.org/10.1145/2897518.2897640
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|arxiv.org

Abstract:

We introduce the sparsified Cholesky and sparsified multigrid algorithms for solving systems of linear equations. These algorithms accelerate Gaussian elimination by sparsifying the nonzero matrix entries created by the elimination process. We use these new algorithms to derive the first nearly linear time algorithms for solving systems o...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments