{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T08:26:17Z","timestamp":1778228777626,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":[[2000,10]]},"DOI":"10.1023\/a:1019118015711","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"371-391","source":"Crossref","is-referenced-by-count":3,"title":["Parallel sparse linear algebra and application to structural mechanics"],"prefix":"10.1007","volume":"24","author":[{"given":"David","family":"Goudin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"H\u00e9non","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Pesqu\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329405_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P. Amestoy","year":"1996","unstructured":"P. Amestoy, T. Davis and I. Duff, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl. 17 (1996) 886-905.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"329405_CR2","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4613-8369-7_8","volume-title":"Graph Theory and Sparse Matrix Computation","author":"C. Ashcraft","year":"1993","unstructured":"C. Ashcraft, The Fan-Both family of column-based distributed Cholesky factorization algorithms, in: Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, Vol. 56 (Springer, New York, 1993) pp. 159-190."},{"issue":"3","key":"329405_CR3","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-599.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329405_CR4","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S.C. Eisenstat, J.W.-H. Liu and A. Sherman, A comparison of three column based distributed sparse factorization schemes, in: Proc. of 5th SIAM Conf. on Parallel Processing for Scientific Computing (1991).","DOI":"10.21236\/ADA228143"},{"key":"329405_CR5","unstructured":"H. Bramble, J.E. Pasciak and J. Xu, Parallel multilevel preconditioner, in: Proc. of 3rd SIAM Internat. Symp. on Domain Decomposition Method for Partial Differential Equations (1999) pp. 341-357."},{"key":"329405_CR6","doi-asserted-by":"publisher","first-page":"3529","DOI":"10.1002\/nme.1620381210","volume":"38","author":"V.E. Bulgakov","year":"1995","unstructured":"V.E. Bulgakov and G. Kuhn, High performance multilevel iterative aggregation solver for large finite element structural analysis problems, Internat. J. Numer. Methods Engrg. 38 (1995) 3529-3544.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01396049","volume":"55","author":"P. Charrier","year":"1989","unstructured":"P. Charrier and J. Roman, Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00ee t\u00e9es, Numer. Math. 55 (1989) 463-476.","journal-title":"Numer. Math."},{"key":"329405_CR8","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1002\/nme.1620371305","volume":"37","author":"J.K. Dickinson","year":"1994","unstructured":"J.K. Dickinson and P.A. Forsyth, Preconditioned conjugate gradient methods for 3d linear elasticity, Internat. J. Numer. Methods Engrg. 37 (1994) 2211-2234.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR9","doi-asserted-by":"publisher","first-page":"3297","DOI":"10.1002\/nme.1620381908","volume":"38","author":"M.C. Dracopoulos","year":"1995","unstructured":"M.C. Dracopoulos and M.A. Crisfield, Coarse\/fine mesh preconditioners for the iterative solution of finite element problems, Internat. J. Numer. Methods Engrg. 38 (1995) 3297-3313.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR10","unstructured":"I.S. Duff, Sparse numerical linear algebra: Direct methods and preconditioning, Technical Report TR\/PA\/96\/22, CERFACS (1996)."},{"issue":"4","key":"329405_CR11","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(4) (1989) 291-314.","journal-title":"Internat. J. Parallel Programming"},{"key":"329405_CR12","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.W.-H. Liu and E.G.-Y. Ng, Sparse Cholesky factorization on a local memory multiprocessor, SIAM J. Sci. Statist. Comput. 9 (1988) 327-340.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"329405_CR13","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"A. George and J.W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"329405_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/(SICI)1097-0207(19990110)44:1<77::AID-NME493>3.0.CO;2-0","volume":"44","author":"E. Graham","year":"1999","unstructured":"E. Graham and P.A. Forsyth, Preconditioning methods for very ill conditioned 3d linear elasticity problems, Internat. J. Numer. Methods Engrg. 44 (1999) 77-99.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR15","unstructured":"A. Gupta, G. Karypis and V. Kumar, Scalable parallel algorithms for sparse linear systems, in: Proc. of Stratagem'96, Sophia-Antipolis (July 1996) pp. 97-110."},{"issue":"5","key":"329405_CR16","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/71.598277","volume":"8","author":"A. Gupta","year":"1997","unstructured":"A. Gupta, G. Karypis and V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization, IEEE Trans. Parallel Distributed Systems 8(5) (1997) 502-520.","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"329405_CR17","doi-asserted-by":"crossref","unstructured":"A. Gupta and V. Kumar, WSSMP: A high-performance serial and parallel symmetric sparse linear solver, in: PARA'98 Workshop on Applied Parallel Computing in Large Scale Scientific and Industrial Problems, Ume\u00e5 , Sweden (June 1998).","DOI":"10.1007\/BFb0095336"},{"key":"329405_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1007\/3-540-48311-X_148","volume-title":"Proc. of EuroPAR'99","author":"P. H\u00e9non","year":"1999","unstructured":"P. H\u00e9non, P. Ramet and J. Roman, A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization, in: Proc. of EuroPAR'99, Lecture Notes in Computer Science, Vol. 1685 (Springer, New York, 1999) pp. 1059-1067."},{"key":"329405_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-45591-4_70","volume-title":"Proc. of IRREGULAR 2000","author":"P. H\u00e9non","year":"2000","unstructured":"P. H\u00e9non, P. Ramet and J. Roman, PaStiX: A parallel sparse direct solver based on a static scheduling for mixed 1D\/2D block distributions, in: Proc. of IRREGULAR 2000, Lecture Notes in Computer Science (Springer, New York, 2000) pp. 519-525."},{"key":"329405_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0045-7825(96)01244-3","volume":"146","author":"P. Laborde","year":"1997","unstructured":"P. Laborde, B. Toson and J.-J. Pesqu\u00e9, On the consistent tangent operator algorithm for thermo-pastic problems, Comput. Methods Appl. Mech. Engrg. 146 (1997) 215-230.","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"key":"329405_CR21","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1002\/(SICI)1097-0207(19990220)44:5<641::AID-NME520>3.0.CO;2-P","volume":"43","author":"F.J. Lingen","year":"1999","unstructured":"F.J. Lingen, A generalized conjugate residual method for the solution of non-symmetric systems of equations with multiple right hand sides, Internat. J. Numer. Methods Engrg. 43 (1999) 641-656.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR22","unstructured":"T.A. Manteuffel, The shifted incomplete cholesky factorization, Technical Report, Sandia Laboratories, Livermore."},{"key":"329405_CR23","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1002\/(SICI)1097-0207(19981230)43:8<1383::AID-NME473>3.0.CO;2-V","volume":"43","author":"J.A. Mitchell","year":"1998","unstructured":"J.A. Mitchell and J.N. Reddy, A multilevel hierarchical preconditioner for thin elastic solids, Internat. J. Numer. Methods Engrg. 43 (1998) 1383-1400.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/BFb0031609","volume-title":"Proc. of HPCN'97","author":"F. Pellegrini","year":"1997","unstructured":"F. Pellegrini and J. Roman, Sparse matrix ordering with SCOTCH, in: Proc. of HPCN'97, Vienna (April 1997), Lecture Notes in Computer Science, Vol. 1225 (Springer, New York) pp. 370-378."},{"key":"329405_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1007\/BFb0097983","volume-title":"Proc. of IRREGULAR'99","author":"F. Pellegrini","year":"1999","unstructured":"F. Pellegrini, J. Roman and P. Amestoy, Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, in: Proc. of IRREGULAR'99, Puerto Rico (April 1999), Lecture Notes in Computer Science, Vol. 1586 (Springer, New York) pp. 986-995."},{"issue":"5","key":"329405_CR26","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-1257.","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"329405_CR27","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-713.","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"329405_CR28","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-1439.","journal-title":"SIAM J. Sci. Comput."},{"key":"329405_CR29","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/SUPERC.1994.344344","volume-title":"Proc. of Supercomputing'94","author":"E. Rothberg","year":"1994","unstructured":"E. Rothberg and R. Schreiber, Improved load distribution in parallel sparse Cholesky factorization, in: Proc. of Supercomputing'94 (IEEE Press, New York, 1994) pp. 783-792."},{"key":"329405_CR30","unstructured":"Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, 1996)."},{"key":"329405_CR31","unstructured":"R. Schreiber, Scalability of sparse direct solvers, Technical Report TR 92.13, RIACS, NASA Ames Research Center (May 1992)."},{"key":"329405_CR32","unstructured":"P. Schulze et al., The Cologne Challenge, Finite Element News (4)."},{"key":"329405_CR33","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1002\/nme.1620381007","volume":"38","author":"M. Suarjana","year":"1995","unstructured":"M. Suarjana and K. Law, A robust incomplete factorization based on value and space constraints, Internat. J. Numer. Methods Engrg. 38 (1995) 1703-1719.","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"329405_CR34","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"W.F. Tinney","year":"1967","unstructured":"W.F. Tinney and J.W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, J. Proc. IEEE 55 (1967) 1801-1809.","journal-title":"J. Proc. IEEE"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019118015711.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019118015711\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019118015711.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:21:39Z","timestamp":1751872899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019118015711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["329405"],"URL":"https:\/\/doi.org\/10.1023\/a:1019118015711","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}