An out-of-core sparse Cholesky solver

ACM Transactions on Mathematical Software

Volumn 36, Issue 2, 2009, Pages

  Reid, John K ^a   Scott, Jennifer A ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Cholesky; Multifrontal; Out of core solver; Sparse symmetric linear systems

Indexed keywords

CHOLESKY; CHOLESKY FACTORIZATIONS; DENSE LINEAR ALGEBRA; DESIGN AND DEVELOPMENT; DIRECT METHOD; DIRECT SOLVERS; FORTRAN; FRONTAL MATRIX; INPUT/OUTPUT OPERATIONS; LARGE SPARSE LINEAR SYSTEMS; MATRIX; MATRIX OPERATIONS; MEMORY SYSTEMS; MULTIFRONTAL; NUMERICAL RESULTS; OUT-OF-CORE; OUT-OF-CORE SOLVER; PROBLEM SIZE; REAL-WORLD PROBLEM; SPARSE SYMMETRIC LINEAR SYSTEMS; SYSTEM MATRICES;

LINEAR SYSTEMS;

MATRIX ALGEBRA;

EID: 65849282796     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1499096.1499098     Document Type: Article

References (32)

1. AMESTOY, P., DAVIS, T., AND DUFF, I. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886-905. (Pubitemid 126327776)
2. AMESTOY, P., DAVIS, T., AND DUFF, I. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 381-388.
3. ANDERSEN, B., GUNNELS, J., GUSTAVSON, F., REID, J., AND WASNIEWSKI, J. 2005. A fully portable high performance minimal storage hybrid format cholesky algorithm. ACM Trans. Math. Softw. 31, 2, 201-227. (Pubitemid 43078384)
4. BCSLIB-EXT. 2003. BCSLIB-EXT - award winning sparse-matrix package. http://www. boeing.com/phantom/bcslib-ext/.
5. CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 2000. Trust-Region Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA.
6. DAVIS, T. 2007. The University of Florida Sparse Matrix Collection. Tech. rep. University of Florida, Gainesville, FL. http://www.cise.ufl.edu/davis/ techreports/matrices.pdf.
7. DOBRIAN, F. AND POTHEN, A. 2003. A comparison between three external memory algorithms for factorising sparse matrices. In Proceedings of the SIAM Conference on Applied Linear Algebra.
8. DONGARRA, J., DU CROZ, J., DUFF, I. S., ANDHAMMARLING, S. 1990. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17. (Pubitemid 20684794)
9. DUFF, I. 1984. Design features of a frontal code for solving sparse unsymmetric linear systems out-of-core. SIAM J. Sci. Statist. Comput. 5, 270-280.
10. DUFF, I. 2004. MA57 - a new code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30, 118-144.
11. DUFF, I. AND REID, J. 1982. MA27 - A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Report AERE R10533. Her Majesty's Stationery Office, London, U.K.
12. DUFF, I. AND REID, J. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325. (Pubitemid 14454003)
13. DUFF, I. AND REID, J. 1996. Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 22, 2, 227-257. (Pubitemid 126418654)
14. DUFF, I. AND SCOTT, J. 1996. The design of a new frontal code for solving sparse unsymmetric systems. ACM Trans. Math. Softw. 22, 1, 30-45. (Pubitemid 126417375)
15. GOULD, N. AND SCOTT, J. 2004. A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Trans. Math. Softw. 30, 3, 300-325.
16. GOULD, N., SCOTT, J., AND HU, Y. 2007. A numerical evaluation of sparse direct solvers for the solution of large, sparse, symmetric linear systems of equations. ACM Trans. Math. Softw. 33, 2, Article 10. (Pubitemid 47168349)
17. GUERMOUCHE, A. AND L'EXCELLENT, J.-Y. 2004. Optimal memory minimization algorithms for the multifrontal method. Tech. rep. RR5179. INRIA, Rocquencourt, France.
18. GUERMOUCHE, A. AND L'EXCELLENT, J.-Y. 2006. Constructing memory-minimizing schedules for multifrontal methods. ACM Trans. Math. Softw. 32, 1, 17-32. (Pubitemid 43924955)
19. HSL. 2007. A collection of Fortran codes for large-scale scientific computation. http://www.cse.scitech.ac.uk/nag/hsl/.
20. IRONS, B. 1970. A frontal solution program for finite-element analysis. Int. J. Numer. Meth. Eng. 2, 5-32.
21. ISO/IEC. 2001. TR 15581(E): Information technology - programming languages - Fortran - enhanced data type facilities (second edition), M. Cohen, Tech. rep., ISO/IEC, Geneva, Switzerland.
22. KARYPIS, G. AND KUMAR, V. 1998. METIS - family of multilevel partitioning algorithms. http://glaros.dtc.umn.edu/gkhome/views/metis.
23. KARYPIS, G. AND KUMAR, V. 1999. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392. (Pubitemid 128689516)
24. LIU, J. 1985. Modification of the Minimum-Degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 2, 141-153.
25. LIU, J. 1986. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. 12, 3, 249-264. (Pubitemid 17550244)
26. MUMPS. 2007. MUMPS: A multifrontal massively parallel sparse direct solver. http://mumps.enseeiht.fr/.
27. REID, J. 1984. TREESOLV, a Fortran package for solving large sets of linear finite-element equations. Report CSS 155. AERE Harwell, Harwell, U.K.
28. REID, J. K. AND SCOTT, J. 2009a. Algorithm 891: A Fortran virtual memory system. ACM Trans. Math. Softw. 36, 1.
29. REID, J. AND SCOTT, J. 2009b. An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems. Int. J. Numer. Meth. Eng. 77, 7, 901-921.
30. ROTHBERG, E. AND SCHREIBER, R. 1999. Efficient methods for out-of-core sparse Cholesky factorization. SIAM J. Sci. Comput. 21, 129-144.
31. ROTKIN, V. AND TOLEDO, S. 2004. The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Trans. Math. Softw. 30, 1, 19-46.
32. TINNEY, W. ANDWALKER, J. 1967. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55, 1801-1809.