A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability

DOI10.1137/070699895zbMATH Open1170.65019OpenAlexW2022846189WikidataQ56502612 ScholiaQ56502612MaRDI QIDQ3624871FDOQ3624871

Authors: Ralph Byers, Hongguo Xu 

Publication date: 30 April 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1808/17352

Recommendations

• Backward stability of iterations for computing the polar decomposition
• On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• An optimum iteration for the matrix polar decomposition
• Numerical behaviour of Higham's scaled method for polar decomposition

zbMATH Keywords

polar decompositionscalingsingular value decomposition (SVD)

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cited In (22)

• The minimization of matrix logarithms: on a fundamental property of the unitary polar factor
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
• A novel iterative method for polar decomposition and matrix sign function
• Several numerical methods for computing unitary polar factor of a matrix
• A note on iterative refinement for seminormal equations
• Note on ``A new scaling for Newton's iteration for the polar decomposition and its backward stability by R. Byers and H. Xu
• Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Zolotarev iterations for the Matrix square Root
• Rational minimax iterations for computing the matrix \(p\)th root
• Backward stability of iterations for computing the polar decomposition
• Numerical behaviour of Higham's scaled method for polar decomposition
• On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices
• Convolutional proximal neural networks and plug-and-play algorithms
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
• Ralph Byers 1955--2007
• Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
• On Grioli's minimum property and its relation to Cauchy's polar decomposition
• Stable and efficient computation of generalized polar decompositions
• On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
• Time-stepping and preserving orthonormality

This page was built for publication: A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624871)