IMA Journal of Numerical Analysis · 2018 · 28 citations · 5 references
ComputingComputer ScienceAlgorithmsComputational GeometryTheory Of ComputationApproximation AlgorithmsConvergence AnalysisInterpolation TechniquesNumerical AlgorithmsFinite-dimensional ApproximationInterpolation Error EstimatesInterpolation PointsInterpolation TheoryLagrange InterpolationLebesgue DimensionPotential TheoryWeighted Least Squares
This work focuses on weighted Lagrange interpolation on an unbounded domain and analyzes the Lebesgue constant for a sequence of weighted Leja points. The standard Leja points are a nested sequence of points defined on a compact subset of the real line and can be extended to unbounded domains with the introduction of a weight function |$w:\mathbb{R}\rightarrow [0,1]$|. Due to a simple recursive formulation in one dimension, such abscissas provide a foundation for high-dimensional approximation methods such as sparse grid collocation, deterministic least squares and compressed sensing. Just as in the unweighted case of interpolation on a compact domain, we use results from potential theory to prove that the Lebesgue constant for the Leja points grows subexponentially with the number of interpolation nodes.
5