24 May 2018
SIAM Journal on Scientific Computing
We introduce a new algorithm for approximation by rational functions on a real interval or a set in the complex plane, implementable in 40 lines of Matlab. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation of the rational approximant in barycentric form with interpolation at certain support points, (2) greedy selection of the support points to avoid exponential instabilities, and (3) least-squares rather than interpolatory formulation of the overall problem. The name AAA stands for "aggressive Antoulas--Anderson" in honor of the authors who introduced a scheme based on (1). We present the core algorithm with a Matlab code and eight applications and describe variants targeted at problems of different kinds.
Submitted to ORA: