An optimum iteration for the matrix polar decomposition (Q1292261)
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 1306001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimum iteration for the matrix polar decomposition |
scientific article; zbMATH DE number 1306001 |
Statements
An optimum iteration for the matrix polar decomposition (English)
0 references
21 June 1999
0 references
The author shows that an acceleration parameter (derived from the Frobenius norm) makes Newton's iteration for the computation of the polar decomposition optimal and monotonic with respect to the associated norm. An application to full-rank rectangular matrices \(A\in \mathbb{R}^{m\times n}\) is also given.
0 references
Newton iteration
0 references
matrix polar decomposition
0 references
full-rank rectangular matrices
0 references
0.8756771683692932
0 references
0.827704906463623
0 references
0.8272534012794495
0 references
0.8194413185119629
0 references
0.8141806721687317
0 references
