No label defined (Q3780353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4043151 |
Statements
1987
0 references
singular value decomposition
0 references
power method
0 references
Chebyshev iteration method
0 references
orthogonalization procedures
0 references
backward error theorems
0 references
convergence level
0 references
notes level
0 references
0.7907086610794067
0 references
0.7769409418106079
0 references
[For the entire collection see Zbl 0636.00016.] Two algorithms for singular value decomposition are studied in a unifying framework: the power method and the Chebyshev iteration method. They allow to compute adaptively the partial SVD (dominant, smallest or intermediate triplets) of matrices that are slowly time varying and perturbed by noise. The only routines used are matrix vector multiplication and orthogonalization procedures. Some original convergence expressions are derived and convergence rates of both methods are compared. Some backward error theorems permit the control of the convergence level with respect to the notes level.
0 references