{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:10Z","timestamp":1757629510247,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T00:00:00Z","timestamp":1147219200000},"content-version":"vor","delay-in-days":5792,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0743-7315(90)90077-3","type":"journal-article","created":{"date-parts":[[2004,5,11]],"date-time":"2004-05-11T07:49:26Z","timestamp":1084261766000},"page":"261-270","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Linearly connected arrays for Toeplitz least-squares problems"],"prefix":"10.1016","volume":"9","author":[{"given":"A.W.","family":"Bojanczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.P.","family":"Brent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.R.","family":"De Hoog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90077-3_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01389431","article-title":"QR Factorization of Toeplitz matrices","volume":"44","author":"Bojanczyk","year":"1986","journal-title":"Numer. Math."},{"key":"10.1016\/0743-7315(90)90077-3_BIB2","series-title":"Advanced Algorithms and Architecturesfor Signal Processing III","article-title":"Old and new algorithms for Toeplitz systems","volume":"Vol. 975","author":"Brent","year":"1988"},{"issue":"1","key":"10.1016\/0743-7315(90)90077-3_BIB3","first-page":"1","article-title":"A systolic array for the linear time solution of Toeplitz systems of equations","volume":"1","author":"Brent","year":"1983","journal-title":"J. VLSI Comput. Systems"},{"key":"10.1016\/0743-7315(90)90077-3_BIB4","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/0908073","article-title":"Fast parallel algorithms for the QR and triangular factorization","volume":"8","author":"Chum","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0743-7315(90)90077-3_BIB5","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0908063","article-title":"Fast Toeplitz orthogonalization using inner products","volume":"8","author":"Cybenko","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"2","key":"10.1016\/0743-7315(90)90077-3_BIB6","first-page":"153","article-title":"The architecture of a programmable systolic chip","volume":"1","author":"Fisher","year":"1984","journal-title":"J. VLSI Comput. Systems"},{"issue":"1","key":"10.1016\/0743-7315(90)90077-3_BIB7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput. Mag."},{"issue":"1","key":"10.1016\/0743-7315(90)90077-3_BIB8","article-title":"A highly concurrent algorithm and pipelined architecture for solving Toeplitz systems","volume":"31","author":"Kung","year":"1983","journal-title":"IEEE Trans. Acoust. Speech Signal Process"},{"key":"10.1016\/0743-7315(90)90077-3_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01389635","article-title":"Fast Toeplitz orthogonalization","volume":"43","author":"Sweet","year":"1984","journal-title":"Numer. Math."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590900773?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590900773?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:31:22Z","timestamp":1757514682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731590900773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0743731590900773"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90077-3","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linearly connected arrays for Toeplitz least-squares problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90077-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}