The AAA algorithm for rational approximation
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...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Society for Industrial and Applied Mathematics
2018
|
| _version_ | 1797062834830442496 |
|---|---|
| author | Nakatsukasa, Y Sète, O Trefethen, L |
| author_facet | Nakatsukasa, Y Sète, O Trefethen, L |
| author_sort | Nakatsukasa, Y |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T20:51:16Z |
| format | Journal article |
| id | oxford-uuid:37a9158d-059d-4377-b754-660d3b3672cb |
| institution | University of Oxford |
| last_indexed | 2024-03-06T20:51:16Z |
| publishDate | 2018 |
| publisher | Society for Industrial and Applied Mathematics |
| record_format | dspace |
| spelling | oxford-uuid:37a9158d-059d-4377-b754-660d3b3672cb2022-03-26T13:45:18ZThe AAA algorithm for rational approximationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:37a9158d-059d-4377-b754-660d3b3672cbSymplectic Elements at OxfordSociety for Industrial and Applied Mathematics2018Nakatsukasa, YSète, OTrefethen, LWe 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. |
| spellingShingle | Nakatsukasa, Y Sète, O Trefethen, L The AAA algorithm for rational approximation |
| title | The AAA algorithm for rational approximation |
| title_full | The AAA algorithm for rational approximation |
| title_fullStr | The AAA algorithm for rational approximation |
| title_full_unstemmed | The AAA algorithm for rational approximation |
| title_short | The AAA algorithm for rational approximation |
| title_sort | aaa algorithm for rational approximation |
| work_keys_str_mv | AT nakatsukasay theaaaalgorithmforrationalapproximation AT seteo theaaaalgorithmforrationalapproximation AT trefethenl theaaaalgorithmforrationalapproximation AT nakatsukasay aaaalgorithmforrationalapproximation AT seteo aaaalgorithmforrationalapproximation AT trefethenl aaaalgorithmforrationalapproximation |