Best rational approximations are notoriously difficult to compute. However, the difference between the best rational approximation to a function and its Carathéodory-Fejér (CF) approximation is often so small as to be negligible in practice, while CF approximations are far easier to compute. We present a robust and fast implementation of this method in the Chebfun software system and illustrate its use with several examples. Our implementation handles both polynomial and rational approximation and substantially improves upon earlier published software. © 2011 Springer Science + Business Media B.V
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
We introduce a new algorithm for approximation by rational functions on a real interval or a set in ...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
ever, the difference between the best rational approximation to a function and its Carathéodory-Fejé...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
AbstractA systematic description of the Carathéodory-Fejér method (CF method) is given for near-best...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
We introduce a new algorithm for approximation by rational functions on a real interval or a set in ...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
ever, the difference between the best rational approximation to a function and its Carathéodory-Fejé...
Best rational approximations are notoriously difficult to compute. However, the difference between t...
AbstractA systematic description of the Carathéodory-Fejér method (CF method) is given for near-best...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
We introduce a new algorithm for approximation by rational functions on a real interval or a set in ...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...