相关论文: On the approximation properties of fast Leja point…

Leja points on a compact $K \subset \mathbb{C}$ are known to provide efficient points for interpolation, but their actual implementation can be computationally challenging. So-called pseudo Leja points are a more tractable solution, yet…

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…

Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of one or more {system} parameters are not normal, uniform, or closely related…

We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…

We estimate the Lebesgue constants for Lagrange interpolation processes on one or several intervals by rational functions with fixed poles. We admit that the poles have accumulation points on the intervals. To prove it we use an analog of…

Motivated by an application in Magnetic Particle Imaging, we study bivariate Lagrange interpolation at the node points of Lissajous curves. The resulting theory is a generalization of the polynomial interpolation theory developed for a node…

Deterministic interpolation and quadrature methods are often unsuitable to address Bayesian inverse problems depending on computationally expensive forward mathematical models. While interpolation may give precise posterior approximations,…

We propose an adaptive sparse grid stochastic collocation approach based upon Leja interpolation sequences for approximation of parameterized functions with high-dimensional parameters. Leja sequences are arbitrarily granular (any number of…

The simplest way to obtain continuous interpolation between two points in high dimensional space is to draw a line between them. While previous works focused on the general connectivity between model parameters, we explored linear…

Using the concept of Geometric Weakly Admissible Meshes together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange…

We show that the Lebesgue constant of the real projection of Leja sequences for the unit disk grows like a polynomial. The main application is the first construction of explicit multivariate interpolation points in $[-1,1]^N$ whose Lebesgue…

This work suggests an interpolation-based stochastic collocation method for the non-intrusive and adaptive construction of sparse polynomial chaos expansions (PCEs). Unlike pseudo-spectral projection and regression-based stochastic…

Many applications such as election forecasting, environmental monitoring, health policy, and graph based machine learning require taking expectation of functions defined on the vertices of a graph. We describe a construction of a sampling…

The Leja method is a polynomial interpolation procedure that can be used to compute matrix functions. In particular, computing the action of the matrix exponential on a given vector is a typical application. This quantity is required, e.g.,…

We revisit the approximation of nonempty compact planar sets by filled-in Julia sets of polynomials developed by Lindsey and Younsi and analyze the rate of approximation. We use slightly modified fundamental Lagrange interpolation…

We first give a method to get multidimensional Leja sequences by considering intertwining sequences from one-dimensional ones. An application is the existence of explicit Leja sequences for the closed unit polydisc. Next, we deal with some…

This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice -- a setting that, as pointed out by Zeng, Leung, Hickernell (MCQMC2004, 2006) and Zeng,…

We present the error analysis of Lagrange interpolation on triangles. A new \textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on…

In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that…

Padua points is a family of points on the square $[-1,1]^2$ given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. The interpolation polynomials and cubature formulas based on the Padua points are…