SelInv - An algorithm for selected inversion of a sparse symmetric matrix

ACM Transactions on Mathematical Software

Volumn 37, Issue 4, 2011, Pages

  Lin, Lin ^a   Yang, Chao ^b   Meza, Juan C ^b   Lu, Jianfeng ^c   Ying, Lexing ^d   Weinan E , ^a  

^a PRINCETON UNIVERSITY   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c NEW YORK UNIVERSITY   (United States)

^d UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Electronic structure calculation; Elimination tree; Selected inversion; Sparse LDLT factorization; Supernodes

Indexed keywords

ELECTRONIC STRUCTURE CALCULATIONS; ELIMINATION TREE; SELECTED INVERSION; SPARSE LDLT FACTORIZATION; SUPERNODES;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DENSITY FUNCTIONAL THEORY; ELECTRONIC PROPERTIES; ELECTRONIC STRUCTURE; FACTORIZATION;

MATRIX ALGEBRA;

EID: 79952505499     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1916461.1916464     Document Type: Article

References (45)

1. ALEMANY, M., JAIN, M., KRONIK, L., AND CHELIKOWSKY, J. 2004. Real-space pseudopotential method for computing the electronic properties of periodic systems. Phys. Rev. B 69, 075101.
2. AMESTOY, P., DUFF, I., L'EXCELLENT, J.-Y., AND KOSTER, J. 2001. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23, 15-41.
3. ASHCRAFT, C. AND GRIMES, R. 1989. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw. 15, 291-309. (Pubitemid 20636831)
4. ASHCRAFT, C. AND GRIMES, R. 1999. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the 9th SIAM Conference on Parallel Processing.
5. ASHCRAFT, C., GRIMES, R. G., AND LEWIS, J. G. 1998. Accurate symmetric indefinite linear equation solvers. SIAM J. Matrix Anal. Appl. 20, 513-561.
6. BEKAS, C.,KOKIOPOULOU, E., AND SAAD, Y. 2005. Polynomial filtered Lanczos iterations with applications in Density Functional Theory. SIAM J. Matrix Anal. Appl. 30, 1, 397-418.
7. BROWNE, S., DONGARRA, J., GARNER, N.,HO, G., AND MUCCI, P. 2000. A portable programming interface for performance evaluation on modern processors. Int. J. High Perform. C. 14, 189.
8. BUNCH, J. R. AND KAUFMAN, L. 1977. Some stable methods for calculating inertia and solving symmetric linear systems. Math. Comp. 163-179.
9. BUNCH, J. R. AND PARLETT, B. N. 1971. Direct methods for solving symmetric indefinite systems of linear equations. SIAM J. Numer. Anal. 8, 639-655.
10. BURDEN, R. L., FAIRES, J. D., AND REYNOLDS, A. C. 2000. Numerical Analysis. Brooks Cole, Independence, KY.
11. CHELIKOWSKY, J., TROULLIER, N., AND SAAD, Y. 1994. Finite-difference- pseudopotential method: Electronic structure calculations without a basis. Phys. Rev. Lett. 72, 1240-1243. (Pubitemid 24975768)
12. DATTA, S. 1997. Electronic Transport in Mesoscopic Systems. Cambridge University Press, Cambridge, U.K.
13. DAVIS, T. 1997. University of Florida sparse matrix collection. NA Digest 97, 7.
14. DUFF, I. AND REID, J. 1987. Direct Methods for Sparse Matrices. Oxford University, London, UK.
15. DUFF, I., GRIMES, R., AND LEWIS, J. 1992. Users guide for the Harwell-Boeing sparse matrix collection. Research and Technology Division, Boeing Computer Services, Seattle, WA.
16. DUFF, I. S. AND REID, J. K. 1983. The multifrontal solution of indefinite sparse symmetric sets of linear equations. ACM Trans. Math. Softw. 9, 302-325. (Pubitemid 14454003)
17. ECONOMOU, E. 2006. Green's Functions in Quantum Physics. Springer Berlin, Germany.
18. ERISMAN, A. AND TINNEY, W. 1975. On computing certain elements of the inverse of a sparse matrix. Comm. ACM 18, 177.
19. GEORGE, A. 1973. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10, 345-363.
20. GEORGE, A. AND LIU, J. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ.
21. GILBERT, J. 1984. Predicting structure in sparse matrix computations. SIAM J. Matrix Anal. Appl. 15, 4, 62-79.
22. GILBERT, J. AND PEIERLS, T. 1986. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 5, 862-874.
23. GREENGARD, L. AND ROKHLIN, V. 1987. A fast algorithm for particle simulations. J. Comput. Phys. 73, 2, 325-348.
24. GUPTA, A. 1997. WSMP: The Watson Sparse Matrix Package. IBM Research rep. RC 21886(98462).
25. GUPTA, A., KARYPIS, G., AND KUMAR, V. 1997. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Parall. Distrib. Syst. 8, 502-520. (Pubitemid 127772276)
26. HOHENBERG, P. AND KOHN, W. 1964. Inhomogeneous electron gas. Phys. Rev. 136, B864.
27. KOHN, W. AND SHAM, L. 1965. Self-consistent equations including exchange and correlation effects. Phys. Rev. 140, A1133.
28. LEHOUCQ, R., SORENSEN, D., AND YANG, C. 1998. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. SIAM, Philadelphia, PA.
29. LI, S., AHMED, S., KLIMECK, G., AND DARVE, E. 2008. Computing entries of the inverse of a sparse matrix using the FIND algorithm. J. Comput. Phys. 227, 9408-9427.
30. LIN, L., LU, J., CAR, R., AND E, W. 2009a. Multipole representation of the Fermi operator with application to the electronic structure analysis of metallic systems. Phys. Rev. B 79, 115133.
31. LIN, L., LU, J., YING, L., CAR, R., AND E, W. 2009b. Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems. Comm. Math. Sci. 7, 755-777.
32. LIN, L., LU, J., YING, L., AND E, W. 2009c. Pole-based approximation of the Fermi-Dirac function. Chinese Ann. Math. 30B, 729-742.
33. LIN, L., YANG, C., LU, J., YING, L., AND E, W. 2009d. A fast parallel algorithm for selected inversion of structured sparse matrices with application to 2D electronic structure calculations. Tech. rep. LBNL- 2677E. Lawrence Berkeley National Laboratory, Berkeley.
34. LIU, J. 1985. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 141-153. (Pubitemid 15528306)
35. LIU, J. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 134.
36. MARTIN, R. 2004. Electronic Structure-Basic Theory and Practical Methods. Cambridge University Press, Cambridge. UK.
37. MOLER, C. 2004. Numerical Computing with MATLAB. SIAM, Philadelphia, PA.
38. NG, E. AND PEYTON, B. 1993. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034.
39. PAYNE, M. C., TETER, M. P., ALLEN, D. C., ARIAS, T. A., AND JOANNOPOULOS, J. D. 1992. Iterative minimization techniques for ab initio total energy calculation: Molecular dynamics and conjugate gradients. Rev. Mod. Phys. 64, 4, 1045-1097.
40. PETERSEN, D., LI, S., STOKBRO, K., SØRENSEN, H., HANSEN, P., SKELBOE, S., AND DARVE, E. 2009. A hybrid method for the parallel computation of Green's functions. J. Comput. Phys. 228, 5020-5039.
41. RAGHAVAN, P. 2002. DSCPACK: Domain-separator codes for solving sparse linear systems. Tech. rep. CSE- 02-004. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA.
42. ROTHBERG, E. AND GUPTA, A. 1994. An efficient block-oriented approach to parallel sparse choleskyfactorization. SIAM J. Sci. Comput. 15, 1413-1439.
43. SCHENK, O. AND GARTNER, K. 2006. On fast factorization pivoting methods for symmetric indefinite systems. Elec. Trans. Numer. Anal. 23, 158-179. (Pubitemid 46092256)
44. TAKAHASHI, K., FAGAN, J., AND CHIN, M. 1973. Formation of a sparse bus impedance matrix and its application to short circuit study. In Proceedings of the 8th PICA Conference. Minneapolis, MN.
45. ZHOU, Y., SAAD, Y., TIAGO, M. L., AND CHELIKOWSKY, J. R. 2006. Self-consistent-field calculations using chebyshev-filtered subspace iteration. J. Comput. Phys. 219, 172-184. (Pubitemid 44615400)