{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T05:52:58Z","timestamp":1780725178076,"version":"3.54.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2.03E+19"],"award-info":[{"award-number":["2.03E+19"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2008,10]]},"abstract":"<jats:p>\n                    CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form\n                    <jats:italic toggle=\"yes\">A<\/jats:italic>\n                    or\n                    <jats:italic toggle=\"yes\">AA<\/jats:italic>\n                    <jats:sup>T<\/jats:sup>\n                    , updating\/downdating a sparse Cholesky factorization, solving linear systems, updating\/downdating the solution to the triangular system\n                    <jats:italic toggle=\"yes\">Lx<\/jats:italic>\n                    \u2009=\u2009\n                    <jats:italic toggle=\"yes\">b<\/jats:italic>\n                    , and many other sparse matrix functions for both symmetric and unsymmetric matrices. Its supernodal Cholesky factorization relies on LAPACK and the Level-3 BLAS, and obtains a substantial fraction of the peak performance of the BLAS. Both real and complex matrices are supported. CHOLMOD is written in ANSI\/ISO C, with both C and MATLAB\n                    <jats:sup>TM<\/jats:sup>\n                    interfaces. It appears in MATLAB 7.2 as x\u2009=\u2009A\\b when A is sparse symmetric positive definite, as well as in several other sparse matrix functions.\n                  <\/jats:p>","DOI":"10.1145\/1391989.1391995","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T08:49:43Z","timestamp":1225961383000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":547,"title":["Algorithm 887"],"prefix":"10.1145","volume":"35","author":[{"given":"Yanqing","family":"Chen","sequence":"first","affiliation":[{"name":"University of Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timothy A.","family":"Davis","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William W.","family":"Hager","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivasankaran","family":"Rajamanickam","sequence":"additional","affiliation":[{"name":"University of Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,10]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894278952"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","unstructured":"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\u2019 Guide 3rd ed. SIAM Philadelphia.","DOI":"10.5555\/323215"},{"key":"e_1_2_2_3_1","volume-title":"Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM","author":"Ashcraft C. C.","unstructured":"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."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","unstructured":"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 &amp; Hall London 125--137. (http:\/\/math.nist.gov\/MatrixMarket).","DOI":"10.5555\/265834.265854"},{"key":"e_1_2_2_5_1","unstructured":"Davis T. A. 1994. University of Florida sparse matrix collection. www.cise.ufl.edu\/research\/sparse. NA Digest vol 92 no. 42."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114268.1114277"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1196434"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024074.1024079"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897321076"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899357346"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0022-3"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0017-0"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462173.1462176"},{"key":"e_1_2_2_14_1","volume-title":"Eds. Lecture Notes in Computational Science and Engineering","volume":"10","author":"Dobrian F.","unstructured":"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."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/50063.356256"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","unstructured":"Duff I. S. Erisman A. M. and Reid J. K. 1986. Direct Methods for Sparse Matrices. OUP Oxford UK.","DOI":"10.5555\/18753"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","unstructured":"George A. and Liu J. W. H. 1981. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Englewood Cliffs New Jersey.","DOI":"10.5555\/578296"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021943902025"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892236921"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Gill P. E. Golub G. H. Murray W. and Saunders M. A. 1974. Methods for modifying matrix factorizations. Math. Comp. 28 126 505--535.","DOI":"10.1090\/S0025-5718-1974-0343558-6"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1535\/itj.1002.01"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377603.1377607"},{"key":"e_1_2_2_25_1","volume-title":"Tech. Rep. Internal report 2005-1 (revision 2), CCLRC, Rutherford Appleton Laboratory. (Mar.)","author":"Gould N. I. M.","year":"2006","unstructured":"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.)"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236465"},{"key":"e_1_2_2_27_1","volume-title":"WSMP: A high-performance serial and parallel sparse linear solver. Tech. Rep. RC 22038 (98932)","author":"Gupta A.","year":"2001","unstructured":"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."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.598277"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1031049"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00141-7"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355847"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"e_1_2_2_35_1","unstructured":"Moler C. June 2007. Cleve\u2019s corner: parallel MATLAB: multiple processors and multiple cores. MATLAB News and Notes."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0914063"},{"key":"e_1_2_2_37_1","first-page":"68","article-title":"Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency","volume":"12","author":"Pellegrini F.","year":"2000","unstructured":"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.","journal-title":"Pract. Exp."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896302692"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/114697.116809"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/974781.974783"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1268769.1268772"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/23.2.203"},{"key":"e_1_2_2_43_1","volume-title":"Matrix algorithms, Volume 1: Basic decompositions","author":"Stewart G. W.","unstructured":"Stewart, G. W. 1998. Matrix algorithms, Volume 1: Basic decompositions. SIAM, Philadelphia."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391989.1391995","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1391989.1391995","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1391989.1391995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:17:20Z","timestamp":1763457440000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391989.1391995"}},"subtitle":["CHOLMOD, Supernodal Sparse Cholesky Factorization and Update\/Downdate"],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["10.1145\/1391989.1391995"],"URL":"https:\/\/doi.org\/10.1145\/1391989.1391995","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]},"assertion":[{"value":"2006-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-10-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}