{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:41Z","timestamp":1750308161276,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T00:00:00Z","timestamp":1157068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p>We present a new out-of-core sparse symmetric-indefinite factorization algorithm. The most significant innovation of the new algorithm is a dynamic partitioning method for the sparse factor. This partitioning method results in very low I\/O traffic and allows the algorithm to run at high computational rates, even though the factor is stored on a slow disk. Our implementation of the new code compares well with both high-performance in-core sparse symmetric-indefinite codes and a high-performance out-of-core sparse Cholesky code.<\/jats:p>","DOI":"10.1145\/1163641.1163645","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:11:32Z","timestamp":1161195092000},"page":"445-471","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["An out-of-core sparse symmetric-indefinite factorization method"],"prefix":"10.1145","volume":"32","author":[{"given":"Omer","family":"Meshar","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Irony","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899358194"},{"key":"e_1_2_1_2_1","unstructured":"Amestoy P. R. Duff I. S. L'Excellent J. and Koster J. 2003. MUltifrontal massively parallel solver (MUMPS version 4.3) user's guide. Available online from http:\/\/www.enseeiht.fr\/lima\/apo\/MUMPS\/doc.html.  Amestoy P. R. Duff I. S. L'Excellent J. and Koster J. 2003. MUltifrontal massively parallel solver (MUMPS version 4.3) user's guide. Available online from http:\/\/www.enseeiht.fr\/lima\/apo\/MUMPS\/doc.html."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0045-7825(99)00242-X","article-title":"Multifrontal parallel distributed symmetric and unsymmetric solvers","volume":"184","author":"Amestoy P. R.","year":"2000","unstructured":"Amestoy , P. R. , Duff , I. S. , and L'Excellent , J.-Y. 2000 . Multifrontal parallel distributed symmetric and unsymmetric solvers . Computer Methods Appl. Mechanics Eng. 184 , 501 -- 520 . Amestoy, P. R., Duff, I. S., and L'Excellent, J.-Y. 2000. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods Appl. Mechanics Eng. 184, 501--520.","journal-title":"Computer Methods Appl. Mechanics Eng."},{"volume-title":"Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10","author":"Ashcraft C.","key":"e_1_2_1_4_1","unstructured":"Ashcraft , C. and Grimes , R . 1999. SPOOLES: An object-oriented sparse matrix library . In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CD-ROM. Ashcraft, C. and Grimes, R. 1999. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CD-ROM."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896296921"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1090\/S0025-5718-1977-0428694-0","article-title":"Some stable methods for calculating inertia and solving symmetric indefinite linear systems","volume":"31","author":"Bunch J. R.","year":"1977","unstructured":"Bunch , J. R. and Kaufman , L. 1977 . Some stable methods for calculating inertia and solving symmetric indefinite linear systems . Math. Comput. 31 , 163 -- 179 . Bunch, J. R. and Kaufman, L. 1977. Some stable methods for calculating inertia and solving symmetric indefinite linear systems. Math. Comput. 31, 163--179.","journal-title":"Math. Comput."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01399088","article-title":"Decomposition of a symmetric matrix","volume":"27","author":"Bunch J. R.","year":"1976","unstructured":"Bunch , J. R. , Kaufman , L. , and Parlett , B. N. 1976 . Decomposition of a symmetric matrix . Numer. Math. 27 , 95 -- 109 . Bunch, J. R., Kaufman, L., and Parlett, B. N. 1976. Decomposition of a symmetric matrix. Numer. Math. 27, 95--109.","journal-title":"Numer. Math."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558958_92"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"e_1_2_1_10_1","unstructured":"Duff I. S. Erisman A. M. and Reid J. K. 1986. Direct Methods for Sparse Matrices. Oxford University Press Oxford UK.   Duff I. S. Erisman A. M. and Reid J. K. 1986. Direct Methods for Sparse Matrices. Oxford University Press Oxford UK."},{"key":"e_1_2_1_11_1","volume-title":"Tech. Rep. AERE R10533, AERE Harwell, Didcot","author":"Duff I. S.","year":"1982","unstructured":"Duff , I. S. and Reid , J. K . 1982 . MA27: A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Tech. Rep. AERE R10533, AERE Harwell, Didcot , Oxon, UK . Duff, I. S. and Reid, J. K. 1982. MA27: A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Tech. Rep. AERE R10533, AERE Harwell, Didcot, Oxon, UK."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/332242.332243"},{"volume-title":"Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10","author":"Gilbert J. R.","key":"e_1_2_1_14_1","unstructured":"Gilbert , J. R. and Toledo , S . 1999. High-Performance out-of-core sparse LU factorization . In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CDROM. Gilbert, J. R. and Toledo, S. 1999. High-Performance out-of-core sparse LU factorization. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CDROM."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024074.1024077"},{"key":"e_1_2_1_16_1","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham N. J.","unstructured":"Higham , N. J. 2002. Accuracy and Stability of Numerical Algorithms , 2 nd ed. Society for Industrial and Applied Mathematics , Philadelphia, PA . Higham, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd ed. Society for Industrial and Applied Mathematics, Philadelphia, PA.","edition":"2"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/nme.1620020104","article-title":"A frontal solution scheme for finite element analysis","volume":"2","author":"Irons B. M.","year":"1970","unstructured":"Irons , B. M. 1970 . A frontal solution scheme for finite element analysis . Int. J. Numeri. Methods Eng. 2 , 5 -- 32 . Irons, B. M. 1970. A frontal solution scheme for finite element analysis. Int. J. Numeri. Methods Eng. 2, 5--32.","journal-title":"Int. J. Numeri. Methods Eng."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1034004"},{"volume-title":"Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC '98)","author":"Natanzon A.","key":"e_1_2_1_21_1","unstructured":"Natanzon , A. , Shamir , R. , and Sharan , R . 1998. A polynomial approximation algorithm for the minimum fill-in problem . In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC '98) . ACM Press, New York, 41--47. 10.1145\/276698.276710 Natanzon, A., Shamir, R., and Sharan, R. 1998. A polynomial approximation algorithm for the minimum fill-in problem. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC '98). ACM Press, New York, 41--47. 10.1145\/276698.276710"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0914063"},{"key":"e_1_2_1_23_1","unstructured":"R\u00f6llin S. and Schenk O. 2006. Maximum-weighted matching strategies and the application to symmetric indefinite systems. In Applied Parallel Computing: State-of-the-Art in Scientific Computing; Proceedings of the 7th International Workshop (PARA 2004) Lyngby Denmark held in June 2004. Lecture Notes in Computer Science vol. 3732. Springer Verl. 808--817. 10.1007\/11558958_97   R\u00f6llin S. and Schenk O. 2006. Maximum-weighted matching strategies and the application to symmetric indefinite systems. In Applied Parallel Computing: State-of-the-Art in Scientific Computing; Proceedings of the 7th International Workshop (PARA 2004) Lyngby Denmark held in June 2004. Lecture Notes in Computer Science vol. 3732. Springer Verl. 808--817. 10.1007\/11558958_97"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/114697.116809"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597322975"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/974781.974783"},{"key":"e_1_2_1_27_1","volume-title":"Tech. Rep. CS-2004-004, Department of Computer Science","author":"Schenk O.","year":"2004","unstructured":"Schenk , O. and G\u00e4rtner , K . 2004 . On fast factorization pivoting methods for sparse symmetric indefinite systems. Tech. Rep. CS-2004-004, Department of Computer Science , University of Basel. Submitted to Electro. Trans. Numer. Anal . Schenk, O. and G\u00e4rtner, K. 2004. On fast factorization pivoting methods for sparse symmetric indefinite systems. Tech. Rep. CS-2004-004, Department of Computer Science, University of Basel. Submitted to Electro. Trans. Numer. Anal."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356006"},{"volume-title":"Eigensystems","author":"Stewart G. W.","key":"e_1_2_1_29_1","unstructured":"Stewart , G. W. 2001. Matrix Algorithms , vol. 2 : Eigensystems . SIAM , Philadelphia, PA . Stewart, G. W. 2001. Matrix Algorithms, vol. 2: Eigensystems. SIAM, Philadelphia, PA."}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1163641.1163645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1163641.1163645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:19:03Z","timestamp":1750263543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1163641.1163645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1145\/1163641.1163645"],"URL":"https:\/\/doi.org\/10.1145\/1163641.1163645","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"type":"print","value":"0098-3500"},{"type":"electronic","value":"1557-7295"}],"subject":[],"published":{"date-parts":[[2006,9]]},"assertion":[{"value":"2006-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}