The design and implementation of a new out-of-core sparse cholesky factorization method

ACM Transactions on Mathematical Software

Volumn 30, Issue 1, 2004, Pages 19-46

  Rotkin, Vladimir ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Out of core

Indexed keywords

DATA STRUCTURE; OUT-OF-CORE; SPARSE CHOLESKY FACTORIZATION METHOD; SUBTREE-SCHEDULING ALGORITHM;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COST EFFECTIVENESS; ITERATIVE METHODS; MATRIX ALGEBRA; PERFORMANCE; PERSONAL COMPUTERS; SCHEDULING; TREES (MATHEMATICS);

LINEAR SYSTEMS;

EID: 2442521453     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/974781.974783     Document Type: Article

References (31)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Applic. 17, 886-905.
2. AMESTOY, P. R., DUFF, I. S., AND L'EXCELLENT, J.-Y. 2000. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods in Applied Mechanics and Engineering 184.
3. AMESTOY, P. R., DUFF, I. S., KOSTER, J., AND L'EXCELLENT, J. 2001. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Applic. 23, 15-41.
4. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J., AND KOSTER, J. 2003. MUltifrontal Massively Parallel Solver (MUMPS version 4.3), user's guide. Available online from http://www.enseeiht.fr/lima/ apo/MUMPS/doc.html.
5. ASHCRAFT, C. AND GRIMES, R. 1989. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Soft. 15, 4, 291-309.
6. BJØRSTAD, P. E. 1987. A large scale, sparse, secondary storage, direct linear equation solver for structural analysis and its implementation on vector and parallel architectures. Parallel Computing 5, 1, 3-12.
7. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct Methods for Sparse Matrices. Oxford University Press.
8. DUFF, I. AND REID, J. 1983. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Soft. 9, 302-325.
9. GEORGE, J. A., HEATH, M. T., AND PLEMMONS, R. J. 1981, Solution of large-scale sparse least squares problems using auxiliary storage. SIAM J. Sci. Statis. Comput. 2, 4, 416-429.
10. GEORGE, A. AND LIU, J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall.
11. GEORGE, A. AND RASHWAN, H. 1985. Auxiliary storage methods for solving finite element systems. SIAM J. Sci. Statis. Comput. 6, 4, 882-910.
12. GILBERT, J. R. AND TOLEDO, S. 1999. High-performance out-of-core sparse LU factorization. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing. San-Antonio, Texas. 10 pages on CDROM.
13. HOFFMAN, A. J., MARTIN, M.S., AND ROSE, D. J. 1973. Complexity bounds for regular finite difference and finite element grids. SIAM J. Numer. Anal. 10, 364-369.
14. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
15. LIPTON, R. J., ROSE, D. J., AND TARJAN, R. E. 1979. Generalized nested dissection. SIAM J. Numer. Anal. 16, 346-348.
16. LIU, J. W. H. 1986. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Soft. 12, 3, 249-264.
17. LIU, J. W. H. 1987. An adaptive general sparse out-of-core Cholesky factorization scheme. SIAM J. Sci. Statis. Comput. 8, 4, 585-599.
18. LIU, J. W. H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Applic. 11, 134-172.
19. LIU, J. W. H. 1992. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review 34, 1, 82-109.
20. LIU, J. W. H., NG, E. G., AND PEYTON, B. W. 1993. On finding supernodes for sparse matrix computations. SIAM J Matrix Anal. Applic. 14, 242-252.
21. NG, E. G. AND PEYTON, B. W. 1993. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 5, 1034-1056.
22. POOLE, G., LIU, Y.-C., AND MANDEL, J. 2001. Advancing analysis capabilities in ansys through solver technology. In Proceedings of the 10th Copper Mountain Coference on Multigrid Methods. Copper Mountain, Colorado.
23. RABANI, E. AND TOLEDO, S. 2001. Out-of-core SVD and QR decompositions. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing. Norfolk, Virginia. 10 pages on CDROM.
24. ROTHBERG, E. AND GUPTA, A. 1991. Efficient sparse matrix factorization on high-performance workstations - exploiting the memory hierarchy. ACM Trans. Math. Soft. 17, 3, 313-334.
25. ROTHBERG, E. AND SCHREIBER, R. 1996. An alternative approach to sparse out-of-core factorization. presented at the 2nd SIAM Conference on Sparse Matrix, Coeur d'Alene, Idaho.
26. ROTHBERG, E. AND SCHREIBER, R. 1999. Efficient methods for out-of-core sparse cholesky factorization. SIAM J. Sci. Comput. 21, 129-144.
27. SCHREIBER, R. 1982. A new implementation of sparse gaussian elimination. ACM Trans. Math. Soft. 8, 256-276.
28. TOLEDO, S. 1997. Locality of reference in LU decomposition with partial pivoting. SIAM J. Matrix Anal. Applic. 18, 4, 1065-1081.
29. TOLEDO, S. AND GUSTAVSON, F. G. 1996. The design and implementation of SOLAR, a portable library for scalable out-of-core linear algebra computations. In Proceedings of the 4th Annual Workshop on I/O in Parallel and Distributed Systems. Philadelphia, 28-40.
30. TOLEDO, S. AND RABANI, E. 2001. Very large electronic structure calculations using an out-of-core filter-diagonalization method. J. Computational Physics.
31. WHALEY, R. C. AND DONGARRA, J. J. 1998. Automatically tuned linear algebra software. Tech. rep., Computer Science Department, University Of Tennessee. Available online at www.netlib. org/atlas.