Rational Minimax Approximation via Adaptive Barycentric Representations
Authors:
- Silviu-Ioan FilipSFSilviu-Ioan Filip
- Yuji NakatsukasaYNYuji Nakatsukasa
- Lloyd N. TrefethenLTLloyd N. Trefethen
- Bernhard BeckermannBBBernhard Beckermann
- 1 January 2018
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 40 (4) , A2427-A2455
Abstract
Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation---precisely the case where rational functions outperform polynomials by a landslide. We show that far more robust algorithms than previously available can be developed by making use of rational barycentric representations whose support points are chosen in an adaptive fashion as the approximant is computed. Three variants of this barycentric strategy are all shown to be powerful: (1) a classical Remez algorithm, (2) an “AAA-Lawson” method of iteratively reweighted least-squares, and (3) a differential correction algorithm. Our preferred combination, implemented in the Chebfun MINIMAX code, is to use (2) in an initial phase and then switch to (1) for generically quadratic convergence. By such methods we can calculate approximations up to type (80,80) of $|x|$ on $[-1,1]$ in standard 16-digit floating point arithmetic, a problem for which Varga, Ruttan, and Carpenter [Math....
Keywords
All Related Versions
Funding Information
- FP7 Ideas: European Research Council (291068)
- Japan Society for the Promotion of Science
- Université Lille 1 - Sciences et Technologies (ANR-11-LABEX-0007-01)
This publication has 48 references indexed in Scilit:
- The RKFIT Algorithm for Nonlinear Rational ApproximationSIAM Journal on Scientific Computing, 2017
- On the Singular Values of Matrices with Displacement StructureSIAM Journal on Matrix Analysis and Applications, 2017
- Padé–type rational and barycentric interpolationNumerische Mathematik, 2013
- Barycentric Lagrange InterpolationSIAM Review, 2004
- The condition number of real Vandermonde, Krylov and positive definite Hankel matricesNumerische Mathematik, 2000
- Matrices for the direct determination of the barycentric weights of rational interpolationJournal of Computational and Applied Mathematics, 1997
- Rational functions for guaranteed and experimentally well-conditioned global interpolationComputers & Mathematics with Applications, 1988
- Synthesis of spectrum shaping digital filters of recursive designIEEE Transactions on Circuits and Systems, 1975
- The Differential Correction Algorithm for Rational $\ell _\infty $-ApproximationSIAM Journal on Numerical Analysis, 1972
- Two new algorithms for rational approximationNumerische Mathematik, 1961