An optimum iteration for the matrix polar decomposition (Q1292261): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1334235 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Augustin A. Dubrulle / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 03:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimum iteration for the matrix polar decomposition |
scientific article |
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
