BIT Numerical Mathematics

, 49:721

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

Article

DOI: 10.1007/s10543-009-0240-1

Cite this article as:
Pachón, R. & Trefethen, L.N. Bit Numer Math (2009) 49: 721. doi:10.1007/s10543-009-0240-1

Abstract

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.

Keywords

Remez algorithmBest polynomial approximationBarycentric interpolationChebfun system

Mathematics Subject Classification (2000)

41A5041A1065D05

Copyright information

© Springer Science + Business Media B.V. 2009

Authors and Affiliations

  1. 1.Computing LaboratoryUniversity of OxfordOxfordUK