Generalized Faber polynomials and an optimal error recovery algorithm
From MaRDI portal
Approximation to limiting values (summation of series, etc.) (40A25) Approximation by arbitrary linear expressions (41A45) Best approximation, Chebyshev systems (41A50) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Numerical summation of series (65B10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)
Recommendations
Cites work
- Best Approximation of Positive Power Series
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- Extremal polynomials associated with a system of curves in the complex plane
- scientific article; zbMATH DE number 3601500 (Why is no real title available?)
- scientific article; zbMATH DE number 3263399 (Why is no real title available?)
- On two methods for accelerating convergence of series
- Placement of cuts in Padé-like approximation
- The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions
- Truncation error bounds for g-fractions
Cited in
(2)
This page was built for publication: Generalized Faber polynomials and an optimal error recovery algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079760)