Extremal polynomials on the n-grid

DOI10.1016/J.JAT.2023.105875MaRDI QIDQ6422549arXivFDO

Authors Arno B. J. Kuijlaars

Publication date 4 January 2023

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JAT.2023.105875

Mathematics Subject Classification ID

Numerical interpolation (65D05) Algorithms for approximation of functions (65D15) Approximation by rational functions (41A20)

arXiv classification

cs.NAmath.NAmath.CA

Abstract: The $n$-grid $E_n$ consists of $n$ equally spaced points in $[-1,1]$ including the endpoints $pm1$. The extremal polynomial $p_n^{\ast }$ is the polynomial that maximizes the uniform norm $|p{|}_{[-1,1]}$ among polynomials $p$ of degree $leqalphan$ that are bounded by one on $E_n$. For every $alphain(0,1)$, we determine the limit of $frac1nlog|p_n^{\ast }{|}_{[-1,1]}$ as $noinfty$. The interest in this limit comes from a connection with an impossibility theorem on stable approximation on the $n$-grid.

This page was built for publication: Extremal polynomials on the $n$-grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6422549)