{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:26Z","timestamp":1725663626496},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194873"},{"type":"electronic","value":"9783540392880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19487-8_17","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:11:41Z","timestamp":1330182701000},"page":"145-153","source":"Crossref","is-referenced-by-count":3,"title":["Parallel solution of sparse linear systems"],"prefix":"10.1007","author":[{"given":"John R.","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Hj\u00e1lmt\u00fdr","family":"Hafsteinsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"D. Coopersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 1\u20138, 1987.","DOI":"10.1145\/28395.28396"},{"key":"17_CR2","unstructured":"A. George and J.W.H. Liu. Computer Solutions of Large Sparse Positive Definite Systems. Prentice-Hall, 1981."},{"key":"17_CR3","unstructured":"J.R. Gilbert and E. Zmijewski. A parallel graph partitioning algorithm for a message-passing multiprocessor. Technical Report CS-87-803, Cornell University, 1987."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","volume":"12","author":"J. W. H. H. Liu","year":"1986","unstructured":"J.W.H. Liu. A compact row storage scheme for Cholesky factors using elimination trees. ACM Transactions on Mathematical Software, 12:127\u2013148, 1986.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"17_CR5","unstructured":"J.W.H. Liu. The role of elimination trees in sparse factorization. Technical Report CS-87-12, York University, 1987."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"G.L. Miller and J.H. Reif. Parallel tree contraction and its application. In Proc. 26th Symposium on Foundations of Computer Science, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/4021.4025","volume":"28","author":"D. P. O'Leary","year":"1985","unstructured":"D.P. O'Leary and G.W. Stewart. Data-flow algorithms for parallel matrix computations. Communications of the ACM, 28:840\u2013853, 1985.","journal-title":"Communications of the ACM"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"V. Pan and J.H. Reif. Efficient parallel solution of linear systems. In Proc. 17th Annual ACM Symposium on Theory of Computing, pages 143\u2013152, 1985.","DOI":"10.1145\/22145.22161"},{"issue":"3","key":"17_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0020-0190(78)90079-0","volume":"7","author":"F. P. Preparata","year":"1978","unstructured":"F.P. Preparata and D.V. Sarwate. An improved parallel processor bound in fast matrix inversion. Information Processing Letters, 7(3):148\u2013150, 1978.","journal-title":"Information Processing Letters"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266\u2013283, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","volume":"8","author":"R. Schreiber","year":"1982","unstructured":"R. Schreiber. A new implementation of sparse Gaussian elimination. ACM Transactions on Mathematical Software, 8:256\u2013276, 1982.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3:57\u201367, 1982.","journal-title":"Journal of Algorithms"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"17_CR14","unstructured":"E. Zmijewski and J.R. Gilbert. Wide quotient trees for finite eliment problems. Technical Report CS-85-673, Cornell University, 1985."},{"key":"17_CR15","unstructured":"E. Zmijewski and J.R. Gilbert. A parallel algorithm for large sparse Cholesky factorization on a multiprocessor. Technical Report CS-86-733, Cornell University, 1986. To appear in Parallel Computing."}],"container-title":["Lecture Notes in Computer Science","SWAT 88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19487-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:55:52Z","timestamp":1619542552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19487-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194873","9783540392880"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-19487-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}