Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
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...
| Main Authors: | , |
|---|---|
| 格式: | Journal article |
| 语言: | English |
| 出版: |
2009
|