An efficient parallel solver for SDD linear systems
STOC, pp. 333-342, 2014.
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
PPT (Upload PPT)