EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Fast computation of best approximation polynomials for the reciprocal function

Gerlind Plonka, Manfred Tasche

Numerical Algorithms · 20.04.2026

DOI: 10.1007/s11075-026-02364-1 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 20.04.2026. Verfasst von Gerlind Plonka und 1 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Union’s Horizon 2020 research and innovation programme.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we study best approximation polynomials $$p_m^{(\text {abs})}$$ and $$p_m^{(\text {rel})}$$ for the reciprocal function $$f(x) = \frac{1}{x}$$ defined on $$[a,\,b] \subset (0,\,\infty )$$ . Here the best approximation polynomials of degree m for f minimize the uniform absolute and relative error between p and f , respectively, over all polynomials p of degree at most m . We provide representations of the best approximation polynomials in the basis of shifted Chebyshev polynomials. Furthermore, we derive recursion formulas that compute best approximation polynomials of degree $$2m-1$$ from corresponding polynomials of degree $$m-1$$ , where the close relationship between these polynomials is exploited. Both, the Chebyshev basis representations and the dyadic recursion formulas are shown to lead to fast and numerically stable algorithms for the evaluation of $$p_m^{(\text {abs})}$$ and $$p_m^{(\text {rel})}$$ on fine grids. Numerical experiments illustrate these results.

Förderung

  • European Union’s Horizon 2020 research and innovation programme

Zitieren

APA

Plonka, G., & Tasche, M. (2026). Fast computation of best approximation polynomials for the reciprocal function. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02364-1

Vancouver

Plonka G, Tasche M. Fast computation of best approximation polynomials for the reciprocal function. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02364-1

BibTeX
@article{Plonka2026,
  author = {Plonka, Gerlind and Tasche, Manfred},
  title = {Fast computation of best approximation polynomials for the reciprocal function},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02364-1}
}
Kostenlos starten →