Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups

DOI10.1137/S0895479803426644MaRDI QIDQ4650979zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas J. Higham, D. Steven Mackey, Niloufer Mackey, Françoise Tisseur

Publication date 21 February 2005

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

Full work available at URL https://doi.org/10.1137/s0895479803426644

zbMATH Keywords

convergencepolar decompositionNewton iterationsymplectic matrixsesquilinear formstructure preservationmatrix iterationmatrix sign decompositionperplectic matrixpseudo-orthogonal matrixcomplex orthogonal matrix, automorphism group, bilinear form

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
• On a fourth-order matrix method for computing polar decomposition
• A novel iterative method for polar decomposition and matrix sign function
• Computing the Polar Decomposition—with Applications
• scientific article; zbMATH DE number 962110

Cited in

(28)

• Globally convergent iterative scheme for computing matrix sign function with numerical stability
• Halving the size of skew-symmetric eigenvalue problems via the polar decomposition
• The matrix sign decomposition and its relation to the polar decomposition
• Localization in matrix computations: theory and applications
• Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
• The iterative methods for computing the polar decomposition of rank-deficient matrix
• Procrustes problems in finite dimensional indefinite scalar product spaces
• Algorithms for the Polar Decomposition in Certain Groups and the Quaternion Tensor Square
• \(m\) th roots of \(H\)-selfadjoint matrices
• Numerically stable iterative methods for computing matrix sign function
• On a fourth-order matrix method for computing polar decomposition
• Perturbation analysis for best approximation and the polar factor by subunitary matrices
• Approximation of matrices and a family of Gander methods for polar decomposition
• A new polar decomposition in a scalar product space
• Factorizations into normal matrices in indefinite inner product spaces
• Smooth singular value decomposition on the symplectic group and Lyapunov exponents approximation
• New iterative methods for finding matrix sign function: derivation and application
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• A new iterative method to find polar decomposition
• A Padé family of iterations for the matrix sector function and the matrix pth root
• A Padé family of iterations for the matrix sign function and related problems.
• Monotonically convergent algorithms for symmetric tensor approximation
• A structure-preserving \(QR\) factorization for centrosymmetric real matrices
• A third-order Newton-type method for finding polar decomposition
• Several observations on symplectic, Hamiltonian, and skew-Hamiltonian matrices
• Recurrence relations and convergence theory of the generalized polar decomposition on Lie groups
• Computing matrix group decompositions with respect to a normal subgroup
• On iterative algorithms for the polar decomposition of a matrix and the matrix sign function

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups

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