{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:19:03Z","timestamp":1787383143979,"version":"build-2736575974"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>We present a novel analysis of the potential effectiveness of a matrix ordering for the incomplete Cholesky factorization (IC) in terms of just the sparsity structure. By looking at the structure of the approximate inverse implicitly created by IC we can help to explain the success of reverse Cuthill--McKee orderings, the problems IC(0) has under red-black orderings that disappear when extra fill is included, and where fill must be added to make fill-reducing orderings such as minimum degree effective.<\/jats:p>","DOI":"10.1137\/s1064827599353841","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1527-1532","source":"Crossref","is-referenced-by-count":12,"title":["A Structural Diagnosis of Some IC Orderings"],"prefix":"10.1137","volume":"22","author":[{"given":"Robert","family":"Bridson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei-Pai","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597326845"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598335842"},{"key":"R3","unstructured":"S. Clift, H. Simon, and W.\u2010P. Tang,\n                      Spectral Ordering Techniques for Incomplete LU Preconditioners for CG Methods\n                      , manuscript."},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01732977"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02074880"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0168-9274(91)90011-N"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/47917.47918"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932738"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90401-H"},{"key":"R10","volume-title":"Computer solution of large sparse positive definite systems","author":"George Alan","year":"1981"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479887139455"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1064827599353841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:51:40Z","timestamp":1787334700000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1064827599353841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1137\/S1064827599353841"],"URL":"https:\/\/doi.org\/10.1137\/s1064827599353841","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}