Rational minimax iterations for computing the matrix \(p\)th root
From MaRDI portal
Publication:2049603
DOI10.1007/s00365-020-09504-3OpenAlexW3024100276MaRDI QIDQ2049603
Publication date: 27 August 2021
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.06268
Padé approximationNewton iterationuniform approximationrational approximationmatrix rootmatrix powerChebyshev approximationminimax iteration
Approximation by rational functions (41A20) Optimality conditions for minimax problems (49K35) Numerical computation of matrix exponential and similar matrix functions (65F60) Numerical methods for matrix equations (65F45)
Related Items (2)
Dressing for generalised linear Hamiltonian systems depending rationally on the spectral parameter and some applications ⋮ Approximating the \(p\)th root by composite rational functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root
- Iteration functions for \(p\)th roots of complex numbers
- On Newton's method and Halley's method for the principal \(p\)th root of a matrix
- A faster, more stable method for comuting the pth roots of positive definite matrices
- Representation of conformal maps by rational functions
- Best uniform rational approximation of \(x^ \alpha\) on \([0,1\).]
- Approximating the \(p\)th root by composite rational functions
- Tschebyscheff-Approximationen in kleinen Intervallen. I; II: Stetigkeitssätze für gebrochen rationale Approximationen
- Algorithms for the matrix \(p\)th root
- An Improved Schur--Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives
- A Padé family of iterations for the matrix sector function and the matrix p th root
- The Carathéodory–Fejér Method for Real Rational Approximation
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- A Schur–Padé Algorithm for Fractional Powers of a Matrix
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- On the Newton Method for the Matrix Pth Root
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
- On Convergence and Degeneracy in Rational Padé and Chebyshev Approximation
- Optimal Partitioning of Newton's Method for Calculating Roots
- A Schur Algorithm for Computing Matrix pth Roots
- A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
- A Padé family of iterations for the matrix sign function and related problems
- Zolotarev Iterations for the Matrix Square Root
- A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
- Functions of Matrices
- Improved Newton Iteration for Integral Roots
This page was built for publication: Rational minimax iterations for computing the matrix \(p\)th root
