Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

Authors: Daniel Spielman and Shang-Hua Teng

Bibliographic Information:

Current version available at Extended abstract appeared in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 81--90, 2004. This paper contains half of the material that appeared in Nearly linear time algorithms for graph partitioning, graph sparsification, and solving linear systems


You can download this paper as Postscript, or PDF.
Daniel A. Spielman