{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:11:44Z","timestamp":1777547504061,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1016\/s0167-8191(99)00041-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:52:00Z","timestamp":1049741520000},"page":"969-986","source":"Crossref","is-referenced-by-count":21,"title":["Efficient parallel reduction to bidiagonal form"],"prefix":"10.1016","volume":"25","author":[{"given":"Benedikt","family":"Gro\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00041-1_BIB1","doi-asserted-by":"crossref","unstructured":"M. Be\u010dka, S. Robert, M. Vajter\u0161ic, Experiments with parallel one-sided and two-sided algorithms for SVD, in: P. Zinterhof, M. Vajter\u0161ic, A. Uhl (Eds.), Parallel Computation, Springer, Berlin, 1999, pp. 48\u201357","DOI":"10.1007\/3-540-49164-3_5"},{"key":"10.1016\/S0167-8191(99)00041-1_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10637199808947370","article-title":"Block-Jacobi SVD algorithms for distributed memory systems I : Hypercubes and rings","volume":"13","author":"Be\u010dka","year":"1999","journal-title":"Parallel Algorithms Appl."},{"issue":"8","key":"10.1016\/S0167-8191(99)00041-1_BIB3","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/0167-8191(95)00015-G","article-title":"A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg form","volume":"21","author":"Berry","year":"1995","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-8191(89)90027-6","article-title":"Computing the singular value decomposition on a distributed system of vector processors","volume":"11","author":"Bischof","year":"1989","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/S0167-8191(99)00041-1_BIB5","doi-asserted-by":"crossref","first-page":"s2","DOI":"10.1137\/0908009","article-title":"The WY representation for products of Householder matrices","volume":"8","author":"Bischof","year":"1987","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-4655(96)00017-3","article-title":"ScaLAPACK: A portable linear algebra library for distributed memory computers \u2013 design issues and performance","volume":"97","author":"Choi","year":"1996","journal-title":"Comput. Phys. Comm."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB7","doi-asserted-by":"crossref","unstructured":"J. Choi, J. Dongarra, S. Ostrouchov, A. Petitet, D. Walker, R.C. Whaley, A proposal for a set of parallel basic linear algebra subprograms, in: J. Dongarra, K. Masden, J. Wa\u015bniewski (Eds.), Applied Parallel Computing, Springer, Berlin, 1995, pp. 107\u2013114","DOI":"10.1007\/3-540-60902-4_13"},{"key":"10.1016\/S0167-8191(99)00041-1_BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1155\/1996\/483083","article-title":"The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines","volume":"5","author":"Choi","year":"1996","journal-title":"Sci. Programming"},{"key":"10.1016\/S0167-8191(99)00041-1_BIB9","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02140776","article-title":"The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form","volume":"10","author":"Choi","year":"1995","journal-title":"Numer. Alg."},{"issue":"1","key":"10.1016\/S0167-8191(99)00041-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","article-title":"A set of level 3 basic linear algebra subprograms","volume":"16","author":"Dongarra","year":"1990","journal-title":"ACM Trans. Math. Soft."},{"issue":"1","key":"10.1016\/S0167-8191(99)00041-1_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/42288.42291","article-title":"An extended set of FORTRAN basic linear algebra subprograms","volume":"14","author":"Dongarra","year":"1988","journal-title":"ACM Trans. Math. Soft."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB12","unstructured":"J.J. Dongarra, R.C. Whaley, LAPACK Working Note 94: A user's guide to the BLACS v1.0, Technical Report CS-95-281, University of Tennessee at Knoxville, March 1995"},{"key":"10.1016\/S0167-8191(99)00041-1_BIB13","unstructured":"B. Gro\u00dfer, Parallele zweistufige Verfahren zur Reduktion auf Bidiagonalgestalt, Diplomarbeit, Fachbereich Mathematik, Bergische Universit\u00e4t GH Wuppertal, 1997"},{"key":"10.1016\/S0167-8191(99)00041-1_BIB14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1137\/0106005","article-title":"Inversion of matrices by biorthogonalization and related results","volume":"6","author":"Hestenes","year":"1958","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/qam\/88795","article-title":"Solution of linear equations by diagonalization of coefficients matrix","volume":"13","author":"Kogbetliantz","year":"1955","journal-title":"Quart. Appl. Math."},{"key":"10.1016\/S0167-8191(99)00041-1_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(95)00064-X","article-title":"Parallel reduction of banded matrices to bidiagonal form","volume":"22","author":"Lang","year":"1996","journal-title":"Parallel Comput."},{"issue":"1","key":"10.1016\/S0167-8191(99)00041-1_BIB17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0910005","article-title":"A storage-efficient WY representation for products of Householder transformations","volume":"10","author":"Schreiber","year":"1989","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000411?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000411?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T06:46:02Z","timestamp":1580366762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0167819199000411"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00041-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}