Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071892
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:10:37 PM
Last modification on : Thursday, February 11, 2021 - 2:48:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:37:12 PM

Identifiers

  • HAL Id : inria-00071892, version 1

Citation

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

Share

Metrics

Record views

504

Files downloads

1568