English
Related papers

Related papers: $L_p$-Sampling recovery for non-compact subclasses…

200 papers

We consider the task of recovering a Sobolev function on a connected compact Riemannian manifold $M$ when given a sample on a finite point set. We prove that the quality of the sample is given by the $L_\gamma(M)$-average of the geodesic…

Numerical Analysis · Mathematics 2024-09-23 David Krieg , Mathias Sonnleitner

This paper is a direct followup of the recent author's paper. In this paper we continue to analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special…

Numerical Analysis · Mathematics 2024-01-29 V. Temlyakov

We consider the problem of random sampling for band-limited functions. When can a band-limited function $f$ be recovered from randomly chosen samples $f(x_j), j\in \mathbb{N}$? We estimate the probability that a sampling inequality of the…

Probability · Mathematics 2011-04-27 Karlheinz Gröchenig , Richard F. Bass

Let $X_n = \{x^j\}_{j=1}^n$ be a set of $n$ points in the $d$-cube $[0,1]^d$, and $\Phi_n = \{\varphi_j\}_{j =1}^n$ a family of $n$ functions on $[0,1]^d$. We consider the approximate recovery functions $f$ on $[0,1]^d$ from the sampled…

Numerical Analysis · Mathematics 2015-11-10 Dinh Dũng

We tensorize the Faber spline system from [14] to prove sequence space isomorphisms for multivariate function spaces with higher mixed regularity. The respective basis coefficients are local linear combinations of discrete function values…

Functional Analysis · Mathematics 2020-04-08 Nadiia Derevianko , Tino Ullrich

Recently, it was discovered that for a given function class $\mathbf{F}$ the error of best linear recovery in the square norm can be bounded above by the Kolmogorov width of $\mathbf{F}$ in the uniform norm. That analysis is based on deep…

Numerical Analysis · Mathematics 2023-05-17 F. Dai , V. Temlyakov

We study optimal algorithms in adaptive sampling recovery of smooth functions defined on the unit $d$-cube ${\II}^d:= [0,1]^d$. The recovery error is measured in the quasi-norm $\|\cdot\|_q$ of $L_q := L_q(\II^d)$. For $B$ a subset in…

Functional Analysis · Mathematics 2011-03-01 Dinh Dũng

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…

Numerical Analysis · Mathematics 2024-07-24 Moritz Moeller , Serhii Stasyuk , Tino Ullrich

For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…

Numerical Analysis · Mathematics 2023-05-15 Matthieu Dolbeault , David Krieg , Mario Ullrich

In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…

Functional Analysis · Mathematics 2026-04-21 Van Kien Nguyen

In this paper, we consider the problem of reconstructing piecewise smooth functions to high accuracy from nonuniform samples of their Fourier transform. We use the framework of nonuniform generalized sampling (NUGS) to do this, and to…

Numerical Analysis · Mathematics 2014-10-02 Ben Adcock , Milana Gataric , Anders C. Hansen

A key problem in approximation theory is the recovery of high-dimensional functions from samples. In many cases, the functions of interest exhibit anisotropic smoothness, and, in many practical settings, the nature of this anisotropy may be…

Numerical Analysis · Mathematics 2026-04-10 Ben Adcock , Avi Gupta

We study a sample complexity vs. conditioning tradeoff in modern signal recovery problems (including sparse recovery, low-rank matrix sensing, covariance estimation, and abstract phase retrieval), where convex optimization problems are…

Optimization and Control · Mathematics 2024-07-19 Lijun Ding , Alex L. Wang

We study approximation properties of linear sampling operators in the spaces $L_p$ for $1\le p<\infty$. By means of the Steklov averages, we introduce a new measure of smoothness that simultaneously contains information on the smoothness of…

Classical Analysis and ODEs · Mathematics 2022-02-11 Yurii Kolomoitsev , Tetiana Lomako

We show that there are sampling projections on arbitrary $n$-dimensional subspaces of $B(D)$ with at most $2n$ samples and norm of order $\sqrt{n}$, where $B(D)$ is the space of complex-valued bounded functions on a set $D$. This gives a…

Functional Analysis · Mathematics 2025-10-02 David Krieg , Kateryna Pozharska , Mario Ullrich , Tino Ullrich

We prove that the optimal error of recovery in the $L_2$ norm of functions from a class $\bF$ can be bounded above by the value of the Kolmogorov width of $\bF$ in the uniform norm. We demonstrate on a number of examples of $\bF$ from…

Numerical Analysis · Mathematics 2020-10-08 V. Temlyakov

We provide sufficient conditions on a family of functions $(\phi_\alpha)_{\alpha\in A}:\mathbb{R}^d\to\mathbb{R}$ for sampling of multivariate bandlimited functions at certain nonuniform sequences of points in $\mathbb{R}^d$. We consider…

Functional Analysis · Mathematics 2018-02-14 Keaton Hamm

Learning non-linear systems from noisy, limited, and/or dependent data is an important task across various scientific fields including statistics, engineering, computer science, mathematics, and many more. In general, this learning task is…

Information Theory · Computer Science 2018-11-27 Lam Si Tung Ho , Hayden Schaeffer , Giang Tran , Rachel Ward

Optimal sampling of non band-limited functions is an issue of great importance that has attracted considerable attention. We propose to tackle this problem through the use of a frequency warping: First, by a nonlinear shrinking of…

Classical Analysis and ODEs · Mathematics 2017-03-07 Stefan Lafon , Jacques Lévy Véhel , Jacques Peyrière

Let $\xi = \{x^j\}_{j=1}^n$ be a grid of $n$ points in the $d$-cube ${\II}^d:=[0,1]^d$, and $\Phi = \{\phi_j\}_{j =1}^n$ a family of $n$ functions on ${\II}^d$. We define the linear sampling algorithm $L_n(\Phi,\xi,\cdot)$ for an…

Functional Analysis · Mathematics 2010-09-23 Dinh Dũng