{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T14:43:38Z","timestamp":1791297818481,"version":"4.1.0"},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[1993,7]]},"abstract":"<jats:p>This paper presents a parallel sparse Cholesky factorization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm is a straightforward parallelization of the left-looking supernodal sparse Cholesky factorization algorithm. Like its sequential predecessor, it improves performance by reducing indirect addressing and memory traffic. Experimental results on a Cray Y-MP demonstrate the effectiveness of the new algorithm. On eight processors of a Cray Y-MP, the new routine performs the factorization at rates exceeding one Gflop for several test problems from the Harwell\u2013Boeing sparse matrix collection.<\/jats:p>","DOI":"10.1137\/0914048","type":"journal-article","created":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T03:41:55Z","timestamp":1109648515000},"page":"761-769","source":"Crossref","is-referenced-by-count":47,"title":["A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors"],"prefix":"10.1137","volume":"14","author":[{"given":"Esmond","family":"Ng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barry W.","family":"Peyton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1177\/109434208900300303"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. D. Croz, A. Greenbaum, S. Hammarling, A. McKenney, D. Sorensen,  LAPACK: A portable linear algebra library for high-performance computers,  Proceedings of Supercomputing '90, IEEE Press, Washington, DC,  1990,  1\u201310","DOI":"10.1109\/SUPERC.1990.129995"},{"key":"R3","unstructured":"C. Ashcraft,  A vector implementation of the multifrontal method for large sparse, symmetric positive definite linear systems, Tech. Rep., ETA-TR-51, Engineering Technology Applications Division, Boeing Computer Services, Seattle, WA,  1987"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1177\/109434208700100403"},{"key":"R5","unstructured":"E. Chu, A. George, J. W.H. Liu, E. G.Y. Ng,  User's guide for SPARSPAK-A: Waterloo sparse linear equations package, Tech. Rep., CS-84-36, Univ. of Waterloo, Waterloo, Ontario, Canada,  1984"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407878"},{"key":"R11","volume-title":"Computer solution of large sparse positive definite systems","author":"George A.","year":"1981"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0614019"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(86)90014-1"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"R16","unstructured":"A. Pothem,  Simplicial cliques, shortest elimination trees, and supernodes in sparse Cholesky factorization, Tech. Rep., CS-88-13, Dept. of Computer Science, The Pennsylvania State Univ., University Park, PA,  1988"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1145\/114697.116809"},{"key":"R18","unstructured":"A. Sherman, Ph.D. Thesis,  On the efficient solution of sparse systems of linear and nonlinear equations, Yale University, New Haven, CT,  1975"},{"key":"R19","unstructured":"H. Simon, P. Vu, C. Yang,  Sparse matrix at 1.68 Gflops, Tech. Report, Boeing Computer Services, Seattle, WA,  1989"},{"key":"R20","volume-title":"A vector\/parallel implementation of the multifrontal method for sparse symmetric definite linear systems on the Cray Y -MP","author":"Yang C.","year":"1990"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0914048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:29:29Z","timestamp":1787326169000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0914048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["10.1137\/0914048"],"URL":"https:\/\/doi.org\/10.1137\/0914048","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}