Zolotarev iterations for the Matrix square Root
DOI10.1137/18M1178529zbMATH Open1420.65057arXiv1804.11000OpenAlexW2963228395WikidataQ127781427 ScholiaQ127781427MaRDI QIDQ5232113FDOQ5232113
Authors: Evan S. Gawlik
Publication date: 29 August 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11000
Recommendations
minimaxNewton iterationrational approximationmatrix square rootChebyshev approximationmatrix iterationZolotarevDenman-Beavers iterationpadé approximation
Optimality conditions for minimax problems (49K35) Approximation by rational functions (41A20) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The ADI model problem
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stable iterations for the matrix square root
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- Optimal rational functions for the generalized Zolotarev problem in the complex plane
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- The matrix sign function and computations in systems
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
- Fast computation of spectral projectors of banded matrices
- The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
- A note on computing the matrix square root
- Newton's Method for the Matrix Square Root
- Title not available (Why is that?)
- On Convergence and Degeneracy in Rational Padé and Chebyshev Approximation
- Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
- On the singular values of matrices with displacement structure
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Betrachtungen zur Quadratwurzeliteration
- A backward stable algorithm for computing the CS decomposition via the polar decomposition
Cited In (5)
- Iterative methods for computing the matrix square root
- Scaled fixed point algorithm for computing the matrix square root
- Rational minimax iterations for computing the matrix \(p\)th root
- Approximating the \(p\)th root by composite rational functions
- Multivariate rational approximation of functions with curves of singularities
Uses Software
This page was built for publication: Zolotarev iterations for the Matrix square Root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232113)