Rational minimax approximation via adaptive barycentric representations
Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation - precisely the case where rational functions outperform polynomials by a landslide. We show that far more robust algorithms than previously available can be develo...
Главные авторы: | Filip, S, Nakatsukasa, Y, Trefethen, L, Beckermann, B |
---|---|
Формат: | Journal article |
Опубликовано: |
Society for Industrial and Applied Mathematics
2018
|
Схожие документы
-
An algorithm for real and complex rational minimax approximation
по: Nakatsukasa, Y, и др.
Опубликовано: (2020) -
Rational approximation of $x^n$
по: Nakatsukasa, Y, и др.
Опубликовано: (2018) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
по: Pachon, R, и др.
Опубликовано: (2009) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
по: Pachon, R, и др.
Опубликовано: (2008) -
The AAA algorithm for rational approximation
по: Nakatsukasa, Y, и др.
Опубликовано: (2018)