Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Order of uniform approximation by polynomial interpolation in the complex plane and beyond (2209.07101v3)

Published 15 Sep 2022 in math.CA, cs.NA, math.CV, and math.NA

Abstract: For Lagrange polynomial interpolation on open arcs $X=\gamma$ in $\mathbb{C}$, it is well-known that the Lebesgue constant for the family of Chebyshev points ${\bf{x}}n:={x{n,j}}{n}_{j=0}$ on $[-1,1]\subset \mathbb{R}$ has growth order of $O(log(n))$. The same growth order was shown in [45] for the Lebesgue constant of the family ${\bf {z{}n}}:={z{n,j}{}}{n}_{j=0}$ of some properly adjusted Fej\'er points on a rectifiable smooth open arc $\gamma\subset \mathbb{C}$. On the other hand, in our recent work [15], it was observed that if the smooth open arc $\gamma$ is replaced by an $L$-shape arc $\gamma_0 \subset \mathbb{C}$ consisting of two line segments, numerical experiments suggest that the Marcinkiewicz-Zygmund inequalities are no longer valid for the family of Fej\'er points ${\bf z}n{*}:={z{n,j}{*}}{n}_{j=0}$ on $\gamma$, and that the rate of growth for the corresponding Lebesgue constant $L_{{\bf {z}}{*}_n}$ is as fast as $c\,log2(n)$ for some constant $c>0$. The main objective of the present paper is 3-fold: firstly, it will be shown that for the special case of the $L$-shape arc $\gamma_0$ consisting of two line segments of the same length that meet at the angle of $\pi/2$, the growth rate of the Lebesgue constant $L_{{\bf {z}}n{*}}$ is at least as fast as $O(Log2(n))$, with $\lim\sup \frac{L{{\bf {z}}n{*}}}{log2(n)} = \infty$; secondly, the corresponding (modified) Marcinkiewicz-Zygmund inequalities fail to hold; and thirdly, a proper adjustment ${\bf z}_n{**}:={z{n,j}{**}}{n}_{j=0}$ of the Fej\'er points on $\gamma$ will be described to assure the growth rate of $L_{{\bf z}_n{**}}$ to be exactly $O(Log2(n))$.

Citations (1)

Summary

We haven't generated a summary for this paper yet.