On the approximation properties of fast Leja points
Sione Ma`u
TL;DR
The paper addresses whether fast Leja points on an interval yield good univariate polynomial interpolation. It introduces Property ($\star$), an asymptotic distribution condition for interpolation arrays, and proves that if ($\star$) holds for the fast Leja set on $I=[0,1]$, then $\lim_{n\to\infty} |VDM(a_1,\dots,a_n)|^{2/[n(n+1)]}=d(I)$, establishing the array as good for interpolation via the BBCL framework. It also provides general sufficient conditions ensuring ($\star$), connects the construction to pseudo-Leja and $\tau$-Leja concepts, and offers conjectures and numerical evidence supporting fast Leja points as $\tau$-Leja with $\tau\in(\tfrac{1}{2},1)$. The results pave a rigorous path to validating fast Leja points for high-quality Lagrange interpolation and hint at extensions to unions of intervals or curves.
Abstract
Fast Leja points on an interval are points constructed using a discrete modification of the algorithm for constructing Leja points. Not much about fast Leja points has been proven theoretically. We present an asymptotic property of a triangular interpolation array, and under the assumption that fast Leja points satisfy this property, we prove that they are good for Lagrange interpolation.
