Lean algebraic multigrid (LAM G): Fast graph Laplacian linear solver

SIAM Journal on Scientific Computing

Volumn 34, Issue 4, 2012, Pages

  Livne, Oren E ^a   Brandt, Achi ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Aggregation based algebraic multigrid; Graph Laplacian; High performance computing; Linear scaling numerical linear solvers; Piecewise constant interpolation operator

Indexed keywords

CLUSTERING ALGORITHMS; DIGITAL STORAGE; FLOW GRAPHS; INTERPOLATION; ITERATIVE METHODS; LAPLACE TRANSFORMS; LEARNING SYSTEMS; LINEAR SYSTEMS; ORDINARY DIFFERENTIAL EQUATIONS; PARTIAL DIFFERENTIAL EQUATIONS;

AGGREGATION-BASED ALGEBRAIC MULTIGRID; ALGEBRAIC MULTIGRIDS; GRAPH LAPLACIAN; HIGH-PERFORMANCE COMPUTING; LAPLACIAN MATRICES; LINEAR SOLVER; LINEAR-SCALING NUMERICAL LINEAR SOLVERS; MULTIGRIDS; PERFORMANCE COMPUTING; PIECEWISE-CONSTANT INTERPOLATION OPERATORS;

WEBSITES;

EID: 84866370417     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/110843563     Document Type: Article

References (67)

