Report icon

Report

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

Abstract:

Variants of the Remez algorithm for best polynomial approximation are presented based on two key features: the use of the barycentric interpolation formula to represent the trial polynomials, and the setting of the whole computation in the chebfun system, where the determination of local and global extrema at each iterative step becomes trivial. The new algorithms make it a routine matter to compute approximations of degrees in the hundreds, and as an example, we report approximation of |x| u...

Expand abstract

Actions


Access Document


Files:

Authors


Ricardo Pachόn More by this author
Nick Trefethen More by this author
Publisher:
Oxford University Computing Laboratory
Publication date:
2008-12-01
URN:
uuid:d9155ed3-481f-473b-b45f-1cdb35a8c6d8
Local pid:
cs:2859

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP