Sparsified Cholesky Solvers for SDD linear systems

CoRR, Volume abs/1506.08204, 2015.

Cited by: 18|Bibtex|Views19
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de|arxiv.org

Abstract:

We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. We show that these matrices have constant-factor approximations of the form $L L^{T}$, where $L$ is a lower-triangular matrix with a number of nonzero entries linear in its dimension. Furthermo...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments