Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values (Q1176528)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values |
scientific article; zbMATH DE number 12089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values |
scientific article; zbMATH DE number 12089 |
Statements
Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values (English)
0 references
25 June 1992
0 references
Three iterative methods --- inverse iteration, ordinary Chebyshev iteration and inverse Chebyshev iteration --- are discussed. The methods compute one singular vector (or a basis for a subspace of singular vectors belonging to several smallest singular values) instead of computing the complete singular value decomposition. The methods are compared by analyzing their convergence properties. Experimental results are presented in figures and tables.
0 references
iterative algorithms
0 references
inverse iteration
0 references
Chebyshev iteration
0 references
singular vector
0 references
singular values
0 references
singular value decomposition
0 references
convergence
0 references
experimental results
0 references
0 references
0 references
0.95136297
0 references
0.93763506
0 references
0.93212324
0 references
0 references
0.8920744
0 references
0.89108604
0 references