Computing Complex Polynomial Chebyshev Approximants on the Unit Circle by the Real Remez Algorithm

Bailly, B. Le; Thiran, J. P.

doi:10.1137/s0036142998339519

Cited by 1 publication

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have been used, for example, for Chebyshev curve fitting with n > 20. More recently, Le Bailly and Thiran [25] reported the computation of best approximants of degrees up to 64 as a step to obtaining best approximants on the unit circle in the complex plane. And higher degree approximations have been computed for particular kinds of functions.…”

Section: Numerical Experimentsmentioning

confidence: 99%

Barycentric-Remez algorithms for best polynomial approximation in the chebfun system

Pachon

Trefethen

2009

Bit Numer Math

View full text Add to dashboard Cite

The Remez algorithm, 75 years old, is a famous method for computing minimax polynomial approximations. Most implementations of this algorithm date to an era when tractable degrees were in the dozens, whereas today, degrees of hundreds or thousands are not a problem. We present a 21st-century update of the Remez ideas in the context of the chebfun software system, which carries out numerical computing with functions rather than numbers. A crucial feature of the new method is its use of chebfun global rootfinding to locate extrema at each iterative step, based on a recursive algorithm combining ideas of Specht, Good, Boyd, and Battles. Another important feature is the use of the barycentric interpolation formula to represent the trial polynomials, which points the way to generalizations for rational approximations. We comment on available software for minimax approximation and its scientific context, arguing that its greatest importance these days is probably for fundamental studies rather than applications.

show abstract

Section: Numerical Experimentsmentioning

confidence: 99%