Estimates for the asymptotic convergence factor of two intervals
From MaRDI portal
Publication:645678
DOI10.1016/j.cam.2010.06.008zbMath1231.41012arXiv1306.5866OpenAlexW2156237959MaRDI QIDQ645678
Publication date: 10 November 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5866
inequalityJacobian elliptic functionsestimated asymptotic convergence factorJacobian theta functions
Iterative numerical methods for linear systems (65F10) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation with constraints (41A29) Elliptic functions and integrals (33E05)
Related Items
An upper bound for the norm of the Chebyshev polynomial on two intervals, The growth of polynomials outside of a compact set-the Bernstein-Walsh inequality revisited, Fast and accurate computation of the logarithmic capacity of compact sets, Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation, A lower bound for the norm of the minimal residual polynomial, A General Lower Bound for the Asymptotic Convergence Factor, Properties and examples of Faber-Walsh polynomials
Cites Work
- Two-sided bounds for the logarithmic capacity of multiple intervals
- Description of inverse polynomial images which consist of two Jordan arc with the help of Jacobi's elliptic functions
- A lower bound for the norm of the minimal residual polynomial
- Chebyshev polynomials for disjoint compact sets
- Extremal configurations of certain problems on the capacity and harmonic measure
- Some new properties of Jacobi's theta functions
- On an extremal configuration for capacity
- A lower bound for the minimum deviation of the Chebyshev polynomial on a compact real set
- The Degenerating Behavior of Elliptic Functions
- On Hybrid Semi-Iterative Methods
- From Potential Theory to Matrix Iterations in Six Steps
- An upper bound for the logarithmic capacity of two intervals
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item