Related papers: An explicit construction of optimized interpolatio…
In this paper we show how ideas from spline theory can be used to construct a local basis for the space of translates of a general iterated Brownian Bridge kernel $k_{\beta,\varepsilon}$ for $\beta\in\mathbb{N}$, $\varepsilon\geq 0$. In the…
In this paper asymptotic formulas are given for the Lebesgue constants generated by three special approximation processes related to the $\ell_1$-partial sums of Fourier series. In particular, we consider the Lagrange interpolation…
The use of pyramid elements is crucial to the construction of efficient hex-dominant meshes. For conforming nodal finite element methods with mixed element types, it is advantageous for nodal distributions on the faces of the pyramid to…
A series of robust and optimal mixed methods based on two mixed formulations of the fourth-order elliptic singular perturbation problem are developed in this paper. First, a mixed method based on a second-order system is proposed without…
We investigate some conditions under which the Lebesgue constants or Lebesgue functions are bounded for the classical Lagrange polynomial interpolation on a compact subset of $\mathbb R$. In particular, relationships of such boundedness…
We investigate stochastic interpolation, a recently introduced framework for high dimensional sampling which bears many similarities to diffusion modeling. Stochastic interpolation generates a data sample by first randomly initializing a…
Radial basis function generated finite difference (RBF-FD) methods for PDEs require a set of interpolation points which conform to the computational domain $\Omega$. One of the requirements leading to approximation robustness is to place…
Zernike polynomials are widely used in optics and ophthalmology due to their direct connection to classical optical aberrations. While orthogonal on the unit disk, their application to discrete data or non-circular domains--such as…
In this paper the problem of construction of lattice optimal interpolation formulas in the space $\widetilde{L_2^{(m)}} (0,1)$ is considered. Using S.L. Sobolev's method explicit formulas for the coefficients of lattice optimal…
In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation…
We construct approximate Fekete point sets for kernel-based interpolation by maximising the determinant of a kernel Gram matrix obtained via truncation of an orthonormal expansion of the kernel. Uniform error estimates are proved for kernel…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\it Approximate…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
We survey what is known about Fekete points/optimal designs for a simplex in $\R^d.$ Several new results are included. The notion of Fej\'er exponenet for a set of interpolation points is introduced.
When approximating a function that depends on a parameter, one encounters many practical examples where linear interpolation or linear approximation with respect to the parameters prove ineffective. This is particularly true for responses…
The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…
Global discrete optimization is notoriously difficult due to the lack of gradient information and the curse of dimensionality, making exhaustive search infeasible. Tensor cross approximation is an efficient technique to approximate…
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…
In this article we study interpolation estimates on a special class of compactifications of commutative algebraic groups constructed by Serre. We obtain a large quantitative improvement over previous results due to Masser and the first…