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

We describe a new out-of-core sparse Cholesky factorization method. The new method uses the elimination tree to partition the matrix, an advanced subtree-scheduling algorithm, and both right-looking and left-looking updates. The implementation of the new method is efficient and robust. On a 2 GHz personal computer with 768 MB of main memory, the code can easily factor matrices with factors of up to 48 GB, usually at rates above 1 Gflop/s. For example, the code can factor audikw, currenly the largest matrix in any matrix collection (factor size over 10 GB), in a little over an hour, and can factor a matrix whose graph is a 140-by-140-by-140 mesh in about 12 hours (factor size around 27 GB).

[1]  Roger Grimes,et al.  The influence of relaxed supernode partitions on the multifrontal method , 1989, TOMS.

[2]  Sivan Toledo.  Locality of Reference in LU Decomposition with Partial Pivoting , 1997, SIAM J. Matrix Anal. Appl..

[3]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[4]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[5]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[6]  Sivan Toledo,et al.  High-Performance Out-of-Core Sparse LU Factorization , 1999, PPSC.

[7]  Joseph W. H. Liu.  An adaptive general sparse out-of-core cholesky factorization scheme , 1987 .

[8]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[9]  D. Rose,et al.  Generalized nested dissection , 1977 .

[10]  Robert Schreiber,et al.  Efficient Methods for Out-of-Core Sparse Cholesky Factorization , 1999, SIAM J. Sci. Comput..

[11]  Jack J. Dongarra,et al.  Automatically Tuned Linear Algebra Software , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[12]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[13]  Joseph W. H. Liu.  The role of elimination trees in sparse factorization , 1990 .

[14]  Sivan Toledo,et al.  Out-of-Core SVD and QR Decompositions , 2001, PPSC.

[15]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[16]  Anoop Gupta,et al.  Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy , 1991, TOMS.

[17]  Sivan Toledo,et al.  Very Large Electronic Structure Calculations Using an Out-of-Core Filter-Diagonalization Method , 2002 .

[18]  Petter E. Bjørstad,et al.  A large scale, sparse, secondary storage, direct linear equation solver for structural analysis and its implementation on vector and parallel architectures , 1987, Parallel Comput..

[19]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[20]  Patrick R. Amestoy,et al.  Multifrontal parallel distributed symmetric and unsymmetric solvers , 2000 .

[21]  Joseph W. H. Liu,et al.  On the storage requirement in the out-of-core multifrontal method for sparse factorization , 1986, TOMS.

[22]  Yong-Cheng Liu,et al.  ADVANCING ANALYSIS CAPABILITIES IN ANSYS THROUGH SOLVER TECHNOLOGY , 2001 .

[23]  A. George,et al.  Auxiliary Storage Methods for Solving Finite Element Systems , 1985 .

[24]  D. Rose,et al.  Complexity Bounds for Regular Finite Difference and Finite Element Grids , 1973 .

[25]  Michael T. Heath,et al.  Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage , 1981 .

[26]  Robert Schreiber,et al.  A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.

[27]  Joseph W. H. Liu,et al.  On Finding Supernodes for Sparse Matrix Computations , 1993, SIAM J. Matrix Anal. Appl..

[28]  Sivan Toledo,et al.  The design and implementation of SOLAR, a portable library for scalable out-of-core linear algebra computations , 1996, IOPADS '96.

[29]  Barry W. Peyton,et al.  Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .

[30]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[31]  Patrick R. Amestoy,et al.  MUltifrontal Massively Parallel Solver (MUMPS Version 4.3) Users' guide , 2003 .