{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:08:48Z","timestamp":1759133328989,"version":"3.41.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1023\/a:1019122726788","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"17-38","source":"Crossref","is-referenced-by-count":7,"title":["Two-dimensional block partitionings for the parallel sparse Cholesky factorization"],"prefix":"10.1007","volume":"16","author":[{"given":"B.","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"M.","family":"Doreille","sequence":"additional","affiliation":[]},{"given":"J.-L.","family":"Roch","sequence":"additional","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"329213_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P.R. Amestoy","year":"1996","unstructured":"P.R. Amestoy, T.A. Davis and I.S. Duff, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl. 17(4) (1996) 886\u2013905.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"329213_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/0911033","volume":"11","author":"C. Ashcraft","year":"1990","unstructured":"C. Ashcraft, S.C. Eisenstat and J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Statist. Comput. 11(3) (1990) 593\u2013599.","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"4","key":"329213_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/76909.76910","volume":"15","author":"C. Ashcraft","year":"1989","unstructured":"C. Ashcraft and R. Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Trans. Math. Software 15(4) (1989) 291\u2013309.","journal-title":"ACM Trans. Math. Software"},{"key":"329213_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1177\/109434208700100403","volume":"1","author":"C. Ashcraft","year":"1987","unstructured":"C. Ashcraft, R. Grimes, J. Lewis, B. Peyton and H. Simon, Progress in sparse matrix methods for large linear systems on vector supercomputers, Internat. J. Supercomput. Appl. 1 (1987) 10\u201329.","journal-title":"Internat. J. Supercomput. Appl."},{"key":"329213_CR5","first-page":"75","volume-title":"Stratagem '96","author":"G. Cavalheiro","year":"1996","unstructured":"G. Cavalheiro and M. Doreille, ATHAPASCAN: A C++ library for parallel programming, in: Stratagem '96, INRIA, Sophia Antipolis, France (July 1996) p. 75."},{"key":"329213_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J.J. Dongarra","year":"1990","unstructured":"J.J. Dongarra, J. Du Croz, S. Hammarling and I. Duff, A set of level-3 basic linear algebra subprograms, ACM Trans. Math. Software 16 (1990) 1\u201317, 18-28.","journal-title":"ACM Trans. Math. Software"},{"key":"329213_CR7","unstructured":"I.S. Duff, Sparse numerical linear algebra: direct methods and preconditioning, Technical Report TR\/PA\/96\/22, CERFACS (1996)."},{"key":"329213_CR8","unstructured":"L. Facq and J. Roman, Distribution par bloc pour une factorisation parall\u00e8le de Cholesky, in: Parall\u00e8lisme et Applications Irr\u00e9guli\u00e8res, eds. G. Authi\u00e9 et al. (Herm\u00e8s, 1995) pp. 135\u2013147."},{"key":"329213_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01407861","volume":"18","author":"G.A. Geist","year":"1989","unstructured":"G.A. Geist and E. Ng, Task scheduling for parallel sparse Cholesky factorization, Internat. J. Parallel Programming 18 (1989) 291\u2013314.","journal-title":"Internat. J. Parallel Programming"},{"issue":"2","key":"329213_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/0909021","volume":"9","author":"A. George","year":"1988","unstructured":"A. George, M.T. Heath, J. Liu and E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Statist. Comput. 9(2) (1988) 327\u2013340.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329213_CR11","series-title":"Technical Report","volume-title":"Department of Computer Science","author":"A. Gupta","year":"1994","unstructured":"A. Gupta, G. Karypis and V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization, Technical Report 94-63, Department of Computer Science, University of Minnesota, Minneapolis (1994)."},{"issue":"3","key":"329213_CR12","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"M.T. Heath","year":"1991","unstructured":"M.T. Heath, E. Ng and B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Rev. 33(3) (1991) 420\u2013460.","journal-title":"SIAM Rev."},{"issue":"5","key":"329213_CR13","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0912063","volume":"12","author":"L. Hulbert","year":"1991","unstructured":"L. Hulbert and E. Zmijewski, Limiting communication in parallel sparse Cholesky factorization, SIAM J. Sci. Statist. Comput. 12(5) (1991) 1184\u20131197.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329213_CR14","series-title":"Technical Report","volume-title":"Department of Computer Science","author":"G. Karypis","year":"1995","unstructured":"G. Karypis and V. Kumar, METIS - Unstructured graph partitioning and sparse matrix ordering system, version 2.0, Technical Report, Department of Computer Science, University of Minnesota, Minneapolis (1995).","edition":"version 2.0"},{"issue":"1","key":"329213_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl. 11(1) (1990) 134\u2013172.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"329213_CR16","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0914048","volume":"14","author":"E. Ng","year":"1993","unstructured":"E. Ng and B.W. Peyton, A supernodal Cholesky factorization algorithm for shared-memory multiprocessors, SIAM J. Sci. Comput. 14(4) (1993) 761\u2013769.","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"329213_CR17","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0914074","volume":"14","author":"A. Pothen","year":"1993","unstructured":"A. Pothen and C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 14(5) (1993) 1253\u20131257.","journal-title":"SIAM J. Sci. Comput."},{"key":"329213_CR18","unstructured":"E. Rothberg, Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization, Ph.D. thesis, Stanford University (January 1993)."},{"issue":"3","key":"329213_CR19","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/S106482759426715X","volume":"17","author":"E. Rothberg","year":"1996","unstructured":"E. Rothberg, Performance of panel and block approaches to sparse Cholesky factorization on the IPSC\/860 and Paragon multicomputers, SIAM J. Sci. Comput. 17(3) (1996) 699\u2013713.","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"329213_CR20","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1137\/0915085","volume":"15","author":"E. Rothberg","year":"1994","unstructured":"E. Rothberg and A. Gupta, An efficient block-oriented approach to parallel sparse Cholesky factorization, SIAM J. Sci. Comput. 15(6) (1994) 1413\u20131439.","journal-title":"SIAM J. Sci. Comput."},{"key":"329213_CR21","doi-asserted-by":"crossref","unstructured":"E. Rothberg and R. Schreiber, Improved load distribution in parallel sparse Cholesky factorization, in: '94 (1994) pp. 783\u2013792.","DOI":"10.1109\/SUPERC.1994.344344"},{"key":"329213_CR22","doi-asserted-by":"crossref","unstructured":"R. Schreiber, Scalability of sparse direct solvers, in: Graph Theory and Sparse Matrix Compution, The IMA Volumes in Mathematics and its Applications, Vol. 56, eds. A. George, J.R. Gilbert and J.W.H. Liu (1993) pp. 191\u2013209.","DOI":"10.1007\/978-1-4613-8369-7_9"},{"key":"329213_CR23","volume-title":"MPI: The Complete Reference","author":"M. Snir","year":"1996","unstructured":"M. Snir, S.W. Otto, S. Hess-Lederman, D. Walker and J.J. Dongarra, MPI: The Complete Reference (MIT Press, Cambridge, MA, 1996). Available electronically: http:\/\/www.netlib.org\/utk\/papers\/mpibook.html."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019122726788.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019122726788\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019122726788.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:38:54Z","timestamp":1751870334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019122726788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["329213"],"URL":"https:\/\/doi.org\/10.1023\/a:1019122726788","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}