Related papers: On filtered polynomial approximation on the sphere
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
The purpose of this paper is to construct universal, auto--adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper--)sphere $\SS^q$ ($q\ge 2$). The approximation and localization properties of our…
The aim of this paper is to study the approximation of functions using a higher order Hermite-Fejer interpolation process on the unit circle. The system of nodes is composed of vertically projected zeros of Jacobi polynomials onto the unit…
In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…
High-dimensional depth separation results for neural networks show that certain functions can be efficiently approximated by two-hidden-layer networks but not by one-hidden-layer ones in high-dimensions $d$. Existing results of this type…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…
We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…
In every dimension $d \geq 2$, we give an explicit formula that expresses the values of any Schwartz function on $\mathbb{R}^d$ only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres…
Histopolation is the approximation procedure that associates a degree $ d-1 $ polynomial $ p_{d-1} \in \mathscr{P}_{d-1} (I) $ with a locally integrable function $ f $ imposing that the integral (or, equivalently, the average) of $p$…
We develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal error estimates for an averaged Taylor polynomial are…
Let $\Pi_n^d$ denote the space of spherical polynomials of degree at most $n$ on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$ that is equipped with the surface Lebesgue measure $d\sigma$ normalized by $\int_{\mathbb{S}^d} \,…
We introduce a general framework for the construction of polynomial frames in $L^2(\mathbb{S}^{d-1})$, $d \geq 3$, where the frame functions are obtained as rotated versions of an initial sequence of polynomials $\Psi^j$, $j\in…
We discuss the concept of inner function in reproducing kernel Hilbert spaces with an orthogonal basis of monomials and examine connections between inner functions and optimal polynomial approximants to $1/f$, where $f$ is a function in the…
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…
We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…
We introduce a new method to approximate integrals $\int_{\mathbb{R}^d} f(\boldsymbol{x}) \, \mathrm{d} \boldsymbol{x}$ which simply scales lattice rules from the unit cube $[0,1]^d$ to properly sized boxes on $\mathbb{R}^d$, hereby…
We consider fractional Sobolev spaces $H^\theta$, $\theta\in (0,1)$, on 2D domains and $H^1$-conforming discretizations by globally continuous piecewise polynomials on a mesh consisting of shape-regular triangles and quadrilaterals. We…
For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…