On the Lebesgue constant of weighted Leja points for Lagrange interpolation on unbounded domains

Peter Jantsch, Clayton G. Webster, Guannan Zhang

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

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 ℝ → [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.

Original languageEnglish
Pages (from-to)1039-1057
Number of pages19
JournalIMA Journal of Numerical Analysis
Volume39
Issue number2
DOIs
StatePublished - Apr 23 2019

Keywords

  • Lagrange interpolation
  • Lebesgue constant
  • weighted Leja sequence

Fingerprint

Dive into the research topics of 'On the Lebesgue constant of weighted Leja points for Lagrange interpolation on unbounded domains'. Together they form a unique fingerprint.

Cite this