Algorithms for the Polar Decomposition
From MaRDI portal
Publication:3210046
DOI10.1137/0911062zbMATH Open0722.65021OpenAlexW2079562210MaRDI QIDQ3210046FDOQ3210046
Authors: W. Gander 
Publication date: 1990
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/68862
Recommendations
- scientific article; zbMATH DE number 962110
- Computing the Polar Decomposition—with Applications
- A parallel algorithm for computing the polar decomposition
- Algebraic Polar Decomposition
- A class of iterative methods for computing polar decomposition
- A note on computing the polar decomposition
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- New numerical methods for computing the polar decomposition
- Decomposition Algorithms for Tensors and Polynomials
Parallel numerical computation (65Y05) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cited In (21)
- A novel iterative method for polar decomposition and matrix sign function
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Algorithms for the Polar Decomposition in Certain Groups and the Quaternion Tensor Square
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Several numerical methods for computing unitary polar factor of a matrix
- Note on ``A new scaling for Newton's iteration for the polar decomposition and its backward stability by R. Byers and H. Xu
- On a fourth-order matrix method for computing polar decomposition
- Polar decomposition, Aluthge and mean transforms
- Pyramidal Algorithms for Littlewood-Paley Decompositions
- Approximation of matrices and a family of Gander methods for polar decomposition
- On sign function of tensors with Einstein product and its application in solving Yang-Baxter tensor equation
- A parallel algorithm for computing the polar decomposition
- Fast Polar Decomposition of an Arbitrary Matrix
- A class of iterative methods for computing polar decomposition
- A third-order Newton-type method for finding polar decomposition
- On polar decomposition of tensors with Einstein product and a novel iterative parametric method
- A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix
- Computing the Polar Decomposition—with Applications
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Rectangular and polar representations of a complex matrix
- The perturbation of the iterative methods for computing the polar decomposition of rank-deficient matrix
This page was built for publication: Algorithms for the Polar Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210046)
