{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:45:54Z","timestamp":1751874354097},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654148"},{"type":"electronic","value":"9783540492610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0095336","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:05:49Z","timestamp":1164377149000},"page":"182-194","source":"Crossref","is-referenced-by-count":4,"title":["WSSMP: A high-performance serial and parallel symmetric sparse linear solver"],"prefix":"10.1007","author":[{"given":"Anshul","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Mahesh","family":"Joshi","sequence":"additional","affiliation":[]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"26_CR1","series-title":"Technical Report CS 96-01","volume-title":"Robust ordering of sparse matrices using multisection","author":"C. Ashcraft","year":"1996","unstructured":"C. Ashcraft and J. W.-H. Liu. Robust ordering of sparse matrices using multisection. Technical Report CS 96-01, Department of Computer Sciences, York University, Ontario, Canada, 1996."},{"key":"26_CR2","series-title":"Technical Report CS-84-36","volume-title":"Users guide for SPARSPAK-A: Waterloo sparse linear equations package","author":"E. Chu","year":"1984","unstructured":"E. Chu et al. Users guide for SPARSPAK-A: Waterloo sparse linear equations package. Technical Report CS-84-36, University of Waterloo, Waterloo, IA, 1984."},{"issue":"1\/2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1147\/rd.411.0171","volume":"41","author":"A. Gupta","year":"1997","unstructured":"A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM Journal of Research and Development, 41 (1\/2):171\u2013183, 1997.","journal-title":"IBM Journal of Research and Development"},{"key":"26_CR4","series-title":"RC 20923 (92669)","volume-title":"WSSMP: Watson symmetric sparse matrix package: The user interface","author":"A. Gupta","year":"1997","unstructured":"A. Gupta, M. Joshi, and V. Kumar. WSSMP: Watson symmetric sparse matrix package: The user interface. RC 20923 (92669), IBM T. J. Watson Research Center, Yorktown Heights, NY, July 17, 1997."},{"issue":"5","key":"26_CR5","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 Transactions on Parallel and Distributed Systems, 8(5):502\u2013520, May 1997.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"26_CR6","series-title":"SAND96-0868J","volume-title":"Improving the runtime and quality of nested dissection ordering","author":"B. Hendrickson","year":"1996","unstructured":"B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested dissection ordering. SAND96-0868J, Sandia National Laboratories, Albuquerque, NM, 1996."},{"key":"26_CR7","series-title":"TR 97-024","volume-title":"Two dimensional scalable parallel algorithms for solution of triangular systems","author":"M. Joshi","year":"1997","unstructured":"M. Joshi, A. Gupta, G. Karypis, and V. Kumar. Two dimensional scalable parallel algorithms for solution of triangular systems. TR 97-024, Department of Computer Science, Univeristy of Minnesota, Minneapolis, MN, July 1997."},{"key":"26_CR8","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, Department of Computer Science, University of Minnesota, 1995."},{"key":"26_CR9","unstructured":"G. Karypis and V. Kumar. Parmetis: Parallel graph partitioning and sparse matrix ordering library. Tr 97-060, Department of Computer Science, University of Minnesota, 1997."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/1034004","volume":"34","author":"J. W. Liu","year":"1992","unstructured":"J. W.-H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34:82\u2013109, 1992.","journal-title":"SIAM Review"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing Large Scale Scientific and Industrial Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0095336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T01:54:50Z","timestamp":1550195690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0095336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654148","9783540492610"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0095336","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}