A novel iterative method for polar decomposition and matrix sign function
From MaRDI portal
Summary: We define and investigate a globally convergent iterative method possessing sixth order of convergence which is intended to calculate the polar decomposition and the matrix sign function. Some analysis of stability and computational complexity are brought forward. The behaviors of the proposed algorithms are illustrated by numerical experiments.
Recommendations
- A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Algorithms for the Polar Decomposition
- On a fourth-order matrix method for computing polar decomposition
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
Cites work
- A family of Chebyshev-Halley type methods in Banach spaces
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- A fast convergent numerical method for matrix sign function with application in SDEs
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- Algorithms for the Polar Decomposition
- Approximating the matrix sign function using a novel iterative method
- Computing simple roots by an optimal sixteenth-order class
- Computing the Polar Decomposition—with Applications
- Functions of Matrices
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- On a fourth-order matrix method for computing polar decomposition
- On Halley's Iteration Method
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Rational Iterative Methods for the Matrix Sign Function
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- The matrix sign decomposition and its relation to the polar decomposition
Cited in
(16)- The matrix sign decomposition and its relation to the polar decomposition
- Approximating the matrix sign function using a novel iterative method
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Several numerical methods for computing unitary polar factor of a matrix
- On a fourth-order matrix method for computing polar decomposition
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Iterative computation of the Fréchet derivative of the polar decomposition
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
- Numerically stable improved Chebyshev-Halley type schemes for matrix sign function
- A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix
- A class of iterative methods for computing polar decomposition
- Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem
- On polar decomposition of tensors with Einstein product and a novel iterative parametric method
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- A new iterative method to find polar decomposition
- A globally convergent numerical method with fourth order for computing the matrix sign
This page was built for publication: A novel iterative method for polar decomposition and matrix sign function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723445)
