Near-Minimax Polynomial Approximation in an Elliptical Region

DOI10.1137/0715083zbMath0413.65024OpenAlexW2009447806MaRDI QIDQ3048143

Keith O. Geddes

Publication date: 1978

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0715083

zbMATH Keywords

fast Fourier transformnumerical stabilitycomplex planeelliptical regionminimax polynomial approximationtruncated Chebyshev series

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Algorithms for approximation of functions (65D15) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58)

Related Items (9)

Polynomial approximations in the complex plane ⋮ Near-best \(L_1\) approximations on circular and elliptical contours ⋮ Wavelets on graphs via spectral graph theory ⋮ In honour of Keith Geddes on his 60th birthday ⋮ THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES ⋮ A Formberg-like conformal mapping method for slender regions ⋮ Near-minimax complex approximation by four kinds of Chebyshev polynomial expansion ⋮ Extended best \(L^p\)-approximation is near-best approximation in \(L^q, p - 1 \leq q < p\) ⋮ Accelerated polynomial approximation of finite order entire functions by growth reduction

Uses Software

• Algorithm 413

This page was built for publication: Near-Minimax Polynomial Approximation in an Elliptical Region