Exponential node clustering at singularities for rational approximation, quadrature, and PDEs
Rational approximations of functions with singularities can converge at a root-exponential rate if the poles are exponentially clustered. We begin by reviewing this effect in minimax, least-squares, and AAA approximations on intervals and complex domains, conformal mapping, and the numerical solutio...
Main Authors: | Trefethen, LN, Nakatsukasa, Y, Weideman, JAC |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Springer
2021
|
Similar Items
-
Talbot quadratures and rational approximations
by: Trefethen, L, et al.
Published: (2005) -
An algorithm for real and complex rational minimax approximation
by: Nakatsukasa, Y, et al.
Published: (2020) -
AAA rational approximation on a continuum
by: Driscoll, T, et al.
Published: (2024) -
Rational approximation of $x^n$
by: Nakatsukasa, Y, et al.
Published: (2018) -
The AAA algorithm for rational approximation
by: Nakatsukasa, Y, et al.
Published: (2018)