Journal article
Rational minimax approximation via adaptive barycentric representations
- Abstract:
-
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 developed by making use of rational barycentric representations whose support points are chosen in an adaptive fashion as the approximant is computed. Three variants of this barycentric strategy are all ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Funding
+ European Research Council
More from this funder
Funding agency for:
Trefethen, L
Grant:
FP7/2007–2013/ERC-291068
Bibliographic Details
- Publisher:
- Society for Industrial and Applied Mathematics Publisher's website
- Journal:
- SIAM Journal on Scientific Computing Journal website
- Volume:
- 40
- Issue:
- 4
- Pages:
- A2427–A2455
- Publication date:
- 2018-08-07
- Acceptance date:
- 2018-05-14
- DOI:
- EISSN:
-
1095-7197
- ISSN:
-
1064-8275
Item Description
- Keywords:
- Pubs id:
-
pubs:698374
- UUID:
-
uuid:a7cc7d2a-b2c7-4dbc-a10c-4583a5f0bda3
- Local pid:
- pubs:698374
- Source identifiers:
-
698374
- Deposit date:
- 2018-05-15
Terms of use
- Copyright holder:
- Society for Industrial and Applied Mathematics
- Copyright date:
- 2018
- Notes:
-
Copyright © 2018, Society for Industrial and Applied Mathematics.
This is the accepted manuscript version of the article. The final version is available online from SIAM at: https://doi.org/10.1137/17M1132409
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record