Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition (Q1107262): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90313-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058290530 / rank | |||
Normal rank | |||
Revision as of 01:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition |
scientific article |
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
