Approaching optimality for solving SDD linear systems

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

Volumn , Issue , 2010, Pages 235-244

  Koutis, Ioannis ^a   Miller, Gary L ^a   Peng, Richard ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithms; Combinatorial preconditioning; Linear systems; Spectral graph theory

Indexed keywords

ALGORITHMS; GRAPH ALGORITHMS; ITERATIVE METHODS; LINEAR SYSTEMS; NUMBER THEORY;

CHEBYSHEV ITERATION; COMBINATORIAL PRECONDITIONING; CONDITION NUMBERS; DIAGONALLY DOMINANT MATRIX; EDGE-WEIGHTED GRAPH; EXPECTED TIME; REPEATED APPLICATION; SPECTRAL GRAPH THEORY;

GRAPH THEORY;

EID: 78751501372     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.29     Document Type: Conference Paper

References (42)

1. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems." in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, June 2004, pp. 81-90.
2. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng, "Lower-stretch spanning trees." in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 494-503.
3. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems," CoRR, vol. abs/cs/0607105, 2006.
4. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Math. J., vol. 23, no. 98, pp. 298-305, 1973.
5. D. A. Spielman and S.-H. Teng, "Spectral partitioning works: Planar graphs and finite element meshes." in FOCS, 1996, pp. 96-105.
6. F. Chung, Spectral Graph Theory, ser. Regional Conference Series in Mathematics. American Mathematical Society, 1997, vol. 92.
7. D. A. Spielman and N. Srivastava, "Graph sparsification by effective resistances," 2008. [Online]. Available: http://www.citebase.org/abstract? id=oai:arXiv.org:0803.0929
8. E. G. Boman, B. Hendrickson, and S. A. Vavasis, "Solving elliptic finite element systems in near-linear time with support preconditioners," CoRR, vol. cs.NA/0407022, 2004.
9. D. A. Spielman and S. I. Daitch, "Faster approximate lossy generalized flow via interior point algorithms." in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, May 2008.
10. J. A. Kelner and A. Madry, "Faster generation of random spanning trees," Foundations of Computer Science, Annual IEEE Symposium on, vol. 0, pp. 13-21, 2009.
11. I. Koutis, G. L. Miller, and D. Tolliver, "Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing," in International Symposium of Visual Computing, 2009, pp. 1067-1078.
12. I. Koutis, G. L. Miller, A. Sinop, and D. Tolliver, "Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing," CMU, Tech. Rep., 2009.
13. J. McCann and N. S. Pollard, "Real-time gradient-domain painting," ACM Trans. Graph., vol. 27, no. 3, pp. 1-7, 2008.
14. P. Joshi, M. Meyer, T. DeRose, B. Green, and T. Sanocki, "Harmonic coordinates for character articulation," ACM Trans. Graph., vol. 26, no. 3, p. 71, 2007.
15. D. A. Spielman, "Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices," in Proceedings of the International Congress of Mathematicians, 2010.
16. S.-H. Teng, "The Laplacian Paradigm: Emerging Algorithms for Massive Graphs," in Theory and Applications of Models of Computation, 2010, pp. 2-14.
17. G. Royle and C. Godsil, Algebraic Graph Theory, ser. Graduate Texts in Mathematics. Springer Verlag, 1997.
18. E. G. Boman and B. Hendrickson, "Support theory for preconditioning," SIAM J. Matrix Anal. Appl., vol. 25, no. 3, pp. 694-717, 2003.
19. K. Gremban, G. L. Miller, and M. Zagha, "Performance evaluation of a parallel preconditioner," in 9th International Parallel Processing Symposium. Santa Barbara: IEEE, April 1995, pp. 65-69.
20. K. Gremban, "Combinatorial preconditioners for sparse, symmetric, diagonally dominant linear systems," Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, October 1996, CMU CS Tech Report CMU-CS-96-123.
21. P. Vaidya, "Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners," October 1991, a talk based on this manuscript.
22. M. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo, "Support-graph preconditioners," SIAM J. Matrix Anal. Appl., vol. 27, pp. 930-951, 2005.
23. A. Joshi, "Topics in optimization and sparse linear systems," Ph.D. dissertation, University of Illinois at Urbana Champaing, 1997.
24. N. Alon, R. Karp, D. Peleg, and D. West, "A graph-theoretic game and its application to the k-server problem," SIAM J. Comput., vol. 24, no. 1, pp. 78-100, 1995.
25. 1:31)," in FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 2003, p. 416.
26. I. Abraham, Y. Bartal, and O. Neiman, "Nearly tight low stretch spanning trees," in 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 781-790.
27. 2) time Time," in STOC, 1996, pp. 47-55.
28. 1/6) time, parallel algorithm for solving planar Laplacians," in Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007.
29. -, "Graph partitioning into isolated, high conductance clusters: Theory, computation and applications to preconditioning," in Symposiun on Parallel Algorithms and Architectures (SPAA), 2008.
30. R. Andersen, F. Chung, and K. Lang, "Local graph partitioning using pagerank vectors," in FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society, 2006, pp. 475-486.
31. J. D. Batson, D. A. Spielman, and N. Srivastava, "Twice- Ramanujan sparsifiers," in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 255-262.
32. A. Kolla, Y. Makarychev, A. Saberi, and S. Teng, "Subgraph sparsification and nearly optimal ultrasparsifiers," CoRR, vol. abs/0912.1623, 2009.
33. R. Hariharan and D. Panigrahi, "A general framework for graph sparsification," CoRR, vol. abs/1004.4080, 2010.
34. M. Rudelson and R. Vershynin, "Sampling from large matrices: An approach through geometric functional analysis," J. ACM, vol. 54, no. 4, p. 21, 2007.
35. P. G. Doyle and J. L. Snell, "Random walks and electric networks," 2000.
36. R. E. Tarjan, "Applications of path compression on balanced trees," J. ACM, vol. 26, no. 4, pp. 690-715, 1979.
37. H. N. Gabow and R. E. Tarjan, "A linear-time algorithm for a special case of disjoint set union," in STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1983, pp. 246-251.
38. I. Koutis, G. L. Miller, and R. Peng, "Approaching optimality for solving SDD systems," CoRR, vol. abs/1003.2958, 2010.
39. A. George, "Nested dissection of a regular finite element mesh," SIAM Journal on Numerical Analysis, vol. 10, pp. 345-363, 1973.
40. R. Lipton, D. Rose, and R. Tarjan, "Generalized nested dissection," SIAM Journal of Numerical Analysis, vol. 16, pp. 346-358, 1979.
41. N. Alon and R. Yuster, "Solving linear systems through nested dissection," in FOCS, 51th Symposium on Foundations of Computer Science.
42. O. Axelsson, Iterative Solution Methods. New York, NY: Cambridge University Press, 1994.