Computing the Polar Decomposition—with Applications
From MaRDI portal
Publication:3746789
DOI10.1137/0907079zbMath0607.65014WikidataQ55924131 ScholiaQ55924131MaRDI QIDQ3746789
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907079
convergence acceleration; matrix square root; Newton method; polar decomposition; factor analysis; aerospace computations
15A23: Factorization of matrices
Related Items
On optimal symmetric orthogonalisation and square roots of a normal matrix, Time-stepping and preserving orthonormality, Relative perturbation bounds for the unitary polar factor, A perturbation bound for the generalized polar decomposition, A note on the perturbation bound of \(Q\)-factors, Variations for the \(Q\)- and \(H\)-factors in the polar decomposition, Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic, Perturbation bounds on the polar decomposition, On the perturbation bound in unitarily invariant norms for subunitary polar factors, On tridiagonal matrices unitarily equivalent to normal matrices, Relative perturbation bounds for weighted polar decomposition, On the QR decomposition of \({\mathcal {H}}\)-matrices, Perturbation analysis for best approximation and the polar factor by subunitary matrices, Solving the algebraic Riccati equation with the matrix sign function, The symmetric Procrustes problem, Computing a nearest symmetric positive semidefinite matrix, Approximation by matrices positive semidefinite on a subspace, Perturbation analysis of the orthogonal Procrustes problem, Matrix factorizations and their perturbations, On condition numbers and algorithms for determining a rigid body movement, The matrix sign decomposition and its relation to the polar decomposition, Structured matrices and Newton's iteration: unified approach, Computing the square root and logarithm of a real \(P\)-orthogonal matrix, Least-squares inner product shaping, The iterative methods for computing the polar decomposition of rank-deficient matrix, A note on backward perturbations for the Hermitian eigenvalue problem, Combined perturbation bounds. II: Polar decompositions, Approximation of matrices and a family of Gander methods for polar decomposition, Solving stable Sylvester equations via rational iterative schemes, Some new perturbation bounds for subunitary polar factors, Convergence analysis of the block Householder diagonalization algorithm, Low rank solution of data‐sparse Sylvester equations
