|
This article is cited in 1 scientific paper (total in 1 paper)
Lower Bound for the Lebesgue Function of an Interpolation Process with Algebraic Polynomials on Equidistant Nodes of a Simplex
N. V. Baidakovaab a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
b Ural Federal University, Ekaterinburg
Abstract:
For an interpolation process with algebraic polynomials of degree $n$ on equidistant nodes of an $m$-simplex for $m\ge 2$, we obtain a pointwise lower bound for the Lebesgue function similar to the well-known estimate for interpolation on a closed interval.
Keywords:
interpolation process, equidistant nodes, algebraic polynomial, Lebesgue function, $m$-simplex, Lebesgue constant.
Received: 27.10.2010
Citation:
N. V. Baidakova, “Lower Bound for the Lebesgue Function of an Interpolation Process with Algebraic Polynomials on Equidistant Nodes of a Simplex”, Mat. Zametki, 92:1 (2012), 19–26; Math. Notes, 92:1 (2012), 16–22
Linking options:
https://www.mathnet.ru/eng/mzm8965https://doi.org/10.4213/mzm8965 https://www.mathnet.ru/eng/mzm/v92/i1/p19
|
Statistics & downloads: |
Abstract page: | 440 | Full-text PDF : | 185 | References: | 64 | First page: | 22 |
|