Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple

2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 573-582, 2016.

Cited by: 107|Bibtex|Views46|DOI:https://doi.org/10.1109/FOCS.2016.68
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We show how to perform sparse approximate Gaussian elimination for Laplacian matrices. We present a simple, nearly linear time algorithm that approximates a Laplacian by the product of a sparse lower triangular matrix with its transpose. This gives the first nearly linear time solver for Laplacian systems that is based purely on random sa...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments