{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:07:00Z","timestamp":1778267220732,"version":"3.51.4"},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0167-8191(01)00141-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:38:00Z","timestamp":1027586280000},"page":"301-321","source":"Crossref","is-referenced-by-count":164,"title":["PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems"],"prefix":"10.1016","volume":"28","author":[{"given":"P.","family":"H\u00e9non","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ramet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(01)00141-7_BIB1","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","article-title":"An approximate minimum degree ordering algorithm","volume":"17","author":"Amestoy","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1177\/109434209300700105","article-title":"Memory management issues in sparse multifrontal methods on multiprocessors","volume":"7","author":"Amestoy","year":"1993","journal-title":"Int. J. Supercomput. Appl."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB3","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","year":"2000","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB4","doi-asserted-by":"crossref","unstructured":"P.R. Amestoy, I.S. Duff, J.-Y. L'Excellent, X.S. Li, Analysis, tuning and comparison of two general sparse solvers for distributed memory computers, Technical report RT\/APO\/00\/2, ENSEEIHT-IRIT, June 2000. France\u2013Berkeley project report, also Lawrence Berkeley National Laboratory report LBNL-45992","DOI":"10.2172\/776597"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB5","first-page":"159","article-title":"The fan-both family of column-based distributed Cholesky factorization algorithms","volume":"vol. 56","author":"Ashcraft","year":"1993"},{"issue":"3","key":"10.1016\/S0167-8191(01)00141-7_BIB6","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/0911033","article-title":"A fan-in algorithm for distributed sparse numerical factorization","volume":"11","author":"Ashcraft","year":"1990","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB7","series-title":"Fourth Canadian Supercomputing Symposium","first-page":"351","article-title":"A compute-ahead fan-in scheme for parallel sparse matrix factorization","author":"Ashcraft","year":"1990"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB8","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S.C. Eisenstat, J.W.-H. Liu, A. Sherman, A comparison of three column based distributed sparse factorization schemes, in: Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991","DOI":"10.21236\/ADA228143"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB9","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1090\/S0025-5718-1977-0428694-0","article-title":"Some stable methods for calculating inertia and solving symmetric linear systems","volume":"31","author":"Bunch","year":"1977","journal-title":"Math. Comput."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01396049","article-title":"Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u0131\u0302t\u00e9es","volume":"55","author":"Charrier","year":"1989","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB11","unstructured":"J.M. Conroy, S.G. Kratzer, R.F. Lucas, Multifrontal sparse solvers in message passing and data parallel environments \u2013 a comparitive study, in: Proceedings of PARCO, 1993"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB12","unstructured":"I.S. Duff, Sparse numerical linear algebra: direct methods and preconditioning, Technical report TR\/PA\/96\/22, CERFACS, 1996"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear equations","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Trans. Math. Software"},{"issue":"3","key":"10.1016\/S0167-8191(01)00141-7_BIB14","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/0905045","article-title":"The multifrontal solution of unsymmetric sets of linear equations","volume":"5","author":"Duff","year":"1984","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"10.1016\/S0167-8191(01)00141-7_BIB15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01407861","article-title":"Task scheduling for parallel sparse Cholesky factorization","volume":"18","author":"Geist","year":"1989","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB16","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB17","unstructured":"D. Goudin, Mise en \u0153uvre d'une Biblioth\u00e8que d'Outils pour la R\u00e9solution Parall\u00e8le Hautes Performances par M\u00e9thode Directe de Grands Syst\u00e8mes Lin\u00e9aires Creux et application \u00e0 un Code de M\u00e9canique des Structures, Ph.D. thesis, Universit\u00e9 Bordeaux 1, France, 2000"},{"issue":"5","key":"10.1016\/S0167-8191(01)00141-7_BIB18","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/71.598277","article-title":"Highly scalable parallel algorithms for sparse matrix factorization","volume":"8","author":"Gupta","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB19","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","article-title":"Parallel algorithms for sparse linear systems","volume":"33","author":"Heath","year":"1991","journal-title":"SIAM Rev."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB20","series-title":"Proceedings of EuroPAR'99","first-page":"1059","article-title":"A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization","volume":"vol. 1685","author":"H\u00e9non","year":"1999"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB21","series-title":"Proceedings of Irregular'2000","first-page":"519","article-title":"PaStiX: A parallel sparse direct solver based on a static scheduling for mixed 1D\/2D block distributions","volume":"vol. 1800","author":"H\u00e9non","year":"2000"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB22","doi-asserted-by":"crossref","unstructured":"M. Joshi, G. Karypis, V. Kumar, A. Gupta, Gustavson F. PSPASES: scalable parallel direct solver library for sparse symmetric positive definite linear systems, Technical report, University of Minnesota and IBM Thomas J. Watson Research Center, May 1999","DOI":"10.1007\/978-1-4615-5205-5_1"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB23","doi-asserted-by":"crossref","unstructured":"G. Karypis, V. Kumar. MeTiS \u2013 A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices \u2013 Version 4.0, University of Minnesota, September 1998","DOI":"10.1006\/jpdc.1997.1403"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB24","unstructured":"X.S. Li, Sparse gaussian elimination on high performance computers, Ph.D. thesis, University of California at Berkeley, 1996"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB25","unstructured":"X.S. Li, J.W. Demmel, A scalable sparse direct solver using static pivoting, in: Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, TX, March 22\u201324, 1999"},{"issue":"2","key":"10.1016\/S0167-8191(01)00141-7_BIB26","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum-degree algorithm by multiple elimination","volume":"11","author":"Liu","year":"1985","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB27","series-title":"Proceedings of HPCN'97, Vienna","first-page":"370","article-title":"Sparse matrix ordering with scotch","volume":"vol. 1225","author":"Pellegrini","year":"1997"},{"key":"10.1016\/S0167-8191(01)00141-7_BIB28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/(SICI)1096-9128(200002\/03)12:2\/3<69::AID-CPE472>3.0.CO;2-W","article-title":"Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering","volume":"12","author":"Pellegrini","year":"2000","journal-title":"Concurrency: Practice Experience"},{"issue":"5","key":"10.1016\/S0167-8191(01)00141-7_BIB29","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0914074","article-title":"A mapping algorithm for parallel sparse Cholesky factorization","volume":"14","author":"Pothen","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"10.1016\/S0167-8191(01)00141-7_BIB30","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1137\/S106482759426715X","article-title":"Performance of panel and block approaches to sparse Cholesky factorization on the iPSC\/860 and Paragon multicomputers","volume":"17","author":"Rothberg","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB31","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1142\/S0129053393000232","article-title":"An evaluation of left-looking, right-looking, and multifrontal approaches to sparse cholesky factorization on hierarchical-memory machines","volume":"5","author":"Rothberg","year":"1993","journal-title":"Int. J. High Speed Comput."},{"issue":"6","key":"10.1016\/S0167-8191(01)00141-7_BIB32","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/0915085","article-title":"An efficient block-oriented approach to parallel sparse Cholesky factorization","volume":"15","author":"Rothberg","year":"1994","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(01)00141-7_BIB33","series-title":"Proceedings of Supercomputing'94","first-page":"783","article-title":"Improved load distribution in parallel sparse Cholesky factorization","author":"Rothberg","year":"1994"},{"issue":"1","key":"10.1016\/S0167-8191(01)00141-7_BIB34","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1023\/A:1022326604210","article-title":"Efficient sparse LU factorization with left\u2013right looking strategy on shared memory multiprocessors","volume":"40","author":"Schenk","year":"2000","journal-title":"BIT"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:15:54Z","timestamp":1578467754000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101001417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167819101001417"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00141-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}