HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Parallel computation of the singular value decomposition

Abstract : The goal of this survey is to give a view of the state-of-the-art of computing the Singular Value Decomposition (SVD) of dense and sparse matrices, with some emphasis on those schemes that are suitable for parallel computing platforms. For dense matrices, we survey those schemes that yield the complete decomposition, whereas for sparse matrices we survey schemes that yield only the extremal singular triplets. Special attention is devoted to the computation of the smallest singular values which are normally the most difficult to evaluate but which provide a measure of the distance to singularity of the matrix under consideration. Also, a parallel method for computing pseudospectra, which depends on computing the smallest singular values, is presented at the conclusion of the survey.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:10:37 PM
Last modification on : Friday, February 4, 2022 - 3:11:11 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:37:12 PM


  • HAL Id : inria-00071892, version 1


Michael Berry, Dany Mezher, Bernard Philippe, Ahmed Sameh. Parallel computation of the singular value decomposition. [Research Report] RR-4694, INRIA. 2003. ⟨inria-00071892⟩



Record views


Files downloads