Algorithm 887: CHOLMOD, supernodal sparse cholesky factorization and update/downdate

ACM Transactions on Mathematical Software

Volumn 35, Issue 3, 2008, Pages

  Chen, Yanqing ^a   Davis, Timothy A ^a,b   Hager, William W ^a   Rajamanickam, Sivasankaran ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b University of Florida   (United States)

Author keywords

Cholesky factorization; Linear equations; Sparse matrices

Indexed keywords

CHOLESKY FACTORIZATION; CHOLESKY FACTORIZATIONS; LEVEL-3 BLAS; PEAK PERFORMANCES; POSITIVE DEFINITE; SPARSE CHOLESKY; SPARSE MATRICES; SPARSE MATRIXES; TRIANGULAR SYSTEMS;

FACTORIZATION; FUNCTION EVALUATION; LINEAR SYSTEMS; MATLAB; ONLINE SEARCHING; PROBABILITY DENSITY FUNCTION; TURBULENT FLOW;

LINEAR EQUATIONS;

EID: 56349128770     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1391989.1391995     Document Type: Article

References (43)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905.
2. ANDERSON, E., BAI, Z., BISCHOF, C. H., BLACKFORD, S., DEMMEL, J. W., DONGARRA, J. J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. C. 1999. LAPACK Users' Guide, 3rd ed. SIAM, Philadelphia.
3. ASHCRAFT, C. C. AND GRIMES, R. G. 1999. SPOOLES: an object-oriented sparse matrix library. In Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM, Philadelphia.
4. BOISVERT, R. F., POZO, R., REMINGTON, K., BARRETT, R., AND DONGARRA, J. J. 1997. The Matrix Market: A Web resource for test matrix collections. In Quality of Numerical Software, Assessment and Enhancement, R. F. Boisvert, Ed. Chapman & Hall, London, 125-137. (http://math.nist.gov/MatrixMarket).
5. DAVIS, T. A. 1994. University of Florida sparse matrix collection. www.cise.ufl.edu/research/sparse. NA Digest, vol 92, no. 42.
6. DAVIS, T. A. 2005. Algorithm 849: A concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31, 4, 587-591.
7. DAVIS, T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM, Philadelphia, PA.
8. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 353-376.
9. DAVIS, T. A. AND HAGER, W. W. 1999. Modifying a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20, 3, 606-627.
10. DAVIS, T. A. AND HAGER, W. W. 2001. Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 22, 997-1013.
11. DAVIS, T. A. AND HAGER, W. W. 2007a. Dual multilevel optimization. Math. Program. 112, 2 (Nov.), 403-425.
12. DAVIS, T. A. AND HAGER, W. W. 2007b. A sparse proximal implementation of the LP Dual Active Set Algorithm. Math. Program. 112, 2 (Nov.), 275-301.
13. DAVIS, T. A. AND HAGER, W. W. 2009. Dynamic supernodes in sparse Cholesky update/downdate and triangular solves. ACM Trans. Math. Softw., to appear.
14. DOBRIAN, F., KUMFERT, G. K., AND POTHEN, A. 2000. The design of sparse direct solvers using object oriented techniques. In Advances in Software Tools for Scientific Computing, H. P. Langtangen, A. M. Bruaset, and E. Quak, Eds. Lecture Notes in Computational Science and Engineering, vol. 10. Springer-Verlag, Berlin, 89-131.
15. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level-3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17.
16. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. J. 1988. An extended set of Fortran basic linear algebra subprograms. ACM Trans. Math. Softw. 14, 18-32.
17. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct Methods for Sparse Matrices. OUP, Oxford, UK.
18. GEORGE, A. AND LIU, J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, New Jersey.
19. GILBERT, J. R., LI, X. S., NG, E. G., AND PEYTON, B. W. 2001. Computing row and column counts for sparse QR and LU factorization. BIT 41, 4, 693-710.
20. GILBERT, J. R., MOLER, C., AND SCHREIBER, R. 1992. Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13, 1, 333-356.
21. GILBERT, J. R., NG, E. G., AND PEYTON, B. W. 1994. An efficient algorithm to compute row and column counts for sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 15, 4, 1075-1091.
22. GILL, P. E., GOLUB, G. H., MURRAY, W., AND SAUNDERS, M. A. 1974. Methods for modifying matrix factorizations. Math. Comp. 28, 126, 505-535.
23. GOCHMAN, S., MENDELSON, A., NAVEH, A., AND ROTEM, E. 2006. Introduction to the Intel core duo processor architecture. Intel Techn. J. 10, 2, 89-98.
24. GOTO, K. AND VAN DE GEIJN, R. 2008. High performance implementation of the level-3 BLAS. ACM Trans. Math. Softw. 35, 1.
25. GOULD, N. I. M., HU, Y., AND SCOTT, J. A. 2006. Complete results from a numerical evaluation of sparse direct solvers for the solution of large sparse, symmetric linear systems of equations. Tech. Rep. Internal report 2005-1 (revision 2), CCLRC, Rutherford Appleton Laboratory. (Mar.)
26. GOULD, N. I. M., HU, Y., AND SCOTT, J. A. 2007. A numerical evaluation of sparse direct solvers for the solution of large sparse, symmetric linear systems of equations. ACMTrans. Math. Softw. 33, 2 (June), 32 pages.
27. GUPTA, A., JOSHI, M., AND KUMAR, V. 2001. WSMP: A high-performance serial and parallel sparse linear solver. Tech. Rep. RC 22038 (98932), IBM T.J. Watson Research Center.
28. GUPTA, A., KARYPIS, G., AND KUMAR, V. 1997. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. Para. Distrib. Syst. 8, 5, 502-520.
29. HAGER, W. W. 1989. Updating the inverse of a matrix. SIAM Rev. 31, 2, 221-239.
30. HÉNON, P., RAMET, P., AND ROMAN, J. 2002. PaStiX: A high-performance parallel direct solver for sparse symmetric definite systems. Para. Comput. 28, 2, 301-321.
31. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
32. LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 5, 308-323.
33. LIU, J. W. H. 1985. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 2, 141-153.
34. LIU, J. W. H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 1, 134-172.
35. MOLER, C. June 2007. Cleve's corner: parallel MATLAB: multiple processors and multiple cores. MATLAB News and Notes.
36. NG, E. G. AND PEYTON, B. W. 1993. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 5, 1034-1056.
37. PELLEGRINI, F., ROMAN, J., AND AMESTOY, P. R. 2000. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Pract. Exp. 12, 68-84.
38. ROTHBERG, E. AND EISENSTAT, S. C. 1998. Node selection strategies for bottom-up sparse matrix orderings. SIAM J. Matrix Anal. Appl. 19, 3, 682-695.
39. ROTHBERG, E. AND GUPTA, A. 1991. Efficient sparse matrix factorization on high-performance workstations-exploiting the memory hierarchy. ACM Trans. Math. Softw. 17, 3, 313-334.
40. 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.
41. SCOTT, J. A. AND HU, Y. 2007. Experiences of sparse direct symmetric solvers. ACM Trans. Math. Softw. 33, 3.
42. STEWART, G. W. 1979. The effects of rounding error on an algorithm for downdating a Cholesky factorization. J. Inst. Math. Appl. 23, 203-213.
43. STEWART, G. W. 1998. Matrix algorithms, Volume 1: Basic decompositions. SIAM, Philadelphia.