Rational minimax approximation via adaptive barycentric representations
From MaRDI portal
Publication:4580291
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) a "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 on in standard 16-digit floating point arithmetic, a problem for which Varga, Ruttan, and Carpenter required 200-digit extended precision.
Recommendations
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- An algorithm for real and complex rational minimax approximation
- An algorithm for best rational approximation based on barycentric rational interpolation
- scientific article; zbMATH DE number 2065333
- The AAA algorithm for rational approximation
Cites work
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 4071579 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- scientific article; zbMATH DE number 46496 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3013686 (Why is no real title available?)
- scientific article; zbMATH DE number 3014451 (Why is no real title available?)
- scientific article; zbMATH DE number 2204733 (Why is no real title available?)
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
- A framework for the solution of the generalized realization problem
- A robust implementation of the Carathéodory-Fejér method for rational approximation
- Accuracy and Stability of Numerical Algorithms
- Algorithm 715: SPECFUN–a portable FORTRAN package of special function routines and test drivers
- An Algorithm for General Restricted Rational Chebyshev Approximation
- Approximation theory and approximation practice
- BEST UNIFORM RATIONAL APPROXIMATION OF $ \vert x\vert$ ON $ \lbrack-1,\,1\rbrack$
- Barycentric Lagrange Interpolation
- Barycentric rational interpolation with no poles and high rates of approximation
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- Best rational approximation of functions with logarithmic singularities
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Computing near-best fixed pole rational interpolants
- Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen
- Further Remarks on the Differential Correction Algorithm
- How bad are Vandermonde matrices?
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Matrices for the direct determination of the barycentric weights of rational interpolation
- NUMERICAL RESULTS ON BEST UNIFORM RATIONAL APPROXIMATION OF $ \vert x\vert$ ON $ \lbrack-1,\,+1\rbrack$
- Newton interpolation at Leja points
- On the singular values of matrices with displacement structure
- Padé-type rational and barycentric interpolation
- Piecewise-smooth chebfuns
- Rate of Convergence of Lawson's Algorithm
- Rational Function Approximation As a Well-Conditioned Matrix Eigenvalue Problem
- Rational approximation to \(|x|\)
- Rational functions for guaranteed and experimentally well-conditioned global interpolation
- Some New Aspects of Rational Interpolation
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- The AAA algorithm for rational approximation
- The Carathéodory–Fejér Method for Real Rational Approximation
- The Construction of Minimax Rational Approximations to Functions
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- The FUNPACK Package of Special Function Subroutines
- The RKFIT algorithm for nonlinear rational approximation
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- The numerical stability of barycentric Lagrange interpolation
- Tschebyscheff-Approximation im Bereich der rationalen Funktionen bei Vorliegen einer guten Ausgangsnäherung
- Two new algorithms for rational approximation
Cited in
(37)- Exponential asymptotics of woodpile chain nanoptera using numerical analytic continuation
- scientific article; zbMATH DE number 2152731 (Why is no real title available?)
- The AAA algorithm for rational approximation
- A Lagrange interpolation with preprocessing to nearly eliminate oscillations
- Chebyshev approximation by a rational expression for functions of many variables
- A Newton method for best uniform rational approximation
- On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices
- Iterative Stability Enforcement in Adaptive Antoulas–Anderson Algorithms for \({\boldsymbol{\mathcal{H}_2}}\) Model Reduction
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
- A comprehensive study of the mathematical methods used to approximate the inverse Langevin function
- Barycentric formulae for some optimal rational approximants involving Blaschke products
- Data-driven algorithms for signal processing with trigonometric rational functions
- Extended barycentric rational schemes for functions of singularities
- Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
- The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
- scientific article; zbMATH DE number 2065333 (Why is no real title available?)
- Reducing the truncation error in Taylor model multiplication
- Spectacularly large expansion coefficients in Müntz's theorem
- Generalised rational approximation and its application to improve deep learning classifiers
- Pseudospectra of Loewner matrix pencils
- Numerical evaluation of Mittag-Leffler functions
- The p-AAA Algorithm for Data-Driven Modeling of Parametric Dynamical Systems
- Numerical analysis of the blow-up of one-dimensional polymer fluid flow with a front
- An algorithm for best rational approximation based on barycentric rational interpolation
- On rational Krylov and reduced basis methods for fractional diffusion
- Unitarity of some barycentric rational approximants
- Determination of electronic resonances by analytic continuation using barycentric formula
- A robust implementation of the Carathéodory-Fejér method for rational approximation
- An algorithm for real and complex rational minimax approximation
- AAA Rational Approximation on a Continuum
- 6 The Loewner framework for system identification and reduction
- Numerical continued fraction interpolation
- Practical algorithms for multivariate rational approximation
- Exponential node clustering at singularities for rational approximation, quadrature, and PDEs
- Rational approximation of 𝐱ⁿ
- A Newton's method for best uniform polynomial approximation
- Exact reconstruction of sparse non-harmonic signals from their Fourier coefficients
This page was built for publication: Rational minimax approximation via adaptive barycentric representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580291)
