Generalized Faber polynomials and an optimal error recovery algorithm
From MaRDI portal
Publication:1079760
DOI10.1007/BF01893419zbMath0598.41025MaRDI QIDQ1079760
Publication date: 1986
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01893419
41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
41A50: Best approximation, Chebyshev systems
65E05: General theory of numerical methods in complex analysis (potential theory, etc.)
40A25: Approximation to limiting values (summation of series, etc.)
65B10: Numerical summation of series
41A45: Approximation by arbitrary linear expressions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On two methods for accelerating convergence of series
- Placement of cuts in Padé-like approximation
- Truncation error bounds for g-fractions
- Extremal polynomials associated with a system of curves in the complex plane
- The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions
- Best Approximation of Positive Power Series
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
