{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:52Z","timestamp":1725493072475},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45706-2_94","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"677-686","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["New Parallel (Rank-Revealing) QR Factorization Algorithms"],"prefix":"10.1007","author":[{"given":"Rudnei Dias","family":"da Cunha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dulcen\u00e9ia","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James Carlton","family":"Patterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"issue":"2","key":"94_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/290200.287637","volume":"24","author":"C.H. Bischof","year":"1998","unstructured":"C.H. Bischof and G. Quintana-Ort\u00ed. Computing rank-revealing QR factorizations of dense matrices. ACM Transactions on Mathematical Software, 24(2):226\u2013253, June 1998.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"94_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88","author":"T.F. Chan","year":"1987","unstructured":"T.F. Chan. Rank revealing QR factorizations. Linear Algebra and its Applications, 88\/89:67\u201382, 1987.","journal-title":"Linear Algebra and its Applications"},{"key":"94_CR3","first-page":"245","volume-title":"High-Performance Computing II \u2014 Proceedings of the Second Symposium on High Performance Computing","author":"R.D. Cunha da","year":"1991","unstructured":"R.D. da Cunha and T.R. Hopkins. The parallel solution of triangular systems of linear equations. In Durand, M. and El Dabaghi, F., editor, High-Performance Computing II \u2014 Proceedings of the Second Symposium on High Performance Computing, pages 245\u2013256, Amsterdam, October 1991. North-Holland. Also as Report No. 86, Computing Laboratory, University of Kent at Canterbury, U.K."},{"issue":"4","key":"94_CR4","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1147\/rd.444.0605","volume":"44","author":"E. Elmroth","year":"2000","unstructured":"E. Elmroth and F.G. Gustavson. Applying recursion to serial and parallel QR factorization leads to better performance. IBM Journal of Research and Development, 44(4):605\u2013624, July 2000.","journal-title":"IBM Journal of Research and Development"},{"key":"94_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0024-3795(86)90115-1","volume":"74","author":"L.V. Foster","year":"1986","unstructured":"L.V. Foster. Rank and null space calculations using matrix decomposition without column interchanges. Linear Algebra and its Applications, 74:47\u201371, 1986.","journal-title":"Linear Algebra and its Applications"},{"key":"94_CR6","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 2nd edition, 1989.","edition":"2nd edition"},{"key":"94_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0909037","volume":"9","author":"M.T. Heath","year":"1988","unstructured":"M.T. Heath and C.H. Romine. Parallel solution of triangular systems on distributed-memory multiprocessors. SIAM Journal of Scientific and Statistical Computing, 9:558\u2013588, 1988.","journal-title":"SIAM Journal of Scientific and Statistical Computing"},{"key":"94_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1137\/0910025","volume":"10","author":"G. Li","year":"1989","unstructured":"G. Li and T.F. Coleman. A new method for solving triangular systems on distributed-memory message-passing multiprocessors. SIAM Journal of Scientific and Statistical Computing, 10:382\u2013396, 1989.","journal-title":"SIAM Journal of Scientific and Statistical Computing"},{"key":"94_CR9","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0907081","volume":"7","author":"J.W.H. Liu","year":"1986","unstructured":"J.W.H. Liu. On general row merging schemes for sparse Givens transformations. SIAM Journal of Scientific and Statistical Computing, 7:1190\u20131211, 1986.","journal-title":"SIAM Journal of Scientific and Statistical Computing"},{"issue":"2","key":"94_CR10","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0907030","volume":"7","author":"F.T. Luk","year":"1986","unstructured":"F.T. Luk. A rotation method for computing the QR-decomposition. SIAM Journal on Scientific and Statistical Computing, 7(2):452\u2013459, 1986.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"1","key":"94_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/S0895479893244353","volume":"18","author":"D.J. Pierce","year":"1997","unstructured":"D.J. Pierce and J.G. Lewis. Sparse multifrontal rank revealing QR factorization. SIAM Journal on Matrix Analysis and Applications, 18(1):159\u2013180, 1997.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"94_CR12","volume-title":"Iterative methods for sparse linear systems","author":"Y. Saad","year":"1995","unstructured":"Youcef Saad. Iterative methods for sparse linear systems. PWS Publishing Company, Boston, 1995."},{"issue":"4","key":"94_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/(SICI)1099-1506(199707\/08)4:4<305::AID-NLA104>3.0.CO;2-D","volume":"4","author":"R.B. Sidje","year":"1997","unstructured":"R.B. Sidje. Alternatives for parallel Krylov subspace basis computation. Numerical Linear Algebra with Applications, 4(4):305\u2013331, 1997.","journal-title":"Numerical Linear Algebra with Applications"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_94","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:15:01Z","timestamp":1587341701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_94","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","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"}]}}