A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
From MaRDI portal
Publication:3624871
DOI10.1137/070699895zbMath1170.65019OpenAlexW2022846189WikidataQ56502612 ScholiaQ56502612MaRDI QIDQ3624871
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
Related Items (16)
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 rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices ⋮ 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 ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ Ralph Byers 1955--2007 ⋮ The minimization of matrix logarithms: on a fundamental property of the unitary polar factor ⋮ A note on iterative refinement for seminormal equations ⋮ A novel iterative method for polar decomposition and matrix sign function ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ Convolutional proximal neural networks and plug-and-play algorithms ⋮ Several numerical methods for computing unitary polar factor of a matrix ⋮ Rational minimax iterations for computing the matrix \(p\)th root ⋮ Zolotarev Iterations for the Matrix Square Root
This page was built for publication: A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
