A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix

DOI10.1137/S089547989120195XzbMath0797.65037MaRDI QIDQ4292683

E. R. Jessup, Danny C. Sorensen

Publication date: 18 May 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

singular value decompositionnumerical experimentsparallel computationsingular vectorsdivide and conquer algorithmsymmetric tridiagonal eigenproblemrank one modificationdeflation techniqueroot finding method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items

On computing accurate singular values and eigenvalues of matrices with acyclic graphs, On the primal-dual algorithm for callable bermudan options, An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem, Note on a rank-one modification of the singular value decomposition, A mathematical biography of Danny C. Sorensen, Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems, An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths, A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems