Fast sparse Cholesky decomposition and inversion using nested dissection matrix reordering

Journal of Chemical Theory and Computation

Volumn 7, Issue 2, 2011, Pages 351-368

  Brandhorst, Kai ^a   Head Gordon, Martin ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79951486647     PISSN: 15499618     EISSN: 15499626     Source Type: Journal    
DOI: 10.1021/ct100618s     Document Type: Article

References (125)

1. Beebe, N. H. F.; Linderberg, J. Simplifications in the generation and transformation of two-electron integrals in molecular calculations Int. J. Quantum Chem. 1977, 12, 683-705
2. RØeggen, I.; WislØff-Nilssen, E. On the Beebe-Linderberg two-electron integral approximation Chem. Phys. Lett. 1986, 132, 154-160
3. O'Neal, D.; Simons, J. Application of Cholesky-like matrix decomposition methods to the evaluation of atomic orbital integrals and integral derivatives Int. J. Quantum Chem. 1989, 36, 673-688
4. Koch, H.; Sánchez de Merás, A.; Pedersen, T. B. Reduced scaling in electronic structure calculations using Cholesky decompositions J. Chem. Phys. 2003, 118, 9481-9484
5. Aquilante, F.; Pedersen, T. B.; Lindh, R. Low-cost evaluation of the exchange Fock matrix from Cholesky and density fitting representations of the electron repulsion integrals J. Chem. Phys. 2007, 126, 194106
6. III (diiminato)(NPh) J. Chem. Theory Comput. 2008, 4, 694-702
7. Aquilante, F.; Lindh, R.; Pedersen, T. B. Analytic derivatives for the Cholesky representation of the two-electron integrals J. Chem. Phys. 2008, 129 034106
8. RØeggen, I.; Johansen, T. Cholesky decomposition of the two-electron integral matrix in electronic structure calculations J. Chem. Phys. 2008, 128, 194107
9. Weigend, F.; Kattannek, M.; Ahlrichs, R. Approximated electron repulsion integrals: Cholesky decomposition versus resolution of the identity methods J. Chem. Phys. 2009, 130, 164106
10. Chwee, T. S.; Carter, E. A. Cholesky decomposition within local multireference singles and doubles configuration interaction J. Chem. Phys. 2010, 132 074104
11. Millam, J. M.; Scuseria, G. E. Linear scaling conjugate gradient density matrix search as an alternative to diagonalization for first principles electronic structure calculations J. Chem. Phys. 1997, 106, 5569-5577 (Pubitemid 127590352)
12. Schweizer, S.; Kussmann, J.; Doser, B.; Ochsenfeld, C. Linear-Scaling Cholesky decomposition J. Comput. Chem. 2008, 29, 1004-1010 (Pubitemid 351473696)
13. Aquilante, F.; Bondo Pedersen, T.; Sánchez de Merás, A.; Koch, H. Fast noniterative orbital localization for large molecules J. Chem. Phys. 2006, 125, 174101
14. Zienau, J.; Clin, L.; Doser, B.; Ochsenfeld, C. Cholesky-decomposed densities in Laplace-based second-order MØller-Plesset perturbation theory J. Chem. Phys. 2009, 130, 204112
15. Farkas, O.; Schlegel, B. H. Geometry optimization methods for modeling large molecules J. Mol. Struct. Theochem 2003, 666-667, 31-39
16. Aquilante, F.; Pedersen, T. B. Quartic scaling evaluation of canonical scaled opposite spin second-order MØller Plesset correlation energy using Cholesky decompositions Chem. Phys. Lett. 2007, 449, 354-357 (Pubitemid 350160618)
17. Jung, Y.; Lochan, R. C.; Dutoi, A. D.; Head-Gordon, M. Scaled opposite-spin second or-der MØller-Plesset correlation energy: An economical electronic structure method J. Chem. Phys. 2004, 121, 9793-9802 (Pubitemid 40001633)
18. Aquilante, F.; Lindh, R.; Bondo Pedersen, T. Unbiased auxiliary basis sets for accurate two-electron integral approximations J. Chem. Phys. 2007, 127, 114107
19. Boman, L.; Koch, H.; Sánchez de Merás, A. Method specific Cholesky decomposition: Coulomb and exchange energies J. Chem. Phys. 2008, 129, 134107
20. Aquilante, F.; Gagliardi, L.; Pedersen, T. B.; Lindh, R. Atomic Cholesky decompositions: A route to unbiased auxiliary basis sets for density fitting approximation with tunable accuracy and efficiency J. Chem. Phys. 2009, 130, 154107
21. Li, X.-P.; Nunes, R. W.; Vanderbilt, D. Density-matrix electronic-structure method with linear system-size scaling Phys. Rev. B: Condens. Matter Mater. Phys. 1993, 47, 10891-10894
22. Challacombe, M. A simplified density matrix minimization for linear scaling self-consistent field theory J. Chem. Phys. 1999, 110, 2332-2342 (Pubitemid 129615083)
23. Nunes, R. W.; Vanderbilt, D. Generalization of the density-matrix method to a nonorthogonal basis Phys. Rev. B: Condens. Matter Mater. Phys. 1994, 50, 17611-17614
24. Daniels, A. D.; Millam, J. M.; Scuseria, G. E. Semiempirical methods with conjugate gradient density matrix search to replace diagonalization for molecular systems containing thousands of atoms J. Chem. Phys. 1997, 107, 425-431
25. Bates, K. R.; Daniels, A. D.; Scuseria, G. E. Comparison of conjugate gradient density matrix search and Chebyshev expansion methods for avoiding diagonalization in large-scale electronic structure calculations J. Chem. Phys. 1998, 109, 3308-3312 (Pubitemid 128678233)
26. Daniels, A. D.; Scuseria, G. E. What is the best alternative to diagonalization of the Hamiltonian in large scale semiempirical calculations? J. Chem. Phys. 1999, 110, 1321-1328 (Pubitemid 129614666)
27. Helgaker, T.; Larsen, H.; Olsen, J.; JØrgensen, P. Direct optimization of the AO density matrix in Hartree-Fock and Kohn-Sham theories Chem. Phys. Lett. 2000, 327, 397-403
28. Larsen, H.; Olsen, J.; JØrgensen, P.; Helgaker, T. Direct optimization of the atomic-orbital density matrix using the conjugate-gradient method with a multilevel preconditioner J. Chem. Phys. 2001, 115, 9685-9697 (Pubitemid 33147329)
29. Ochsenfeld, C.; Head-Gordon, M. A reformulation of the coupled perturbed self-consistent field equations entirely within a local atomic orbital density matrix-based scheme Chem. Phys. Lett. 1997, 270, 399-405 (Pubitemid 127160955)
30. Shao, Y.; Saravanan, C.; Head-Gordon, M. Curvy steps for density matrix-based energy minimization: Application to large-scale self-consistent-field calculations J. Chem. Phys. 2003, 118, 6144-6151
31. Head-Gordon, M.; Shao, Y.; Saravanan, C.; White, C. A. Curvy steps for density matrix based energy minimization: tensor formulation and toy applications Mol. Phys. 2003, 101, 37-43
32. Ochsenfeld, C.; Kussmann, J.; Koziol, F. Ab Initio NMR Spectra for Molecular Systems with a Thousand and More Atoms: A Linear-Scaling Method Angew. Chem. 2004, 116, 4585-4589
33. Ochsenfeld, C.; Kussmann, J.; Koziol, F. Ab Initio NMR Spectra for Molecular Systems with a Thousand and More Atoms: A Linear-Scaling Method Angew. Chem., Int. Ed. 2004, 43, 4485-4489 (Pubitemid 39257387)
34. Guidon, M.; Hutter, J.; Vande Vondele, J. Auxiliary Density Matrix Methods for Hartree-Fock Exchange Calculations J. Chem. Theory Comput. 2010, 6, 2348-2364
35. Head-Gordon, M.; Maslen, P. E.; White, C. A. A tensor formulation of many-electron theory in a nonorthogonal single-particle basis J. Chem. Phys. 1998, 108, 616-625 (Pubitemid 128598577)
36. Scuseria, G. E. Linear Scaling Density Functional Calculations with Gaussian Orbitals J. Phys. Chem. A 1999, 103, 4782-4790 (Pubitemid 129571005)
37. Jansík, B.; HØst, S.; JØrgensen, P.; Olsen, J.; Helgaker, T. Linear-scaling symmetric square-root decomposition of the overlap matrix J. Chem. Phys. 2007, 126, 124104
38. Basic Linear Algebra Subprograms; http://www.netlib.org/blas. Accessed December 02, 2010.
39. Linear Algebra Package; http://www.netlib.org/lapack. Accessed December 02, 2010.
40. Shao, Y. Advances in methods and algorithms in a modern quantum chemistry program package Phys. Chem. Chem. Phys. 2006, 8, 3172-3191
41. George, A. In Algorithms for Large Scale Linear Algebraic Systems; NATO ASI Series C: Mathematical and Physical Sciences; Althaus, G. W.; Spedicato, E., Eds.; Kluwer Academic Publishers: New York, 1998; Vol. 508; pp 73 - 105.
42. Chen, Y.; Davis, T. A.; Hager, W. W.; Rajamanickam, S. Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate ACM T. Math. Software 2008, 35, 22:1-14
43. Davis, T. A.; Hager, W. W. Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves ACM T. Math. Software 2009, 35, 27:1-23
44. Schenk, O. Scalable Parallel Sparse LU Factorization Methods on Shared Memory Multiprocessors. Ph.D. thesis, ETH Zürich, 2000
45. Schenk, O.; Gärtner, K. Solving unsymmetric sparse systems of linear equations with PARDISO Future Generat. Comput. Syst. 2004, 20, 475-487
46. Schenk, O.; Gärtner, K. On Fast Factorization Pivoting Methods for Sparse Symmetric Indefinite Systems Electron. T. Numer. Ana. 2006, 23, 158-179 (Pubitemid 46092256)
47. Liang, W.; Head-Gordon, M. An exact reformulation of the diagonalization step in electronic structure calculations as a set of second order nonlinear equations J. Chem. Phys. 2004, 120, 10379-10384
48. Higham, N. J. Cholesky factorization WIREs Comput. Stat. 2009, 1, 251-254
49. Higham, N. J. In Reliable Numerical Computation; Cox, M. G.; Hammarling, S. J., Eds.; Oxford University Press: Oxford, U.K., 1990; pp 161 - 185.
50. Gilbert, J. R. Predicting Structure in Sparse Matrix Computations SIAM J. Matrix Anal. Appl. 1994, 15, 62-79
51. Higham, N. J.; Pothen, A. Stability of the partitioned inverse method for parallel solution of sparse triangular systems SIAM J. Sci. Comput. 1994, 15, 139-148
52. Tinney, W.; Walker, J. Direct solutions of sparse network equations by optimally ordered triangular factorization Proc. IEEE 1967, 55, 1801-1809
53. George, A.; Liu, J. W.-H. Computer Solution of Large Sparse Positive Definite Systems; Prentice-Hall: Englewood Cliffs, NJ, 1981.
54. George, A.; Liu, J. W. H. An optimal algorithm for symbolic factorization of symmetric matrices SIAM J. Comput. 1980, 9, 583-593
55. Ng, E.; Peyton, B. W. A supernodal Cholesky factorization algorithm for shared-memory multiprocessors SIAM J. Sci. Comput. 1993, 14, 761-769
56. Liu, J. W. H.; Ng, E. G.; Peyton, B. W. On finding supernodes for sparse matrix computations SIAM J. Matrix Anal. Appl. 1993, 14, 242-252
57. Liu, J. W. H. The role of elimination trees in sparse factorization SIAM J. Matrix Anal. Appl. 1990, 11, 134-172
58. Rose, D. J.; Tarjan, R. E.; Lueker, G. S. Algorithmic aspects of vertex elimination SIAM J. Comput. 1976, 5, 266-283
59. Tarjan, R. E.; Yannakakis, M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM J. Comput. 1984, 13, 566-579 (Pubitemid 15514404)
60. Yannakakis, M. Computing the minimum fill-in is NP-complete SIAM J. Alg. Disc. Meth. 1981, 2, 77-79
61. Cuthill, E.; McKee, J. Reducing the bandwidth of sparse symmetric matrices. 1969
62. Chan, W. M.; George, A. A linear time implementation of the reverse Cuthill-McKee algorithm BIT 1980, 20, 8-14 (Pubitemid 10482449)
63. Biermann, M. Erkennen von Graphenklassen mittels lexikographischer Breitensuche. M. Sc. Thesis, FernUniversität Hagen, 2007.
64. Liu, J. W. H. Modification of the minimum-degree algorithm by multiple elimination ACM T. Math. Software 1985, 11, 141-153
65. George, A.; Liu, W. H. The evolution of the minimum degree ordering algorithm SIAM Rev. 1989, 31, 1-19 (Pubitemid 20625354)
66. Amestoy, P. R.; Davis, T. A.; Duff, I. S. An Approximate Minimum Degree Ordering Algorithm SIAM J. Matrix Anal. Appl. 1996, 17, 886-905
67. Khaira, M. S.; Miller, G. L.; Sheffler, T. J. Nested Dissection: A survey and comparison of various nested dissection algorithms; Technical report, Carnegie Mellon University, Pittsburgh, PA, USA, 1992.
68. George, A. Nested Dissection of a regular finite element mesh SIAM J. Numer. Anal. 1973, 10, 345-363
69. Armon, D.; Reif, J. Space and time efficient implementations of parallel nested dissection. In SPAA '92: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, 1992; pp 344 - 352. (Pubitemid 23624544)
70. Pothen, A.; Rothberg, E.; Simon, H.; Wang, L. Parallel sparse Cholesky factorization with spectral nested dissection ordering. In Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, 1994; pp 418 - 422.
71. Schulze, J.; Diekmann, R.; Preis, R. Comparing nested dissection orderings for parallel sparse matrix factorization. In Proceedings of PDPTA '95, CSREA 96-1103, 1995; pp 280 - 289.
72. Bornstein, C. F.; Maggs, B. M.; Miller, G. L. Tradeoffs between parallelism and fill in nested dissection. In SPAA '99: Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, 1999; pp 191 - 200.
73. Boman, E. G.; Wolf, M. M. A nested dissection approach to sparse matrix partitioning for parallel computations. Technical report, Sandia National Laboratories, NM, 2008.
74. Karypis, G.; Kumar, V. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs SIAM J. Sci. Comput. 1998, 20, 359-392 (Pubitemid 128689516)
75. Kussmann, J.; Ochsenfeld, C. Linear-scaling method for calculating nuclear magnetic resonance chemical shifts using gauge-including atomic orbitals within Hartree-Fock and density-functional theory J. Chem. Phys. 2007, 127 054103
76. Kussmann, J.; Ochsenfeld, C. A density matrix-based method for the linear-scaling calculation of dynamic second- and third-order properties at the Hartree-Fock and Kohn-Sham density functional theory levels J. Chem. Phys. 2007, 127, 204103
77. Heggernes, P.; Eisenstat, S. C.; Kumfert, G.; Pothen, A. The computational complexity of the minimum degree algorithm. In Proceedings of 14th Norwegian Computer Science Conference, NIK 2001, University of Troms, Norway. Also available as ICASE Report 2001-42, NASA/CR2001-211421, NASA Langley Research, pages 98-109.
78. Conroy, J. M. Parallel nested dissection Parallel Comput. 1990, 16, 139-156
79. Liu, J. W. A compact row storage scheme for Cholesky factors using elimination trees ACM T. Math. Software 1986, 12, 127-148
80. Tarjan, R. E. Efficiency of a Good But Not Linear Set Union Algorithm J. ACM 1975, 22, 215-225
81. Tarjan, R. E. Applications of Path Compression on Balanced Trees J. ACM 1979, 26, 690-715
82. Tarjan, R. E. Data Structures and Network Algorithms Number 44 in CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983
83. Gilbert, J. R.; Ng, E. G.; Peyton, B. W. An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization SIAM J. Matrix Anal. Appl. 1994, 15, 1075-1091
84. Ackermann, W. Zum Hilbertschen Aufbau der reellen Zahlen Math. Ann. 1928, 99, 118-133
85. Anderson, R. J.; Woll, H. Wait-free parallel algorithms for the union-find problem. In STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of computing, New York, NY, USA, 1991; pp 370-380.
86. Tarjan, R. Depth-First Search and Linear Graph Algorithms SIAM J. Comput. 1972, 1, 146-160
87. Zmijewski, E.; Gilbert, J. A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor Parallel Comput. 1988, 7, 199-210 (Pubitemid 18648056)
88. Lewis, J. G.; Peyton, B. W.; Pothen, A. A fast algorithm for reordering sparse matrices for parallel factorization SIAM J. Sci. Stat. Comput. 1989, 10, 1146-1173
89. Geist, G. A.; Ng, E. Task scheduling for parallel sparse Cholesky factorization Int. J. Parallel Program. 1990, 18, 291-314
90. Gupta, A.; Kumar, V. A scalable parallel algorithm for sparse Cholesky factorization. In Proceedings of the 1994 ACM/IEEE conference on Supercomputing, Washington, D.C., 1994; pp 793-802
91. Rothberg, E.; Schreiber, R. Improved load distribution in parallel sparse Cholesky factorization. In Proceedings of the 1994 ACM/IEEE conference on Supercomputing, Washington, D.C., 1994; pp 783-792
92. Kumar, B.; Eswar, K.; Sadayappan, P.; Huang, C.-H. A reordering and mapping algorithm for parallel sparse Cholesky factorization. In Proc. Scalable High Performance Computing Conference, 1994.
93. Liu, J. W. H. Reordering sparse matrices for parallel elimination Parallel Comput. 1989, 11, 73-91
94. Liu, J. W. H. Equivalent sparse matrix reordering by elimination tree rotations SIAM J. Sci. Stat. Comput. 1988, 9, 424-444
95. Bird, R. S. On building trees with minimum height J. Funct. Program. 1997, 7, 441-445
96. Hsu, C.-H.; Peng, S.-L.; Shi, C.-H. Constructing a minimum height elimination tree of a tree in linear time Inf. Sci. 2007, 177, 2473-2479 (Pubitemid 46528946)
97. Manne, F. Reducing The Height Of An Elimination Tree Through Local Reorderings; Technical Report CS-51-91, University of Bergen, Norway, 1991.
98. Pothen, A. The complexity of optimal elimination trees; Technical Report CS-88-16, Pennsylvania State University, USA, 1988.
99. Benzi, M.; Tuma, M. Orderings for Factorized Sparse Approximate Inverse Preconditioners SIAM J. Sci. Comput. 2000, 21, 1851-1868
100. Dongarra, J. In Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide; Bai, Z.; Demmel, J.; Dongarra, J.; Ruhe, A.; van der Vorst, H., Eds.; SIAM: Philadelphia, PA, 2000.
101. van Grondelle, J. Symbolic Sparse Cholesky Factorisation Using Elimination Trees. M.Sc. Thesis, Utrecht University, 1999.
102. Flake, J. Getting the Best from your Cache Architecture Info. Quarterly 2004, 3, 14-15
103. Patterson, D. A.; Hennessy, J. Computer Organization and Design; Morgan Kaufmann Publishers Inc.: San Francisco, CA, 2004.
104. Goto, K.; van de Geijn, R. On reducing TLB misses in matrix multiplication. Technical Report TR-2002-55, University of Texas at Austin, USA, 2002.
105. Goto, K.; van de Geijn, R. A. Anatomy of a High-Performance Matrix Multiplication ACM T. Math. Software 2008, 34, 1-25
106. Goto, K.; van de Geijn, R. High Performance Implementation of the Level-3 BLAS ACM T. Math. Software 2008, 35, 4:1-14
107. Scott, J.; Hu, Y.; Gould, N. In Applied Parallel Computing; Dongarra, J.; Madsen, K.; Wasniewski, J., Eds.; Springer: Berlin/Heidelberg, 2006; Vol. 3732 pp 818 - 827.
108. Moore, E. H. On the reciprocal of the general algebraic matrix B. Am. Math. Soc. 1920, 26, 394-395
109. Penrose, R. A generalized inverse for matrices Math. Proc. Cambridge Philos. Soc. 1955, 51, 406-413
110. Hansen, P. C. Detection of near-singularity in Cholesky and LDLT factorizations J. Comput. Appl. Math. 1987, 19, 293-299
111. Barlow, J. L.; Vemulapati, U. B. Rank Detection Methods for Sparse Matrices SIAM J. Matrix Anal. A. 1992, 13, 1279-1297
112. Golub, G.; Kahan, W. Calculating the Singular Values and Pseudo-Inverse of a Matrix J. Soc. Ind. Appl. Math. B 1965, 2, 205-224
113. Loan, C. F. V. Generalizing the Singular Value Decomposition SIAM J. Numer. Anal. 1976, 13, 76-83
114. Golub, G.; SØlna, K.; Dooren, P. V. Computing the SVD of a General Matrix Product/Quotient SIAM J. Matrix Anal. A 2000, 22, 1-19 (Pubitemid 33229414)
115. Gilbert, J. R.; Ng, E. G. Predicting structure in nonsymmetric sparse matrix factorizations. In Graph Theory and Sparse Matrix Computation; Springer-Verlag, 1992; pp 107-139.
116. Davis, T. Multifrontral multithreaded rank-revealing sparse QR factorization. In Combinatorial Scientific Computing, number 09061; Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2009. Naumann, U.; Schenk, O.; Simon, H. D.; Toledo, S., Eds.; Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Germany.
117. Berry, M. W.; Heath, M. T.; Kaneko, I.; Lawo, M.; Plemmons, R. J.; Ward, R. C. An Algorithm to Compute a Sparse Basis of the Null Space Numer. Math. 1985, 47, 483-504
118. Foster, L. V. Rank and Null Space Calculations Using Matrix Decompositions without Column Interchanges Linear Algebra Appl. 1986, 74, 47-71
119. Choi, S.-C. Iterative Methods for Singular Linear Equations and Least-Squares Problems, Ph.D. Thesis, Stanford University, CA, 2006
120. Le Borne, S. Block computation and representation of a sparse nullspace basis of a rectangular matrix Linear Algebra Appl. 2008, 428, 2455-2467
121. Gotsman, C.; Toledo, S. On the Computation of Null Spaces of Sparse Rectangular Matrices SIAM J. Matrix Anal. A 2008, 30, 445-463
122. Wu, J.; Lee, Y.-J.; Xu, J.; Zikatanov, L. Convergence Analysis on Iterative Methods for Semidefinite Systems J. Comput. Math. 2008, 26, 797-815
123. Arbenz, P.; Drmac, Z. On Positive Semidefinite Matrices with Known Null Space SIAM J. Matrix Anal. Appl. 2002, 24, 132-149 (Pubitemid 36260159)
124. Moler, C. B.; Stewart, G. W. On the Householder-Fox algorithm for decomposing a projection J. Comput. Phys. 1978, 28, 82-91
125. Fox, K.; Krohn, B. J. Computation of cubic harmonics J. Comput. Phys. 1977, 25, 386-408