Related papers: High Accuracy Quasi-Interpolation using a new clas…
Given gridded cell-average data of a smooth multivariate function, we present a constructive explicit procedure for generating a high-order global approximation of the function. One contribution is the derivation of high order…
We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…
It is well-known that the univariate Multiquadric quasi-interpolation operator is constructed based on the piecewise linear interpolation by |x|. In this paper, we first introduce a new transcendental RBF based on the hyperbolic tangent…
This paper develops a fully discrete soft thresholding polynomial approximation over a general region, named Lasso hyperinterpolation. This approximation is an $\ell_1$-regularized discrete least squares approximation under the same…
We design a quasi-interpolation operator from the Sobolev space $H^1_0(\Omega)$ to its finite-dimensional finite element subspace formed by piecewise polynomials on a simplicial mesh with a computable approximation constant. The operator 1)…
This paper provides approximation orders for a class of nonlinear interpolation procedures for univariate data sampled over $\sigma$ quasi-uniform grids. The considered interpolation is built using both essentially nonoscillatory (ENO) and…
This paper investigates the algebraic properties of the hyperinterpolation class $\mathbf{HC}(\mathbb{S}^d)$ on the unit sphere $ \mathbb{S}^d $. We focus on operators derived from the classical hyperinterpolation with bounded $ L_2 $…
Histopolation, or interpolation on segments, is a mathematical technique used to approximate a function $f$ over a given interval $I=[a,b]$ by exploiting integral information over a set of subintervals of $I$. Unlike classical polynomial…
We introduce a method for constructing global approximations to correlation functions of strongly interacting quantum field theories, starting from perturbative results. The key idea is to employ interpolation method, such as the two-point…
Interpolation-based techniques have become popularized in recent years because of their inherently modular and local reasoning, which can scale up existing formal verification techniques like theorem proving, model-checking, abstraction…
We characterise interpolating and sampling sequences for the spaces of entire functions f such that f e^{-phi} belongs to L^p(C), p>=1 (and some related weighted classes), where phi is a subharmonic weight whose Laplacian is a doubling…
This paper introduces the concept of hyperpolation: a way of generalising from a limited set of data points that is a peer to the more familiar concepts of interpolation and extrapolation. Hyperpolation is the task of estimating the value…
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…
In this paper, we study the problem of interpolating a continuous function at $(n+1)$ equally-spaced points in the interval $[0,1]$, using shifts of a kernel on the $(1/n)$-spaced infinite grid. The archetypal example here is approximation…
We design quasi-interpolation operators based on piecewise polynomial weight functions of degree less than or equal to $p$ that map into the space of continuous piecewise polynomials of degree less than or equal to $p+1$. We show that the…
The geometric multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared…
We develop and analyze a class of matrix-valued spherical-convolution kernels stemming from scaled zonal functions on $\mathbb{S}^2,$ the unit sphere embedded in $\mathbb{R}^3$. The construct of these kernels utilizes the Legendre…
In the present work, the notion of Cubic Spline Super Fractal Interpolation Function (SFIF) is introduced to simulate an object that depicts one structure embedded into another and its approximation properties are investigated. It is shown…
Baskakov operators and their inverses can be expressed as linear differential operators on polynomials. Recurrence relations are given for the computation of these coefficients. They allow the construction of the associated Baskakov…
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid…