A parallel algorithm for computing the polar decomposition

DOI10.1016/0167-8191(94)90073-6MaRDI QIDQ1334536zbMATH OpenOpenAlexWikidataFDO

Authors 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 decompositionpolar decompositionnumerical stabilityparallel computationscalinglevel 3 BLASmatrix inversionsKendall square research KSR1 computerLA-PACK

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Recommendations

• Computing the Polar Decomposition—with Applications
• Algorithms for the Polar Decomposition
• Fast Polar Decomposition of an Arbitrary Matrix
• scientific article; zbMATH DE number 962110
• An optimum iteration for the matrix polar decomposition

Cited in

(17)

• Formulation and implementation of stress-driven and/or strain-driven computational homogenization for finite strain
• The matrix sign decomposition and its relation to the polar decomposition
• The iterative methods for computing the polar decomposition of rank-deficient matrix
• Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
• Procrustes problems in finite dimensional indefinite scalar product spaces
• The parallel orthogonal decomposition (POD) of a matrix
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Algorithms for the Polar Decomposition
• A backward stable algorithm for computing the CS decomposition via the polar decomposition
• Fast Polar Decomposition of an Arbitrary Matrix
• Computing a logarithm of a unitary matrix with general spectrum.
• A class of iterative methods for computing polar decomposition
• Monotonically convergent algorithms for symmetric tensor approximation
• High performance polar decomposition on distributed memory systems
• Computing the Polar Decomposition—with Applications
• A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
• Time-stepping and preserving orthonormality

Describes a project that uses

Uses Software

• LAPACK

This page was built for publication: A parallel algorithm for computing the polar decomposition

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