{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:08:44Z","timestamp":1759176524269},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1016\/0167-8191(86)90008-6","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"73-83","source":"Crossref","is-referenced-by-count":9,"title":["A note on the vectorization of scalar recursions"],"prefix":"10.1016","volume":"3","author":[{"given":"O","family":"Axelsson","sequence":"first","affiliation":[]},{"given":"V","family":"Eijkhout","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(86)90008-6_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-0427(85)90004-4","article-title":"Incomplete block matrix factorization methods. The ultimate answer?","volume":"12\/13","author":"Axelsson","year":"1985","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0167-8191(86)90008-6_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/1026003","article-title":"Implementing linear algebra algorithms for dense matrices on a vector pipeline machine","volume":"26","author":"Dongarra","year":"1984","journal-title":"SIAM Rev."},{"key":"10.1016\/0167-8191(86)90008-6_BIB3","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/1020096","article-title":"A survey of parallel algorithms in numerical linear algebra","volume":"20","author":"Heller","year":"1978","journal-title":"SIAM Rev."},{"key":"10.1016\/0167-8191(86)90008-6_BIB4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0713042","article-title":"Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems","volume":"13","author":"Heller","year":"1976","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8191(86)90008-6_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(73)80043-1","article-title":"Optimal algorithms for parallel polynomial evaluation","volume":"7","author":"Munro","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-8191(86)90008-6_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/321738.321741","article-title":"An efficient parallel algorithm for the solution of a tridiagonal linear system of equations","volume":"20","author":"Stone","year":"1973","journal-title":"J. ACM"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819186900086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819186900086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:20:35Z","timestamp":1551068435000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819186900086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0167819186900086"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(86)90008-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}