Lx = b Laplacian solvers and their algorithmic applications

Foundations and Trends in Theoretical Computer Science

Volumn 8, Issue 1-2, 2012, Pages 1-141

  Vishnoi, Nisheeth K ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPLICATIONS; ASSOCIATED GRAPH; FAST ALGORITHMS; GENERAL SYSTEMS; GRAPH PROBLEMS; NUMERICAL LINEAR ALGEBRA; SYSTEM OF LINEAR EQUATIONS; UNDIRECTED GRAPH;

ALGORITHMS; DESIGN; GRAPH THEORY; LINEAR ALGEBRA; RESEARCH; TOOLS;

LAPLACE TRANSFORMS;

EID: 84883820777     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000054     Document Type: Article

References (89)

1. I. Abraham, Y. Bartal, and O. Neiman, "Nearly tight low stretch spanning trees," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 781-790, 2008.
2. I. Abraham and O. Neiman, "Using petal-decompositions to build a low stretch spanning tree," in ACM Symposium on Theory of Computing (STOC), pp. 395-406, 2012.
3. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," Journal of Computer and Systems Sciences, vol. 66, no. 4, pp. 671-687, 2003.
4. R. Ahlswede and A. Winter, "Addendum to "Strong converse for identification via quantum channels"," IEEE Transactions on Information Theory, vol. 49, no. 1, p. 346, 2003.
5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, February 1993.
6. N. Alon, R. M. Karp, D. Peleg, and D. B. West, "A graph-theoretic game and its application to the k-server problem," SIAM Journal on Computing, vol. 24, no. 1, pp. 78-100, 1995.
7. N. Alon and V. D. Milman, "λ1, isoperimetric inequalities for graphs, and superconcentrators," Journal of Combinational Theory, Series B, vol. 38, no. 1, pp. 73-88, 1985.
8. R. Andersen, F. R. K. Chung, and K. J. Lang, "Local graph partitioning using pagerank vectors," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 475-486, 2006.
9. R. Andersen and Y. Peres, "Finding sparse cuts locally using evolving sets," in ACM Symposium on Theory of Computing (STOC), pp. 235-244, 2009.
10. S. Arora, E. Hazan, and S. Kale, "O( √ logn) approximation to sparsest cut in Õ(n2) time," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 238-247, 2004.
11. S. Arora, E. Hazan, and S. Kale, "The multiplicative weights update method: A meta-algorithm and applications," Theory of Computing, vol. 8, no. 1, pp. 121-164, 2012.
12. S. Arora and S. Kale, "A combinatorial, primal-dual approach to semidefinite programs," in ACM Symposium on Theory of Computing (STOC), pp. 227-236, 2007.
13. S. Arora, S. Rao, and U. V. Vazirani, "Expander flows, geometric embeddings and graph partitioning," Journal of the ACM, vol. 56, no. 2, 2009.
14. J. D. Batson, D. A. Spielman, and N. Srivastava, "Twice-Ramanujan sparsifiers," in ACM Symposium on Theory of Computing (STOC), pp. 255-262, 2009.
15. M. Belkin, I. Matveeva, and P. Niyogi, "Regularization and semi-supervised learning on large graphs," in Proceedings of the Workshop on Computational Learning Theory (COLT), pp. 624-638, 2004.
16. A. A. Benczúr and D. R. Karger, "Approximating s-t minimum cuts in Õ(n2) time," in ACM Symposium on Theory of Computing (STOC), pp. 47-55, 1996.
17. R. Bhatia, Matrix Analysis (Graduate Texts in Mathematics). Springer, 1996.
18. E. G. Boman and B. Hendrickson, "Support theory for preconditioning," SIAM Journal on Matrix Analysis Applications, vol. 25, no. 3, pp. 694-717, 2003.
19. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, March 2004.
20. J. Cheeger, "A lower bound for the smallest eigenvalue of the Laplacian," Problems in Analysis, pp. 195-199, 1970.
21. E. W. Cheney, Introduction to Approximation Theory/E.W. Cheney. New York: McGraw-Hill, 1966.
22. P. Christiano, J. A. Kelner, A. Madry, D. A. Spielman, and S. Teng, "Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs," in ACM Symposium on Theory of Computing (STOC), pp. 273-282, 2011.
23. F. R. K. Chung, Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society, 1997.
24. S. I. Daitch and D. A. Spielman, "Faster approximate lossy generalized flow via interior point algorithms," in ACM Symposium on Theory of Computing (STOC), pp. 451-460, 2008.
25. P. G. Doyle and J. L. Snell, Random Walks and Electric Networks. Washington, DC: Mathematical Association of America, 1984.
26. P. Elias, A. Feinstein, and C. Shannon, "A note on the maximum flow through a network," IEEE Transactions on Information Theory, vol. 2, no. 4, pp. 117-119, December 1956.
27. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng, "Lower-stretch spanning trees," SIAM Journal on Computing, vol. 38, no. 2, pp. 608-628, 2008.
28. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Mathematical Journal, vol. 23, pp. 298-305, 1973.
29. L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol. 8, pp. 399-404, 1954.
30. A. Frangioni and C. Gentile, "Prim-based support-graph preconditioners for min-cost flow problems," Computational Optimization and Applications, vol. 36, no. 2-3, pp. 271-287, April 2007.
31. W. S. Fung, R. Hariharan, N. J. A. Harvey, and D. Panigrahi, "A general framework for graph sparsification," in ACM Symposium on Theory of Computing (STOC), pp. 71-80, 2011.
32. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
33. A. George, "Nested dissection of a regular finite element mesh," SIAM Journal on Numerical Analysis, vol. 10, no. 2, pp. 345-363, 1973.
34. C. D. Godsil and G. Royle, Algebraic Graph Theory. Springer, 2001.
35. G. H. Golub and C. F. Van Loan, Matrix Computations. Johns Hopkins Univ. Press, 1996.
36. G. H. Golub and M. L. Overton, "The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems," Technical Report, Stanford University, Stanford, CA, USA, 1987.
37. G. H. Golub and R. S. Varga, "Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods," Numerische Mathematik, vol. 3, pp. 157-168, 1961.
38. K. Gremban, "Combinatorial preconditioners for sparse, symmetric, diagonally dominant linear systems," PhD Thesis, Carnegie Mellon University, Pittsburgh, CMU CS Tech Report CMU-CS-96-123, October 1996.
39. M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," Journal of Research of the National Bureau of Standards, vol. 49, pp. 409-436, December 1952.
40. G. Iyengar, D. J. Phillips, and C. Stein, "Approximating semidefinite packing programs," SIAM Journal on Optimization, vol. 21, no. 1, pp. 231-268, 2011.
41. G. Iyengar, D. J. Phillips, and C. Stein, "Approximation algorithms for semidefinite packing problems with applications to maxcut and graph coloring," in IPCO'05: Proceedings of Conference on Integer Programming and Combinatorial Optimization, pp. 152-166, 2005.
42. A. Joshi, "Topics in optimization and sparse linear systems," PhD Thesis, University of Illinois at Urbana-Champaign, Champaign, IL, USA, UMI Order No. GAX97-17289, 1997.
43. S. Kaczmarz, " Ängenäherte Auflösung von Systemen linearer Gleichungen," Bulletin International del' AcadÉmie Polonaise Sciences et des Lettres, pp. 355-356, 1937.
44. S. Kale, "Efficient algorithms using the multiplicative weights update method," PhD Thesis, Princeton University, Department of Computer Science, 2007.
45. J. A. Kelner and A. Madry, "Faster generation of random spanning trees," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 13-21, 2009.
46. J. A. Kelner, G. L. Miller, and R. Peng, "Faster approximate multicommodity flow using quadratically coupled flows," in ACM Symposium on Theory of Computing (STOC), pp. 1-18, 2012.
47. J. A. Kelner, L. Orecchia, A. Sidford, and Z. A. Zhu, "A simple, combinatorial algorithm for solving SDD systems in nearly-linear time," in ACM Symposium on Theory of Computing (STOC), 2013.
48. R. Khandekar, S. Rao, and U. V. Vazirani, "Graph partitioning using single commodity flows," Journal of the ACM, vol. 56, no. 4, 2009.
49. I. Koutis, G. L. Miller, and R. Peng, "Approaching optimality for solving SDD linear systems," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 235-244, 2010.
50. I. Koutis, G. L. Miller, and R. Peng, "A nearly-mlogn time solver for SDD linear systems," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 590-598, 2011.
51. D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times. American Mathematical Society, 2006.
52. R. J. Lipton, D. J. Rose, and R. E. Tarjan, "Generalized nested dissection," SIAM Journal on Numerical Analysis, vol. 16, no. 2, pp. 346-358, 1979.
53. L. Lovász and M. Simonovits, "Random walks in a convex body and an improved volume algorithm," Random Structures & Algorithms, vol. 4, no. 4, pp. 359-412, 1993.
54. R. Lyons and Y. Peres, Probability on Trees and Networks. To Appear in Cambridge University Press, 2012.
55. A. Madry, "Fast approximation algorithms for cut-based problems in undirected graphs," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 245-254, 2010.
56. M. W. Mahoney, L. Orecchia, and N. K. Vishnoi, "A spectral algorithm for improving graph partitions," Journal of Machine Learning Research, vol. 13, pp. 2339-2365, 2012.
57. S. Maji, N. K. Vishnoi, and J. Malik, "Biased normalized cuts," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2057-2064, 2011.
58. M. Mihail, "Conductance and convergence of markov chains - a combinatorial treatment of expanders," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 526-531, 1989.
59. L. Orecchia, "Fast approximation algorithms for graph partitioning using spectral and semidefinite-programming techniques," PhD Thesis, EECS Department, University of California, Berkeley, May 2011.
60. L. Orecchia, S. Sachdeva, and N. K. Vishnoi, "Approximating the exponential, the Lanczos method and an Õ(m)-time spectral algorithm for balanced separator," in ACM Symposium on Theory of Computing (STOC), pp. 1141-1160, 2012.
61. L. Orecchia, L. J. Schulman, U. V. Vazirani, and N. K. Vishnoi, "On partitioning graphs via single commodity flows," in ACM Symposium on Theory of Computing (STOC), pp. 461-470, 2008.
62. L. Orecchia and N. K. Vishnoi, "Towards an SDP-based approach to spectral methods: A nearly-linear-time algorithm for graph partitioning and decomposition," in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 532-545, 2011.
63. V. Y. Pan and Z. Q. Chen, "The complexity of the matrix eigenproblem," in ACM Symposium on Theory of Computing (STOC), pp. 507-516, 1999.
64. L. F. Richardson, "The approximate arithmetical solution by finite differences of physical problems involving differential equations with an application to the stresses in a masonry dam," Transactions of the Royal Society of London, vol. Series A, no. 210, pp. 307-357, 1910.
65. T. J. Rivlin, An Introduction to the Approximation of Functions. Blaisdell book in numerical analysis and computer science. Blaisdell Pub. Co., 1969.
66. M. Rudelson, "Random vectors in the isotropic position," Journal of Functional Analysis, vol. 164, no. 1, pp. 60-72, 1999.
67. Y. Saad, "Analysis of some Krylov subspace approximations to the matrix exponential operator," SIAM Journal on Numerical Analysis, vol. 29, pp. 209-228, February 1992.
68. Y. Saad, Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics. Philadelphia, PA, USA, 2nd Edition, 2003.
69. S. Sachdeva and N. K. Vishnoi, "Inversion is as easy as exponentiation," manuscript, 2012.
70. E. B. Saff, A. Schonhage, and R. S. Varga, "Geometric convergence to e-z by rational functions with real poles," Numerische Mathematik, vol. 25, pp. 307-322, 1975.
71. J. Sherman, "Breaking the multicommodity flow barrier for O( √ logn)- approximations to sparsest cut," in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 2009.
72. J. R. Shewchuk, "An introduction to the conjugate gradient method without the agonizing pain," Technical Report, Carnegie Mellon University, Pittsburgh, PA, USA, 1994.
73. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, pp. 888-905, 1997.
74. D. B. Shmoys, Cut Problems and Their Application to Divide-and-Conquer. pp. 192-235, 1997.
75. D. A. Spielman, "Algorithms, graph theory, and linear equations in Laplacian matrices," in Proceedings of International Congress of Mathematicians (ICM'10), 2010.
76. D. A. Spielman and N. Srivastava, "Graph sparsification by effective resistances," SIAM Journal on Computing, vol. 40, no. 6, pp. 1913-1926, 2011.
77. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems," in ACM Symposium on Theory of Computing (STOC), pp. 81-90, New York, NY, USA, 2004.
78. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems," CoRR, abs/cs/0607105, 2006.
79. D. A. Spielman and S.-H. Teng, "A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning," CoRR, abs/0809.3232, 2008.
80. D. A. Spielman and S.-H. Teng, "Spectral sparsification of graphs," SIAM Journal on Computing, vol. 40, no. 4, pp. 981-1025, 2011.
81. D. A. Spielman and J.Woo, "A note on preconditioning by low-stretch spanning trees," CoRR, abs/0903.2816, 2009.
82. G. Strang, Linear Algebra and Its Applications. Harcourt Brace Jonanovich. San Diego, 3rd Edition, 1988.
83. T. Strohmer and R. Vershynin, "A randomized Kaczmarz algorithm with exponential convergence," Journal of Fourier Analysis and Applications, vol. 15, pp. 262-278, 2009.
84. S. Teng, "The Laplacian paradigm: Emerging algorithms for massive graphs," in Proceedings of the Annual Conference on Theory and Applications of Models of Computation (TAMC), pp. 2-14, 2010.
85. L. N. Trefethen and D. Bau, Numerical Linear Algebra. SIAM, 1997.
86. P. M. Vaidya, "Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners," Technical Report, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1990.
87. J. vanden Eshof and M. Hochbruck, "Preconditioning Lanczos approximations to the matrix exponential," SIAM Journal on Scientific Computing, vol. 27, pp. 1438-1457, November 2005.
88. J. H. Wilkinson, The Algebraic Eigenvalue Problem (Monographs on Numerical Analysis). USA: Oxford University Press, 1st Edition, April 1988.
89. X. Zhu, Z. Ghahramani, and J. D. Lafferty, "Semi-supervised learning using Gaussian fields and harmonic functions," in Proceedings of the International Conference on Machine Learning (ICML), pp. 912-919, 2003.