Generalized Faber polynomials and an optimal error recovery algorithm

DOI10.1007/BF01893419zbMath0598.41025OpenAlexW2024040685MaRDI QIDQ1079760

G. M. Trojan

Publication date: 1986

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01893419

zbMATH Keywords

algorithmanalytic functionsTaylor coefficientsmoment sequences

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Best approximation, Chebyshev systems (41A50) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Approximation to limiting values (summation of series, etc.) (40A25) Numerical summation of series (65B10) Approximation by arbitrary linear expressions (41A45)

Related Items (1)

The generalized faber operator and the convergence of generalized faber expansions

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

This page was built for publication: Generalized Faber polynomials and an optimal error recovery algorithm