A parallel algorithm for computing the polar decomposition

DOI10.1016/0167-8191(94)90073-6zbMath0815.65061OpenAlexW2112033694WikidataQ56998965 ScholiaQ56998965MaRDI QIDQ1334536

Nicholas J. Higham, Pythagoras Papadimitriou

Publication date: 25 September 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90073-6

zbMATH Keywords

convergencesingular value decompositionparallel computationnumerical stabilityscalingpolar decompositionlevel 3 BLASmatrix inversionsKendall square research KSR1 computerLA-PACK

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Related Items

The matrix sign decomposition and its relation to the polar decomposition ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ Computing a logarithm of a unitary matrix with general spectrum ⋮ Monotonically convergent algorithms for symmetric tensor approximation ⋮ Formulation and implementation of stress-driven and/or strain-driven computational homogenization for finite strain ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ Time-stepping and preserving orthonormality ⋮ The iterative methods for computing the polar decomposition of rank-deficient matrix ⋮ Procrustes problems in finite dimensional indefinite scalar product spaces

Uses Software

• LAPACK