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
|
類似資料
Barycentric Rational Collocation Method for Burgers’ Equation
著者:: Qingli Zhao, 等
出版事項: (2022-01-01)
著者:: Qingli Zhao, 等
出版事項: (2022-01-01)
類似資料
-
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)