{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:09:56Z","timestamp":1743124196917,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654148"},{"type":"electronic","value":"9783540492610"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0095342","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:05:49Z","timestamp":1164377149000},"page":"239-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Partitioning sparse rectangular matrices for parallel computations of Ax and A T v"],"prefix":"10.1007","author":[{"given":"Bruce","family":"Hendrickson","sequence":"first","affiliation":[]},{"given":"Tamara G.","family":"Kolda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S. T. Barnard","year":"1994","unstructured":"Stephen T. Barnard and Horst D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6:101\u2013117, 1994.","journal-title":"Concurrency: Practice and Experience"},{"key":"32_CR2","unstructured":"Michael W. Berry, Bruce Hendrickson, and Padma Raghavan. Sparse matrix reordering schemes for browsing hypertext. In James Renegar, Michael Shub, and Steve Smale, editors, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics, pages 99\u2013122. American Mathematical Society, 1996."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"R. W. Freund","year":"1991","unstructured":"Roland W. Freund and No\u00ebl M. Nachtigal. QMR: A quasi-minimal residual method for non-Hermitian linear systems. Numer. Math., 60:315\u2013339, 1991.","journal-title":"Numer. Math."},{"key":"32_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"32_CR5","series-title":"Technical Report TR-PA-93-50","volume-title":"Description and use of animal breeding data for large least squares problems","author":"M. Hegland","year":"1993","unstructured":"Markus Hegland. Description and use of animal breeding data for large least squares problems. Technical Report TR-PA-93-50, CERFACS, Toulouse, France, 1993."},{"key":"32_CR6","series-title":"Technical Memorandum TM-13657","volume-title":"Partitioning nonsquare and nonsymmetric matrices for parallel processing","author":"B. Hendrickson","year":"1998","unstructured":"Bruce Hendrickson and Tamara G. Kolda. Partitioning nonsquare and nonsymmetric matrices for parallel processing. Technical Memorandum TM-13657, Oak Ridge National Laboratory, Oak Ridge, TN 37831, 1998. Submitted to SIAM J. Scientific Computing."},{"key":"32_CR7","series-title":"Technical Report SAND95-2344","volume-title":"The Chaco user\u2019s guide","author":"B. Hendrickson","year":"1995","unstructured":"Bruce Hendrickson and Robert Leland. The Chaco user\u2019s guide, version 2.0. Technical Report SAND95-2344, Sandia Natl. Lab., Albuquerque, NM, 87185, 1995."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Bruce Hendrickson and Robert Leland. A multilevel algorithm for partitioning graphs. In Proc. Supercomputing \u201995. ACM, 1995.","DOI":"10.1145\/224170.224228"},{"key":"32_CR9","unstructured":"A. Hofer. Sch\u00e4tzung von Zuchtwerten feldgepr\u00fcfter Schweine mit einem Mehrmerkmals-Tiermodell. PhD thesis, ETH-Zurich, 1990. Cited in Markus Hegland. Description and use of animal breeding data for large least squares problems. Technical Report TR-PA-93-50, CERFACS, Toulouse, France, 1993."},{"key":"32_CR10","series-title":"Technical Report 95-035","volume-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","author":"G. Karypis","year":"1995","unstructured":"George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Dept. Computer Science, Univ. Minnesota, Minneapolis, MN 55455, 1995."},{"key":"32_CR11","series-title":"Technical Report 95-036","volume-title":"Parallel multilevel graph partitioning","author":"G. Karypis","year":"1995","unstructured":"George Karypis and Vipin Kumar. Parallel multilevel graph partitioning. Technical Report 95-036, Dept. Computer Science, Univ. Minnesota, Minneapolis, MN 55455, 1995."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical J., 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"32_CR13","unstructured":"Tamara G. Kolda. Partitioning sparse rectangular matrices for parallel processing. In Proc. 5th Intl. Symposium on Solving Irregularly Structured Problems in Parallel (Irregular \u201998), to appear."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C. C. Paige","year":"1982","unstructured":"Christopher C. Paige and Michael A. Saunders. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Mathematical Software, 8:43\u201371, 1982.","journal-title":"ACM Trans. Mathematical Software"},{"key":"32_CR15","series-title":"Technical Report CS-TR-3560","volume-title":"Adaptive use of iterative methods in interior point methods for linear programming","author":"W. Wang","year":"1995","unstructured":"Weichung Wang and Dianne P. O\u2019Leary. Adaptive use of iterative methods in interior point methods for linear programming. Technical Report CS-TR-3560, Dept. Computer Science, Univ. Maryland, College Park, MD 20742, 1995."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing Large Scale Scientific and Industrial Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0095342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:18:44Z","timestamp":1676575124000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0095342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654148","9783540492610"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0095342","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"20 October 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}