On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
DOI10.1016/J.AMC.2015.08.004zbMATH Open1410.15028OpenAlexW1195028917MaRDI QIDQ670807FDOQ670807
Authors: Andrzej Kiełbasiński, Paweł Zieliński, Krystyna Ziȩtak
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.08.004
Recommendations
- A novel iterative method for polar decomposition and matrix sign function
- Algorithms for the Polar Decomposition
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- Computing the Polar Decomposition—with Applications
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
matrix sign functionnumerical matrix inversionpolar decomposition of a matrixscaled Newton methoddual Padé family of iterationsreciprocal Padé family of iterations
Cites Work
- Functions of Matrices
- Title not available (Why is that?)
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Title not available (Why is that?)
- Computing the Polar Decomposition—with Applications
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Title not available (Why is that?)
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- The minimization of matrix logarithms: on a fundamental property of the unitary polar factor
- A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms
- Stability of Methods for Matrix Inversion
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- Numerical behaviour of Higham's scaled method for polar decomposition
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Matrix sector functions and their applications to systems theory
- Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- A Padé family of iterations for the matrix sign function and related problems.
- Rational Iterative Methods for the Matrix Sign Function
- Algorithms for the matrix sector function
- On K nig's root-finding algorithms*
- The matrix sign decomposition and its relation to the polar decomposition
- Algorithms for the Polar Decomposition
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- The Padé iterations for the matrix sign function and their reciprocals are optimal
- Title not available (Why is that?)
- An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
- An optimum iteration for the matrix polar decomposition
- The dual Padé families of iterations for the matrix \(p\)th root and the matrix \(p\)-sector function
- Approximation of matrices and a family of Gander methods for polar decomposition
- Backward stability of iterations for computing the polar decomposition
- Note on ``A new scaling for Newton's iteration for the polar decomposition and its backward stability by R. Byers and H. Xu
- Title not available (Why is that?)
Cited In (9)
- The Padé iterations for the matrix sign function and their reciprocals are optimal
- A novel iterative method for polar decomposition and matrix sign function
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Several numerical methods for computing unitary polar factor of a matrix
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Backward stability of iterations for computing the polar decomposition
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
- On polar decomposition of tensors with Einstein product and a novel iterative parametric method
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
Uses Software
This page was built for publication: On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670807)