An optimum iteration for the matrix polar decomposition
type: Item
instance of: scholarly article
title: An optimum iteration for the matrix polar decomposition
zbMATH Open document ID: 0939.65068
publication date: 1999-06-21T00:00:00Z
full work available at URL: https://eudml.org/doc/120380
full work available at URL: pp21-25.html
review text: 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.
reviewed by: Costică Moroşanu
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65F35
zbMATH DE Number: 1306001
zbMATH Keywords: Newton iteration
zbMATH Keywords: matrix polar decomposition
zbMATH Keywords: full-rank rectangular matrices
author: A. A. Dubrulle
MaRDI profile type: Publication
published in: ETNA - Electronic Transactions on Numerical Analysis
description: scientific article; zbMATH DE number 1306001