1. P. R. AMESTOY, T. A. DAVIS, AND I. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. D. BAI AND A. BRANDT, Local mesh refinement multilevel techniques, SIAM J. Sci. Stat. Comput., 8 (1987), pp. 109-134.
3. C. BEKAS AND Y. SAAD, Computation of smallest eigenvalues using spectral Schur complements, SIAM J. Sci. Comput., 27 (2005), pp. 458-481.
4. M. BLATT, A Parallel Algebraic Multigrid Method for Elliptic Problems with Highly Discontinuous Coefficients, Ph.D. thesis, Universität Heidelberg, Heidelberg, Germany, 2010.
5. M. BOLTEN, A. BRANDT, J. BRANNICK, A. FROMMER, K. KAHL, AND I. LIVSHITS, A bootstrap algebraic multilevel method for Markov chains, SIAM J. Sci. Comput., 33 (2011), pp. 3425-3446.
6. E. G. BOMAN, D. CHEN, B. HENDRICKSON, AND S. TOLEDO, Maximum-weight-basis preconditioners, Numer. Linear Algebra Appl., 11 (2004), pp. 695-721.
7. E. G. BOMAN, B. HENDRICKSON, AND S. VAVASIS, Solving elliptic finite element systems in near-linear time with support preconditioners, SIAM J. Numer. Anal., 46 (2008), pp. 3264-3284.
8. D. BRAESS, Towards algebraic multigrid for elliptic problems of second order, Computing, 55 (1995), pp. 379-393.
9. 2-norm, SIAM J. Numer. Anal., 31 (1994), pp. 1695-1730.
10. A. BRANDT, General highly accurate algebraic coarsening, J. Electron. Trans. Numer. Anal., 10 (2000), pp. 1-20.
11. A. BRANDT, Multiscale scientific computation: Review2001, in Multiscale and Multiresolution Methods, T. Barth, T. Chan, and R. Haimes, eds., Springer-Verlag, Berlin, 2002, pp. 3-96.
12. A. BRANDT, J. BRANNICK, K. KAHL, AND I. LIVSHITS, An algebraic distances measure of AMG strength of connection, preprint, arXiv:1106.5990v1, 2011.
13. A. BRANDT, J. BRANNICK, K. KAHL, AND I. LIVSHITS, Bootstrap AMG, SIAM J. Sci. Comput., 33 (2011), pp. 612-632.
14. A. BRANDT AND O. E. LIVNE, Multigrid Techniques: 1984 Guide with Applications to Fluid Dynamics, revised ed., Classics Appl. Math. 67, SIAM, Philadelphia, 2011.
15. A. BRANDT, S. MCCORMICK, AND J. W. RUGE, Algebraic Multigrid (AMG) for Automatic Multigrid Solution with Application to Geodetic Computations, Tech. report, Colorado State University, Fort Collins, CO, 1983.
16. J. J. BRANNICK AND R. D. FALGOUT, Compatible relaxation and coarsening in algebraic multi-grid, SIAM J. Sci. Comput., 32 (2010), pp. 1393-1416.
17. M. BREZINA, R. FALGOUT, S. MACLACHLAN, T. MANTEUFFEL, S. MCCORMICK, AND J. RUGE, Adaptive smoothed aggregation (αSA), SIAM J. Sci. Comput., 25 (2004), pp. 1896-1920.
18. M. BREZINA, C. KETELSEN, T. MANTEUFFEL, S. MCCORMICK, M. PARK, AND J. RUGE, Relaxation-corrected bootstrap algebraic multigrid (rBAMG), Numer. Linear Algebra Appl., 19 (2012), pp. 178-193.
19. M. BREZINA, P. VANEK, AND P. S. VASSILEVSKI, An improved convergence analysis of smoothed aggregation algebraic multigrid, Numer. Linear Algebra Appl., 3 (2011), pp. 441-469.
20. H. CHANG AND D. YEUNG, Graph Laplacian kernels for object classification from a single example, in Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol. 2, New York, NY, 2006, pp. 2011-2016.
21. F. R. K. CHUNG, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 9, American Mathematical Society, Providence, RI, 1997.
22. R. COIFMAN AND S. LAFON, Diffusion maps, Appl. Comput. Harmon. Anal., 21 (2006), pp. 5-30.
23. S. I. DAITCH AND D. A. SPIELMAN, Faster Approximate lossy generalized flow via interior point algorithms, preprint, arXiv:0803.0988v2, 2008.
24. T. DAVIS, MATLAB Primer, 8th ed., Taylor and Francis Group, CRC Press, Boca Raton, FL, 2010.
25. T. A. DAVIS AND Y. HU, University of Florida Sparse Matrix Collection, ACM Trans. Math. Software, 38 (2011), 1.
26. DIMACS CENTER AT RUTGERS UNIVERSITY, Dimacs Implementation Challenges, 2011. http://dimacs.rutgers.edu/Challenges/ (2011).
27. C. H. Q. DING, X. HE, H. ZHA, M. GU, AND H. D. SIMON, A min-max cut algorithm for graph partitioning and data clustering, in Proceedings of the IEEE International Conference on Data Mining, San Jose, CA, 2001, pp. 107-114.
28. N. DRAPER AND H. SMITH, Applied Regression Analysis, Wiley-Interscience, New York, 1998.
29. J. ELLSON, E. R. GANSNER, E. KOUTSOFIOS, S. C. NORTH, AND G. WOODHULL, Graphviz-open source graph drawing tools, in Proceedings of the 9th International Symposium on Graph Drawing, Lecture Notes in Comput. Sci. 2265, Springer, Berlin, 2002, pp. 483-484.
30. R. FALGOUT, A. CLEARY, J. JONES, E. CHOW, V. HENSON, C. BALDWIN, P. BROWN, P. VASSILEVSKI, AND U. M. YANG, Hypre Reference Manual 2.7.0b, https://computation.llnl.gov/casc/hypre/download/hypre-2.7.0b-ref-manual.pdf (2011).
31. P. FISCHER, J. LOTTES, D. POINTER, AND A. SIEGEL, Petascale algorithms for reactor hydrodynamics, J. Phys. Conf. Ser., 125 (2008), 012076.
32. A. FRANGIONI AND C. GENTILE, Prim-based support-graph preconditioners for min-cost flow problems, Comput. Optim. Appl., 36 (2007), pp. 271-287.
33. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
34. D. GLEICH AND C. SESHADHRI, Neighborhoods are good communities, preprint, arXiv:1112.0031v1, 2011.
35. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins Stud. Math. Sci., Johns Hopkins University Press, Baltimore, MD, 1996.
36. L. GORELICK, M. GALUN, E. SHARON, R. BASRI, AND A. BRANDT, Shape representation and classification using the Poisson equation, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 1991-2005.
37. B. HENDRICKSON AND R. LELAND, The Chaco User's Guide: Version 2.0, Tech. report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1994.
38. M. A. HEROUX, R. A. BARTLETT, V. E. HOWLE, R. J. HOEKSTRA, J. J. HU, T. G. KOLDA, R. B. LEHOUCQ, K. R. LONG, R. P. PAWLOWSKI, E. T. PHIPPS, A. G. SALINGER, H. K. THORNQUIST, R. S. TUMINARO, J. M. WILLENBRING, A. WILLIAMS, AND K. S. STANLEY, An overview of the Trilinos project, ACM Trans. Math. Softw., 31 (2005), pp. 397-423.
39. A. V. KNYAZEV, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
40. I. KOUTIS AND G. L. MILLER, Graph partitioning into isolated, high conductance clusters: Theory, computation and applications to preconditioning, in Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, ACM, New York, 2008, pp. 137-145.
41. I. KOUTIS, G. L. MILLER, AND R. PENG, Approaching optimality for solving SDD linear systems, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS '10), Washington, DC, 2010, pp. 235-244.
42. I. KOUTIS, G. L. MILLER, AND D. TOLLIVER, Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing, in Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I (ISVC '09), SpringerVerlag, Berlin, Heidelberg, 2009, pp. 1067-1078.
43. D. KUSHNIR, M. GALUN, AND A. BRANDT, Fast multiscale clustering and manifold identification, Pattern Recognition, 39 (2006), pp. 1876-1891.
44. D. KUSHNIR, M. GALUN, AND A. BRANDT, Efficient multilevel eigensolvers with applications to data analysis tasks, IEEE Trans. Pattern Anal. Mach. Intell., 32 (2010), pp. 1377-1391.
45. A. B. LEE, D. LUCA, L. KLEI, B. DEVLIN, AND K. ROEDER, Discovering genetic ancestry using spectral graph theory, Genet. Epidem., 34 (2010), pp. 51-59.
46. R. J. LIPTON, D. J. ROSE, AND R. E. TARJAN, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
47. O. E. LIVNE, Coarsening by compatible relaxation, Numer. Linear Algebra Appl., 11 (2004), pp. 205-227.
48. O. E. LIVNE, Lean Algebraic Multigrid (LAMG) MATLAB Software, Release 2.1.1, http://lamg.googlecode.com (2012).
49. O. E. LIVNE AND A. BRANDT, Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver, preprint, http://arxiv:1108.0123, 2011.
50. I. LIVSHITS AND A. BRANDT, Accuracy properties of the wave-ray multigrid algorithm for Helmholtz equations, SIAM J. Sci. Comput., 28 (2006), pp. 1228-1251.
51. C. B. MOLER, Numerical Computing with MATLAB, SIAM, Philadelphia, 2004.
52. Y. NOTAY, An aggregation-based algebraic multigrid method, Elec. Trans. Numer. Anal., 37 (2010), pp. 123-146.
53. Y. NOTAY, Aggregation-based Algebraic Multigrid for Convection-Diffusion Equations, Tech. report GANMN 11-01, Université Libre de Bruxelles, Brussels, Belgium, 2011.
54. L. N. OLSON, J. B. SCHRODER, AND R. S. TUMINARO, A general interpolation strategy for algebraic multigrid using energy minimization, SIAM J. Sci. Comput., 33 (2011), pp. 966-991.
55. D. RON, I. SAFRO, AND A. BRANDT, Relaxation-based coarsening and multiscale graph organization, Multiscale Model. Simul., 9 (2011), pp. 407-423.
56. J. W. RUGE AND K. STÜBEN, Algebraic multigrid, in Multigrid Methods, Frontiers Appl. Math. 3, S. F. McCormick, ed., SIAM, Philadelphia, 1987, pp. 73-130.
57. I. SAFRO, Minimum Logarithmic Arrangement (MinLogA) Results Archive, http://www.mcs.anl.gov/~safro/mloga.html (2011).
58. R. SEDGEWICK, Algorithms in C++, Part 5: Graph Algorithms, Addison-Wesley, Reading, MA, 2002.
59. A. SHARMA, R. P. HORAUD, D. KNOSSOW, AND E. VON LAVANTE, Mesh segmentation using Laplacian eigenvectors and Gaussian mixtures, in Proceedings of the AAAI Fall Symposium on Manifold Learning and Its Applications, Fall Symposium Series Technical Reports (Arlington, VA), AAAI Press, San Jose, CA, 2009, pp. 50-56.
60. E. SHARON, M. GALUN, D. SHARON, R. BASRI, AND A. BRANDT, Hierarchy and adaptivity in segmenting visual scenes, Nature, 442 (2006), pp. 810-813.
61. D. A. SPIELMAN, Algorithms, graph theory, and linear equations in Laplacian matrices, in Proceedings of the International Congress of Mathematicians 2010 (ICM 2010), World Scientific, River Edge, NJ, 2010, pp. 2698-2722.
62. D. A. SPIELMAN AND S.-H. TENG, Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems, preprint, arXiv:CS/0607105v4, 2009.
63. R. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
64. W. F. TINNEY AND J. W. WALKER, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proc. IEEE, 55 (1967), pp. 1801-1809.
65. U. TROTTENBERG, C. W. OOSTERLEE, AND A. SCHÜLLER, Multigrid, Academic Press, London, 2000.
66. C. WALSHAW, Multilevel refinement for combinatorial optimisation problems, Ann. Oper. Res., 131 (2004), pp. 325-372.
67. X. ZHU, Z. GHAHRAMANI, AND J. D. LAFFERTY, Semi-supervised learning using Gaussian fields and harmonic functions, in Proceedings of the 20th International Conference on Machine Learning (Washington, DC), AAAI Press, San Jose, CA, 2003, pp. 912-919.