Related papers: Interpolatory pointwise estimates for convex polyn…

Functions in a Sobolev space are approximated directly by piecewise affine interpolation in the norm of the space. The proof is based on estimates for interpolations and does not rely on the density of smooth functions.

The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

We find asymptotic equalities for the exact upper bounds of approximations by Fourier sums of Weyl-Nagy classes $W^r_{\beta,p}, 1\le p\le\infty,$ for rapidly growing exponents of smoothness $r$ $(r/n\rightarrow\infty)$ in the uniform…

Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…

Soft extrapolation refers to the problem of recovering a function from its samples, multiplied by a fast-decaying window and perturbed by an additive noise, over an interval which is potentially larger than the essential support of the…

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

Let {(Z_i,W_i):i=1,...,n} be uniformly distributed in [0,1]^d * G(k,d), where G(k,d) denotes the space of k-dimensional linear subspaces of R^d. For a differentiable function f from [0,1]^k to [0,1]^d we say that f interpolates (z,w) in…

Let $(X_1,\ldots,X_n)$ be an i.i.d. sequence of random variables in $\mathbb{R}^d$, $d\geq 1$. We show that, for any function $\varphi :\mathbb{R}^d\rightarrow\mathbb{R}$, under regularity conditions, \[n^…

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

We consider the problem of approximating a smooth function from finitely-many pointwise samples using $\ell^1$ minimization techniques. In the first part of this paper, we introduce an infinite-dimensional approach to this problem. Three…

Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…

Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of…

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…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…

We prove square function estimates for certain conical regions. Specifically, let $\{\Delta_j\}$ be regions of the unit sphere $\mathbb{S}^{n-1}$ and let $S_j f$ be the smooth Fourier restriction of $f$ to the conical region…

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…