Approximating the \(p\)th root by composite rational functions
From MaRDI portal
Publication:2029808
DOI10.1016/j.jat.2021.105577zbMath1471.41006arXiv1906.11326OpenAlexW3139073236MaRDI QIDQ2029808
Evan S. Gawlik, Yuji Nakatsukasa
Publication date: 4 June 2021
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.11326
minimaxrational approximationsquare rootsign functionfunction composition\(p\)th rootsector functionzolotarev
Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best uniform rational approximation of \(x^ \alpha\) on \([0,1\).]
- Rational minimax iterations for computing the matrix \(p\)th root
- Betrachtungen zur Quadratwurzeliteration
- Rational functions admitting double decompositions
- When Is a Polynomial a Composition of Other Polynomials?
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Matrix sector functions and their applications to systems theory
- Optimal Partitioning of Newton's Method for Calculating Roots
- On the Singular Values of Matrices with Displacement Structure
- Zolotarev Iterations for the Matrix Square Root
- Functions of Matrices
- Best Rational Starting Approximations and Improved Newton Iteration for the Square Root
- Improved Newton Iteration for Integral Roots
This page was built for publication: Approximating the \(p\)th root by composite rational functions