{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:16:08Z","timestamp":1747455368182,"version":"3.40.5"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Computational Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1018970413988","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"97-113","source":"Crossref","is-referenced-by-count":2,"title":["A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition"],"prefix":"10.1007","volume":"10","author":[{"suffix":"Jr.","given":"James J.","family":"Carrig","sequence":"first","affiliation":[]},{"given":"Gerard G.L.","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"325326_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02124732","volume":"5","author":"I.J. Anderson","year":"1996","unstructured":"I.J. Anderson and S.K. Harbour, Parallel factorization of banded linear matrices using a systolic array processor, Adv. Comput. Math. 5 (1996) 1-14.","journal-title":"Adv. Comput. Math."},{"key":"325326_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1137\/0908062","volume":"8","author":"J.L. Barlow","year":"1987","unstructured":"J.L. Barlow and I.C.F. Ipsen, Scaled Givens rotations for the solution of linear least squares problems on systolic arrays, SIAM J. Sci. Statist. Comput. 8 (1987) 716-733.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"325326_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/0908009","volume":"8","author":"C. Bischof","year":"1987","unstructured":"C. Bischof and C.F. Van Loan, The WY representation for products of Householder matrices, SIAM J. Sci. Statist. Comput. 8 (1987) 2-13.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"325326_CR4","series-title":"Technical Report","volume-title":"A banded fast Givens QR algorithm for efficient cache utilization","author":"J.J. Carrig Jr.","year":"1996","unstructured":"J.J. Carrig Jr. and G.G.L. Meyer, A banded fast Givens QR algorithm for efficient cache utilization, Technical Report 96-04, Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD (1996)."},{"key":"325326_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/174652.174660","volume":"41","author":"M. Cosnard","year":"1994","unstructured":"M. Cosnard and E.M. Daoudi, Optimal algorithms for parallel Given's factorizations on a coarse-grained PRAM, J. Assoc. Comput. Mach. 41 (1994) 399-421.","journal-title":"J. Assoc. Comput. Mach."},{"key":"325326_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/1037042","volume":"37","author":"J.J. Dongarra","year":"1995","unstructured":"J.J. Dongarra and D.W. Walker, Software libraries for linear algebra computations on high performance computers, SIAM Rev. 37 (1995) 151-180.","journal-title":"SIAM Rev."},{"key":"325326_CR7","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1137\/0908086","volume":"8","author":"K. Gallivan","year":"1987","unstructured":"K. Gallivan, W. Jalby and U. Meier, The use of BLAS3 in linear algebra on a parallel processor with a hierarchical memory, SIAM J. Sci. Statist. Comput. 8 (1987) 1079-1083.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"325326_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1177\/109434208800200103","volume":"2","author":"K. Gallivan","year":"1988","unstructured":"K. Gallivan, W. Jalby, U. Meier and A.H. Sameh, Impact of hierarchical memory systems on linear algebra algorithm design, Internat. J. Supercomputer Appl. 2 (1988) 12-48.","journal-title":"Internat. J. Supercomputer Appl."},{"key":"325326_CR9","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, MD, 1989)."},{"key":"325326_CR10","volume-title":"Solving Least Squares Problems","author":"C.L. Lawson","year":"1974","unstructured":"C.L. Lawson and R.J. Hanson, Solving Least Squares Problems (Prentice-Hall, Englewood Cliffs, NJ, 1974)."},{"key":"325326_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/322358.322366","volume":"30","author":"R.E. Lord","year":"1983","unstructured":"R.E. Lord, J.S. Kowalik and S.P. Kumar, Solving linear algebraic equations on an MIMD computer, J. Assoc. Comput. Mach. 30 (1983) 103-117.","journal-title":"J. Assoc. Comput. Mach."},{"key":"325326_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/(SICI)1096-9128(199607)8:6<461::AID-CPE256>3.0.CO;2-H","volume":"8","author":"G.G.L. Meyer","year":"1996","unstructured":"G.G.L. Meyer and M. Pascale, A family of parallel QR factorization algorithms, Special Issue of Concurrency Practice and Experience 8 (1996) 461-473.","journal-title":"Special Issue of Concurrency Practice and Experience"},{"key":"325326_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/322047.322054","volume":"25","author":"A. Sameh","year":"1978","unstructured":"A. Sameh and D. Kuck, On stable parallel linear system solvers, J. Assoc. Comput. Mach. 25 (1978) 81-91.","journal-title":"J. Assoc. Comput. Mach."},{"key":"325326_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R. Schreiber","year":"1989","unstructured":"R. Schreiber and C.F. Van Loan, A storage-efficient WY representation for products of Householder transformations, SIAM J. Sci. Statist. Comput. 10 (1989) 53-57.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"325326_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0614016","volume":"14","author":"R.A. Van De Geijn","year":"1993","unstructured":"R.A. Van De Geijn, Deferred shifting schemes for parallel QR methods, SIAM J. Matrix Anal. 14 (1993) 180-194.","journal-title":"SIAM J. Matrix Anal."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018970413988.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018970413988\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018970413988.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T23:18:04Z","timestamp":1747437484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018970413988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["325326"],"URL":"https:\/\/doi.org\/10.1023\/a:1018970413988","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"type":"print","value":"1019-7168"},{"type":"electronic","value":"1572-9044"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}