Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition (Q1107262)
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: Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition |
scientific article; zbMATH DE number 4064363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition |
scientific article; zbMATH DE number 4064363 |
Statements
Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition (English)
0 references
1988
0 references
The author establishes sufficient conditions for the asymptotic quadratic convergence of the cyclic Kogbetliantz algorithm for computing the singular value decomposition of a triangular matrix in the case of repeated or clustered singular values.
0 references
asymptotic quadratic convergence
0 references
cyclic Kogbetliantz algorithm
0 references
singular value decomposition
0 references
triangular matrix
0 references
clustered singular values
0 references
0 references
0.9276307225227356
0 references
0.8482414484024048
0 references
0.8183231949806213
0 references
