{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:33:53Z","timestamp":1787337233565,"version":"build-2736575974"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>\n                    Row-merge trees for forming the QR factorization of a sparse matrix A are closely related to elimination trees for the Cholesky factorization of A\n                    <jats:sup>T<\/jats:sup>\n                    A. Row-merge trees predict the exact fill-in (assuming no numerical cancellation) provided A satisfies the strong Hall property, but overestimate the fill-in in general. However, here a fast and simple postprocessing step for row-merge trees is presented that predicts the exact fill-in for sparse QR factorization using Householder reflectors for general matrices.\n                  <\/jats:p>","DOI":"10.1137\/s1064827599333965","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1962-1973","source":"Crossref","is-referenced-by-count":4,"title":["Exact Prediction of QR Fill-In by Row-Merge Trees"],"prefix":"10.1137","volume":"22","author":[{"given":"Suely","family":"Oliveira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5932"},{"key":"R2","volume-title":"Introduction to algorithms","author":"Manber Udi","year":"1989"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897321076"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899357346"},{"key":"R4","unstructured":"to appear. Tech. report TR\u201099\u2010006,"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895291765"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/44128.44131"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0908072"},{"key":"R8","unstructured":"John Gilbert, Esmond Ng, Predicting structure in nonsymmetric sparse matrix factorizations, IMA Vol. Math. Appl., Vol. 56, Springer, New York, 1993, 107\u201313995k:65050"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90121-4"},{"key":"R10","unstructured":"G. Golub and C. V. Loan,\n                      Matrix Computations\n                      , 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0614046"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0907081"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/1034004"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892230973"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00895-3"},{"key":"R17","unstructured":"S. Oliveira,\n                      Reprocessing a Postprocessed Elimination Tree to Obtain Exact Sparsity Prediction in QR Factorization\n                      , Tech. report TR\u2010127, The University of Iowa, Iowa City, IA, 1999."},{"key":"R18","unstructured":"Paul Plassman, Sparse Jacobian estimation and factorization on a multiprocessor, SIAM, Philadelphia, PA, 1990, 152\u201317991m:65346"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90121-4"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1145\/98267.98287"},{"key":"R21","volume-title":"Meschach: matrix computations in C","author":"Stewart David","year":"1994"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1064827599333965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:51:27Z","timestamp":1787334687000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1064827599333965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1137\/S1064827599333965"],"URL":"https:\/\/doi.org\/10.1137\/s1064827599333965","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}