An efficient parallel solver for SDD linear systems

STOC, pp. 333-342, 2014.

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

Abstract:

We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a sparse approximate inverse chain for the input matrix: a sequence of sparse matrices whose product appr...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments