Abstract
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.
Funding Information
  • Advanced Scientific Computing Research (ERKJ259, ERKJE45, ERKJ314)
  • Advanced Research Projects Agency (HR0011619523, 1868-A017-15)
  • Office of Science (ERKJ259, ERKJE45, ERKJ314)