Answers are grounded in this paper and cite their sources.
Let ξ _ρ denote an ellipse with foci at ± 1 and sum of semi-axes ρ > 1, and let A(ξ _ρ )= denote the space of functions analytic in points interior to ξ _ρ and continuous onto the boundary. It is proved that the truncated Chebyshev series Cₙ f for f ∈ A(ξ _ρ ) is a near-minimax polynomial approximation within a relative factor γ ₙ, the nth Lebesgue constant. This extends a well-known result for truncated Chebyshev series on the real interval $[-1,1$. A new algorithm for computing Chebyshev coefficients is based on the fast Fourier transform (FFT) and thus inherits the efficiency and numerical stability of FFT algorithms.
No takes yet. Share an insight, caveat, or question.
K. O. Geddes (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: