Pith. sign in

REVIEW 1 cited by

The first five years of the AAA algorithm

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.03565 v1 pith:D3WQ6PMI submitted 2023-12-06 math.NA cs.NA

Yuji Nakatsukasa , Olivier Sete , Lloyd N. Trefethen This is my paper · ORCID
classification math.NAcs.NA
keywords algorithmbeenproblemsalgorithmsappearanceapplicationsapproximationsbest
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The AAA algorithm, introduced in 2018, computes best or near-best rational approximations to functions or data on subsets of the real line or the complex plane. It is much faster and more robust than previous algorithms for such problems and has been used in many applications since its appearance, including the numerical solution of Laplace, Poisson, and biharmonic PDE problems in irregular domains. AAA has also been extended in new directions and seems likely to be a tool of lasting importance in the future.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rational Minimax Approximations for Matrix-Valued Functions: Existence, Optimality and Algorithms

    math.OC 2026-06 conditional novelty 6.0 of 10

    Matrix-valued rational minimax approximants with a common denominator are proved to exist on dense point sets, with Kolmogorov/Ruttan optimality certificates and an equivalence to the m-d-Lawson dual conditions.

Pith tools