Journal article icon

Journal article

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

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...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1007/s10543-009-0240-1

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
Journal:
BIT NUMERICAL MATHEMATICS
Volume:
49
Issue:
4
Pages:
721-741
Publication date:
2009-12-01
DOI:
EISSN:
1572-9125
ISSN:
0006-3835
Source identifiers:
187878
Language:
English
Keywords:
Pubs id:
pubs:187878
UUID:
uuid:12a8751d-091d-4e87-8772-173661b39bc6
Local pid:
pubs:187878
Deposit date:
2012-12-19

Terms of use


Views and Downloads






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

TO TOP