{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T08:18:27Z","timestamp":1672474707769},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0167-8191(94)90124-4","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"903-914","source":"Crossref","is-referenced-by-count":2,"title":["A systolic array architecture for QR decomposition of block structured sparse systems"],"prefix":"10.1016","volume":"20","author":[{"given":"C.R","family":"Wan","sequence":"first","affiliation":[]},{"given":"D.J","family":"Evans","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90124-4_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S1570-8659(05)80036-5","article-title":"Least squares methods","author":"Bj\u00f6rck","year":"1990"},{"key":"10.1016\/0167-8191(94)90124-4_BIB2","series-title":"Proc. Computer Science and Statics: Twelfth Annual Conf. on the Interface","article-title":"A sparse least squares problem in photogrammetry","author":"Golub","year":"1979"},{"key":"10.1016\/0167-8191(94)90124-4_BIB3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/imanum\/5.2.221","article-title":"A modification of an algorithm by Golub and Plemmons for large linear least squares in the context of Doppler positioning","volume":"5","author":"Manneback","year":"1985","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/0167-8191(94)90124-4_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(80)90156-1","article-title":"Large scale geodetic least squares adjustment by dissection and orthogonal decomposition","volume":"34","author":"Golub","year":"1980","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0167-8191(94)90124-4_BIB5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.18.1.98","article-title":"Rearranging matrices to block angular form for decomposition (and other) algorithms","volume":"18","author":"Weil","year":"1971","journal-title":"Management Sci."},{"key":"10.1016\/0167-8191(94)90124-4_BIB6","first-page":"19","article-title":"Matrix triangularization by systolic arrays","volume":"IV","author":"Gentleman","year":"1981"},{"key":"10.1016\/0167-8191(94)90124-4_BIB7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imamat\/12.3.329","article-title":"Least squares computation by Givens transformations without square roots","volume":"12","author":"Gentleman","year":"1973","journal-title":"J. Inst. Maths Applics"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:28:54Z","timestamp":1551086934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194901244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0167819194901244"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90124-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}