Backward Stability of Iterations for Computing the Polar Decomposition

DOI10.1137/110857544zbMath1252.65083OpenAlexW2128362857MaRDI QIDQ2910965

Nicholas J. Higham, Yuji Nakatsukasa

Publication date: 12 September 2012

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

Full work available at URL: http://eprints.maths.manchester.ac.uk/1784/1/41803_1_art_2_lzptd9_sc.pdf

zbMATH Keywords

algorithmerror boundNewton iterationpolar decompositionQR factorizationfloating point arithmeticsingular valuepivotingregion of convergencebackward stabilityinverse Newton iterationNewton-Schulz iteration, dynamically weighted Halley iteration

Mathematics Subject Classification ID

Related Items (11)

On Grioli's minimum property and its relation to Cauchy's polar decomposition ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ On the Matrix Square Root via Geometric Optimization ⋮ Stable and Efficient Computation of Generalized Polar Decompositions ⋮ A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices ⋮ Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time ⋮ The minimization of matrix logarithms: on a fundamental property of the unitary polar factor ⋮ Principal component projection with low-degree polynomials ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ The geometric mean of two matrices from a computational viewpoint ⋮ A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition

Uses Software

• mctoolbox

This page was built for publication: Backward Stability of Iterations for Computing the Polar Decomposition