{"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":1759176525936},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":[[1989,5]]},"DOI":"10.1016\/0167-8191(89)90101-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"287-298","source":"Crossref","is-referenced-by-count":58,"title":["Communication results for parallel sparse Cholesky factorization on a hypercube"],"prefix":"10.1016","volume":"10","author":[{"given":"Alan","family":"George","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph W.H","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esmond","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90101-4_BIB1","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(89)90101-4_BIB2","series-title":"Sparse Matrix Computations","first-page":"85","article-title":"Applications of an element model for Gaussian elimination","author":"Eisenstat","year":"1976"},{"key":"10.1016\/0167-8191(89)90101-4_BIB3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","article-title":"Sparse Cholesky factorization on a local-memory multiprocessor","volume":"9","author":"George","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(89)90101-4_BIB4","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(89)90101-4_BIB5","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(89)90101-4_BIB6","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(89)90101-4_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","article-title":"Computational models and task scheduling for parallel sparse Cholesky factorization","volume":"3","author":"Liu","year":"1986","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90101-4_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum degree algorithm by multiple elimination","volume":"11","author":"Liu","year":"1985","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(89)90101-4_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(89)90064-1","article-title":"Reordering sparse matrices for parallel elimination","volume":"11","author":"Liu","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90101-4_BIB10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0402011","article-title":"A linear reordering algorithm for parallel pivoting of chordal graphs","volume":"2","author":"Liu","year":"1989","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/0167-8191(89)90101-4_BIB11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0024-3795(86)90174-6","article-title":"Communication complexity of the Gaussian elimination algorithm on multiprocessors","volume":"77","author":"Saad","year":"1986","journal-title":"Linear Alg. Appl."},{"key":"10.1016\/0167-8191(89)90101-4_BIB12","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"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189901014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189901014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:24:54Z","timestamp":1551086694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189901014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0167819189901014"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90101-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}