Solving sparse, symmetric, diagonally-dominant linear systems in time O(m1.31)

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 416-427

  Spielman, D A ^a   Teng, Shang Hua ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Artificial intelligence; Chebyshev approximation; Computer science; Gradient methods; Iterative methods; Linear systems; Mathematics; Sparse matrices; Symmetric matrices; Transmission line matrix methods

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHEBYSHEV APPROXIMATION; COMPUTER SCIENCE; GRADIENT METHODS; ITERATIVE METHODS; LINEAR SYSTEMS; MATHEMATICAL TECHNIQUES;

DIAGONALLY DOMINANT LINEAR SYSTEMS; DIAGONALLY DOMINANT MATRIX; LINEAR SYSTEM SOLVER; PRECONDITIONERS; RELATIVE DISTANCES; SPARSE MATRICES; SYMMETRIC MATRICES; TRANSMISSION LINE MATRIX METHODS;

MATRIX ALGEBRA;

EID: 84862434265     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238215     Document Type: Conference Paper

References (26)

1. N. Alon, R. M. Karp, D. Peleg, and D. West. A graphtheoretic game and its application to the k-server problem. SIAM Journal on Computing, 24(1):78-100, Feb. 1995.
2. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804-823, Oct. 1985.
3. M. Bern, J. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo. Support-graph preconditioners. submitted to SIAM J. Matrix Anal. & Appl.
4. B. Bollobas. Extremal Graph Theory. Academic Press, London, 1 edition, 1978.
5. E. Boman, D. Chen, B. Hendrickson, and S. Toledo. Maximum-weight-basis preconditioners. to appear in Numerical Linear Algebra and Applications.
6. E. Boman and B. Hendrickson. Support theory for preconditioning. submitted to SIAM J. Matrix Anal. & Appl (Revised 10/02).
7. E. Boman and B. Hendrickson. On spanning tree preconditioners. Manuscript, Sandia National Lab., 2001.
8. A. M. Bruaset. A Survey of Preconditioned Iteratitve Methods. Longman Scientific and Technical, 1995.
9. D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplication. SIAM Journal on Computing, 11(3):472-492, Aug. 1982.
10. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan. A separator theorem for graphs of bounded genus. Journal of Algorithms, 5(3):391-407, Sept. 1984.
11. G. H. Golub and M. Overton. The convergence of inexact Chebychev and Richardson iterative methods for solving linear systems. Numerische Mathematik, 53:571-594, 1988.
12. G. H. Golub and C. F. Van Loan. Matrix Computations, 2nd. Edition. The Johns Hopkins University Press, Baltimore, MD, 1989.
13. K. Gremban. Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. PhD thesis, Carnegie Mellon University, CMU-CS-96-123, 1996.
14. K. Gremban, G. Miller, and M. Zagha. Performance evaluation of a new parallel preconditioner. In 9th IPPS, pages 65-69, 1995.
15. L. A. Hageman and D. M. Young. Applied iterative methods. Computer Science and Applied Mathematics. Academic Press, New York, NY, USA, 1981.
16. A. Joshi. Topics in Optimization and Sparse Linear Systems. PhD thesis, UIUC, 1997.
17. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16(2):346-358, Apr. 1979.
18. B. M. Maggs, G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo. Solving symmetric diagonally-dominant systems by preconditioning. 2002.
19. S. F. McCormick. Multigrid Methods, volume 3 of Frontiers in Applied Mathematics. SIAM Books, Philadelphia, 1987.
20. S. Plotkin, S. Rao, and W. D. Smith. Shallow excluded minors and improved graph decompositions. In 5th SODA, pages 462-470, 1994.
21. J. Reif. Efficient approximate solution of sparse linear systems. Computers and Mathematics with Applications, 36(9):37-58, 1998.
22. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.
23. G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, NJ 07632, USA, 1973.
24. P. M. Vaidya. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript UIUC 1990. A talk based on the manuscript was presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation, October 1991, Minneapolis., 1990.
25. R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, New Jersey, 1962. Second Edition, Springer, Berlin, 2000.
26. D. M. Young. Iterative solution of large linear systems. Academic Press, New York, NY, USA, 1971.