{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:25:43Z","timestamp":1791149143969,"version":"4.1.0"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:p>A simple characterization of fundamental supernodes is given in terms of the row subtrees of sparse Cholesky factors in the elimination tree. Using this characterization, an efficient algorithm is presented that determines the set of such supernodes in time proportional to the number of nonzeros and equations in the original matrix. Experimental results verify the practical efficiency of this algorithm.<\/jats:p>","DOI":"10.1137\/0614019","type":"journal-article","created":{"date-parts":[[2005,2,27]],"date-time":"2005-02-27T07:14:21Z","timestamp":1109488461000},"page":"242-252","source":"Crossref","is-referenced-by-count":69,"title":["On Finding Supernodes for Sparse Matrix Computations"],"prefix":"10.1137","volume":"14","author":[{"given":"Joseph W. H.","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Esmond G.","family":"Ng","sequence":"additional","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,17]]},"reference":[{"key":"R1","volume-title":"Data structures and algorithms","author":"Aho Alfred V.","year":"1983"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S. Eisenstat, J. Liu, B. Peyton, A. Sherman,  A compute-ahead implementation of the fan-in sparse distributed factorization scheme, Tech. Rep., CS-90-03, Dept. of Computer Science, York Univ., Ontario, Canada,  1990","DOI":"10.21236\/ADA228143"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/76909.76910"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1177\/109434208700100403"},{"key":"R5","volume-title":"Direct Methods for Sparse Matrices","author":"Duff I. S.","year":"1987"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"R8","volume-title":"Computer solution of large sparse positive definite systems","author":"George J. A.","year":"1981"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/1031001"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0910070"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"J. Liu, E. Ng, B. Peyton,  On finding supernodes for sparse matrix computations, Tech. Rep., ORNL\/TM-11563, Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN,  1990","DOI":"10.2172\/6756314"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/6497.6499"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"E. Ng, B. Peyton,  A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, Tech. Rep., ORNL\/TM-11814, Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN,  1991","DOI":"10.2172\/5896533"},{"key":"R15","unstructured":"A. Pothen,  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":"R16","doi-asserted-by":"publisher","DOI":"10.1145\/114697.116809"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356006"},{"key":"R18","unstructured":"A. H. Sherman, Ph.D. Thesis,  On the efficient solution of sparse systems of linear and nonlinear equations, Dept. of Computer Science, Yale Univ., New Haven, CT,  1975"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0614019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:42Z","timestamp":1787316882000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0614019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1137\/0614019"],"URL":"https:\/\/doi.org\/10.1137\/0614019","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}