{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:40:21Z","timestamp":1736116821052,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002801","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"688-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalability of parallel sparse Cholesky factorization"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Rauber","sequence":"first","affiliation":[]},{"given":"Gudula","family":"R\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Carsten","family":"Scholtes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"89_CR1","doi-asserted-by":"crossref","unstructured":"F. Abolhassan, J. Keller, and W.J. Paul. On the Cost-Effectiveness of PRAMS. In Proceeding of the 3rd IEEE Symposium on Parallel and Distributed Processing, pages 2\u20139, 1991.","DOI":"10.1109\/SPDP.1991.218303"},{"issue":"4","key":"89_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1177\/109434208700100403","volume":"1","author":"C. Ashcraft","year":"1987","unstructured":"C. Ashcraft, R.G. Grimes, J.G. Lewis, B.W. Peyton, and H.D. Simon. Recent Progress in Sparse Matrix Methods for Large Linear Systems. Int. J. Supercomputer Applications, 1(4):10\u201330, 1987.","journal-title":"Int. J. Supercomputer Applications"},{"key":"89_CR3","unstructured":"I. Duff, R. Grimes, and J. Lewis. User's Guide for the Harwell-Boeing Sparse Matrix Collection (Release I). Technical Report TR\/PA\/92\/86, Boeing Computer Services, 1992."},{"key":"89_CR4","unstructured":"A. George, J. Liu, and E. Ng. User's Guide for SPARSPAK: Waterloo Sparse Linear Equations Package. Technical Report Research Report CS-78-30, Department of Computer Science, University of Waterloo, 1980."},{"key":"89_CR5","unstructured":"A. George and J. W-H Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981."},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"D.E. Lenoski and W. Weber. Scalable Shared-Memory Multiprocessing. Morgan Kaufmann Publishers, Inc, 1995.","DOI":"10.1016\/B978-1-55860-315-8.50010-5"},{"key":"89_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J. W. H. Liu","year":"1990","unstructured":"Joseph W. H. Liu. The Role of Elimination Trees in Sparse Factorization. SIAM J. Matrix Anal. Appl., 11:134\u2013172, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"89_CR8","unstructured":"E.G. Ng and B.W. Peyton. A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors. Mathematical Sciences Section, P.O. Box 2009, Bldg. 9207-A, Oak Ridge, TN 37831-8083, 1991."},{"key":"89_CR9","doi-asserted-by":"crossref","unstructured":"T. Rauber, G. R\u00fcnger, and C. Scholtes. Scalability of parallel sparse cholesky factorization. Technical Report 02\/97, University Saarbr\u00fccken, 1997.","DOI":"10.1007\/BFb0002801"},{"key":"89_CR10","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1016\/0167-8191(95)00003-7","volume":"21","author":"E. Rothberg","year":"1995","unstructured":"E. Rothberg. Alternatives for Solving Sparse Triangular Systems on DistributedMemory Multiprocessors. Parallel Computing, 21:1121\u20131136, 1995.","journal-title":"Parallel Computing"},{"issue":"4","key":"89_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1142\/S0129053393000232","volume":"5","author":"E. Rothberg","year":"1993","unstructured":"E. Rothberg and A. Gupta. An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines. Int. J. High Speed Computing, 5(4):537\u2013593, 1993.","journal-title":"Int. J. High Speed Computing"},{"issue":"1","key":"89_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/130823.130824","volume":"20","author":"J.P. Singh","year":"1992","unstructured":"J.P. Singh, W.D. Weber, and A. Gupta. SPLASH: Stanford Parallel Applications for Shared-Memory. Computer Architecture News, 20(1):5\u201344, 1992.","journal-title":"Computer Architecture News"},{"key":"89_CR13","volume-title":"Introduction to Numerical Analysis","author":"J. Stoer","year":"1990","unstructured":"J. Stoer and R. Bulirsch. Introduction to Numerical Analysis. Springer, New York, 1990."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:03:39Z","timestamp":1736114619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0002801","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}