Zolotarev iterations for the Matrix square Root
From MaRDI portal
Publication:5232113
Abstract: We construct a family of iterations for computing the principal square root of a square matrix using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing one to iteratively generate optimal rational approximants of of high degree using compositions and products of low-degree rational functions. The corresponding iterations for the matrix square root converge to for any input matrix having no nonpositive real eigenvalues. In special limiting cases, these iterations reduce to known iterations for the matrix square root: the lowest-order version is an optimally scaled Newton iteration, and for certain parameter choices, the principal family of Pad'e iterations is recovered. Theoretical results and numerical experiments indicate that the iterations perform especially well on matrices having eigenvalues with widely varying magnitudes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3120956 (Why is no real title available?)
- scientific article; zbMATH DE number 3927548 (Why is no real title available?)
- scientific article; zbMATH DE number 4071579 (Why is no real title available?)
- scientific article; zbMATH DE number 46496 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- A backward stable algorithm for computing the CS decomposition via the polar decomposition
- A note on computing the matrix square root
- Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
- Betrachtungen zur Quadratwurzeliteration
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Fast computation of spectral projectors of banded matrices
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- Functions of Matrices
- Newton's Method for the Matrix Square Root
- On Convergence and Degeneracy in Rational Padé and Chebyshev Approximation
- On the singular values of matrices with displacement structure
- Optimal rational functions for the generalized Zolotarev problem in the complex plane
- Stable iterations for the matrix square root
- The ADI model problem
- The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues
- The matrix sign function and computations in systems
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
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
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)