{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:08:45Z","timestamp":1759176525315},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0167-8191(93)90045-m","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"153-162","source":"Crossref","is-referenced-by-count":5,"title":["Supernodal symbolic Cholesky factorization on a local-memory multiprocessor"],"prefix":"10.1016","volume":"19","author":[{"given":"Esmond","family":"Ng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90045-M_BIB1","article-title":"A compute0ahead implementation of the fan-in sparse distributed factorization scheme","author":"Ashcraft","year":"1990"},{"key":"10.1016\/0167-8191(93)90045-M_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","article-title":"The influence of relaxed supernode partitions on the multifrontal method","volume":"15","author":"Ashcraft","year":"1989","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/109434208700100403","article-title":"Progress in sparse matrix methods for large linear systems on vector supercomputers","volume":"1","author":"Ashcraft","year":"1987","journal-title":"Internat. J. Supercomp. Appl."},{"key":"10.1016\/0167-8191(93)90045-M_BIB4","article-title":"User's guide for SPARSPAK-A: Waterloo sparse linear equations package","author":"Chu","year":"1984"},{"key":"10.1016\/0167-8191(93)90045-M_BIB5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear equations","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB6","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1002\/nme.1620180804","article-title":"The Yale sparse matrix package, I: The symmetric codes","volume":"18","author":"Eisenstat","year":"1982","journal-title":"Internat. J. Numer. Meth. Engrg."},{"key":"10.1016\/0167-8191(93)90045-M_BIB7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","article-title":"Nested dissection of a regular finite element mesh","volume":"10","author":"George","year":"1973","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8191(93)90045-M_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-8191(87)90009-3","article-title":"Symbolic Cholesky factorization on a local-memory multiprocessor","volume":"5","author":"George","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(93)90045-M_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0377-0427(89)90364-6","article-title":"Solution of sparse positive definite systems on a hypercube","volume":"27","author":"George","year":"1989","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0167-8191(93)90045-M_BIB10","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","article-title":"An automatic nested dissection algorithm for irregular finite element problems","volume":"15","author":"George","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8191(93)90045-M_BIB11","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/355826.355829","article-title":"The design of a user interface for a sparse matrix package","volume":"5","author":"George","year":"1979","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB12","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(93)90045-M_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","article-title":"The evolution of the minimum degree ordering algorithm","volume":"31","author":"George","year":"1989","journal-title":"SIAM Rev."},{"key":"10.1016\/0167-8191(93)90045-M_BIB14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-8191(89)90101-4","article-title":"Communication results for parallel sparse Cholesky factorization on a hypercube","volume":"10","author":"George","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(93)90045-M_BIB15","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1137\/0910070","article-title":"A fast algorithm for reordering sparse matrices for parallel factorization","volume":"10","author":"Lewis","year":"1989","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/0167-8191(93)90045-M_BIB16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","article-title":"A compact row storage scheme for Cholesky factors using elimination trees","volume":"12","author":"Liu","year":"1986","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/0167-8191(93)90045-M_BIB18","doi-asserted-by":"crossref","DOI":"10.2172\/6756314","article-title":"On finding supernodes for sparse matrix computations","author":"Liu","year":"1990"},{"key":"10.1016\/0167-8191(93)90045-M_BIB19","doi-asserted-by":"crossref","DOI":"10.2172\/5896533","article-title":"A supernodal Cholesky factorization algorithm for shared-memory multiprocessors","author":"Ng","year":"1991"},{"key":"10.1016\/0167-8191(93)90045-M_BIB20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/114697.116809","article-title":"Efficient sparse matrix factorization on high-performance workstations \u2014 Exploiting the memory hierarchy","volume":"17","author":"Rothberg","year":"1991","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB21","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","article-title":"A new implementation of sparse Gaussian elimination","volume":"8","author":"Schreiber","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(93)90045-M_BIB22","article-title":"On the efficient solution of sparse systems of linear and nonlinear equations","author":"Sherman","year":"1975"},{"key":"10.1016\/0167-8191(93)90045-M_BIB23","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-8191(88)90039-7","article-title":"A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor","volume":"7","author":"Zmijewski","year":"1988","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390045M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390045M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T16:48:06Z","timestamp":1704905286000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390045M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["016781919390045M"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90045-m","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}