{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:14Z","timestamp":1725487094419},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418146"},{"type":"electronic","value":"9783540452621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45262-1_16","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T12:29:48Z","timestamp":1183379388000},"page":"125-133","source":"Crossref","is-referenced-by-count":0,"title":["Nested-Dissection Orderings for Sparse LU with Partial Pivoting"],"prefix":"10.1007","author":[{"given":"Igor","family":"Brainman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"16_CR1","unstructured":"Cleve Ashcraft and Roger Grimes. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, Texas, 1999. 10 pages on CD-ROM."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/S0895479894246905","volume":"19","author":"T. A. Davis","year":"1997","unstructured":"T. A. Davis and I. S. Du.. An unsymmetric-pattern multifrontal method for sparse lu factorization. SIAM Journal on Matrix Analysis and Applications, 19:140\u2013158, 1997.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"T. A. Davis and I. S. Du.. A combined unifrontal\/multifrontal method for unsymmetric sparse matrices. ACM Transactions on Mathematical Software, 25:1\u201319, 5.","DOI":"10.1145\/305658.287640"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0895479895291765","volume":"20","author":"J. W. Demmel","year":"1999","unstructured":"James W. Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, and Joseph W. H. Liu. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20:720\u2013755, 1999.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"A. George and J. W. H. Liu. The evolution of the minimum-degree ordering algorithm. SIAM Review, 31:1\u201319, 1989.","journal-title":"SIAM Review"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0909057","volume":"9","author":"A. George","year":"1988","unstructured":"Alan George and Esmond Ng. On the complexity of sparse QR and LU factorization on finite-element matrices. SIAM Journal on Scientific and Statistical Computation, 9:849\u2013861, 1988.","journal-title":"SIAM Journal on Scientific and Statistical Computation"},{"key":"16_CR7","unstructured":"John R. Gilbert. Graph Separator Theorems and Sparse Gaussian Elimination. PhD thesis, Stanford University, 1980."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/S0895479887139455","volume":"15","author":"J. R. Gilbert","year":"1994","unstructured":"John R. Gilbert. Predicting structure in sparse matrix computations. SIAM Journal on Matrix Analysis and Applications, 15:62\u201379, 1994.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"16_CR9","unstructured":"John R. Gilbert and Robert Schreiber. Nested dissection with partial pivoting. In Sparse Matrix Symposium 1982: Program and Abstracts, page 61, Fairfield Glade, Tennessee, October 1982."},{"key":"16_CR10","series-title":"CISE Tech Report","volume-title":"An approximate minimum degree column ordering algorithm","author":"S. I. Larimore","year":"1998","unstructured":"S. I. Larimore. An approximate minimum degree column ordering algorithm. Master\u2019s thesis, Department of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, 1998. Also available as CISE Tech Report TR-98-016 at ftp:\/\/ftp.cise.u..edu\/cis\/tech-reports\/tr98\/tr98-016 .ps."},{"key":"16_CR11","unstructured":"Xiaoye S. Li. Sparse Gaussian Elimination on High Performance Computers. PhD thesis, Department of Computer Science, UC Berkeley, 1996."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A. Pothen","year":"1990","unstructured":"Alex Pothen and Chin-Ju Fan. Computing the block triangular form of a sparse matrix. ACM Transactions on Mathematical Software, 16(4):303\u2013324, December 1990.","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Lecture Notes in Computer Science","Numerical Analysis and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45262-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:32:07Z","timestamp":1556573527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45262-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418146","9783540452621"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45262-1_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}