AAA-Lawson combines the AAA algorithm with a Lawson-style iteratively reweighted least-squares phase to compute near-minimax rational approximations on arbitrary complex domains, with working code in Chebfun.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An algorithm for real and complex rational minimax approximation
AAA-Lawson combines the AAA algorithm with a Lawson-style iteratively reweighted least-squares phase to compute near-minimax rational approximations on arbitrary complex domains, with working code in Chebfun.