Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
From MaRDI portal
Recommendations
- An optimum iteration for the matrix polar decomposition
- A class of iterative methods for computing polar decomposition
- Fast Polar Decomposition of an Arbitrary Matrix
- A parallel algorithm for computing the polar decomposition
- Efficient Computation of the Matrix Exponential by Generalized Polar Decompositions
- Stable and efficient computation of generalized polar decompositions
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Algorithms for the Polar Decomposition
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Computing the Polar Decomposition—with Applications
Cited in
(24)- On Grioli's minimum property and its relation to Cauchy's polar decomposition
- High performance polar decomposition on distributed memory systems
- A novel iterative method for polar decomposition and matrix sign function
- A unified framework for harmonic analysis of functions on directed graphs and changing data
- Several numerical methods for computing unitary polar factor of a matrix
- Monotonically convergent algorithms for symmetric tensor approximation
- Rational minimax iterations for computing the matrix pth root
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- The minimization of matrix logarithms: on a fundamental property of the unitary polar factor
- Efficient homomorphic comparison methods with optimal complexity
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Backward stability of iterations for computing the polar decomposition
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- On the matrix square root via geometric optimization
- An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
- Stable and efficient computation of generalized polar decompositions
- A high performance QDWH-SVD solver using hardware accelerators
- Fast computation of spectral projectors of banded matrices
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Fast and inverse-free algorithms for deflating subspaces
- Finding the geometric mean for two Hermitian matrices by an efficient iteration method
- Halving the size of skew-symmetric eigenvalue problems via the polar decomposition
- Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming
This page was built for publication: Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079766)
