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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.