English
Related papers

Related papers: On universal sampling recovery in the uniform norm

200 papers

The paper is devoted to discretization of integral norms of functions from a given collection of finite dimensional subspaces. For natural collections of subspaces of the multivariate trigonometric polynomials we construct sets of points,…

Numerical Analysis · Mathematics 2017-08-30 V. N. Temlyakov

We give a short survey of recent results on sparse-grid linear algorithms of approximate recovery and integration of functions possessing a unweighted or weighted Sobolev mixed smoothness based on their sampled values at a certain finite…

Numerical Analysis · Mathematics 2024-03-12 Dinh Dũng

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Numerical Analysis · Mathematics 2022-05-04 Ben Adcock , Milana Gataric , José Luis Romero

Sampling recovery on some function classes is studied in this paper. Typically, function classes are defined by imposing smoothness conditions. It was understood in nonlinear approximation that structural conditions in the form of control…

Numerical Analysis · Mathematics 2024-06-27 V. Temlyakov

In a series of recent papers (Adcock, Hansen and Poon, 2013, Appl. Comput. Harm. Anal. 45(5):3132-3167), (Adcock, Gataric and Hansen, 2014, SIAM J. Imaging Sci. 7(3):1690-1723) and (Adcock, Hansen, Kutyniok and Ma, 2015, SIAM J. Math. Anal.…

Numerical Analysis · Mathematics 2016-03-08 Milana Gataric , Clarice Poon

The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. This problem is very important in applications but there is no systematic study of it. We present here a new technique, which…

Numerical Analysis · Mathematics 2017-03-13 V. N. Temlyakov

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

In this paper we continue to develop the following general approach. We study asymptotic behavior of the errors of sampling recovery not for an individual smoothness class, how it is usually done, but for the collection of classes, which…

Numerical Analysis · Mathematics 2026-01-14 V. Temlyakov

We study the recovery of functions in various norms, including $L_p$ with $1\le p\le\infty$, based on function evaluations. We obtain worst case error bounds for general classes of functions in terms of the best $L_2$-approximation from a…

Numerical Analysis · Mathematics 2025-12-23 David Krieg , Kateryna Pozharska , Mario Ullrich , Tino Ullrich

We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements…

Information Theory · Computer Science 2013-06-05 Joel Andersson , Jan-Olov Strömberg

In this work we consider the problem of recovering non-uniform splines from their projection onto spaces of algebraic polynomials. We show that under a certain Chebyshev-type separation condition on its knots, a spline whose inner-products…

Information Theory · Computer Science 2014-12-22 Tamir Bendory , Shai Dekel , Arie Feuer

Quantization of compressed sensing measurements is typically justified by the robust recovery results of Cand\`es, Romberg and Tao, and of Donoho. These results guarantee that if a uniform quantizer of step size $\delta$ is used to quantize…

Information Theory · Computer Science 2010-10-06 S. Güntürk , A. Powell , R. Saab , Ö. Yılmaz

In many applications sampled data are collected in irregular fashion or are partly lost or unavailable. In these cases it is required to convert irregularly sampled signals to regularly sampled ones or to restore missing data. In this…

Universal (pointwise uniform and time shifted) truncation error upper bounds are presented in Whittaker--Kotel'nikov--Shannon (WKS) sampling restoration sum for Bernstein function class $B_{\pi,d}^q\,,\ q \ge 1,$ $d\in \mathbb N\,,$ when…

Information Theory · Computer Science 2013-07-15 Andriy Olenko , Tibor K. Pogány

It has been observed by several authors that well-known periodization strategies like tent or Chebychev transforms lead to remarkable results for the recovery of multivariate functions from few samples. So far, theoretical guarantees are…

Numerical Analysis · Mathematics 2023-07-24 Felix Bartel , Kai Lüttgen , Nicolas Nagel , Tino Ullrich

In many applications we seek to recover signals from linear measurements far fewer than the ambient dimension, given the signals have exploitable structures such as sparse vectors or low rank matrices. In this paper we work in a general…

Information Theory · Computer Science 2023-11-14 Xuemei Chen

In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…

Functional Analysis · Mathematics 2021-11-01 Vladimir Temlyakov , Tino Ullrich

Using techniques developed recently in the field of compressed sensing we prove new upper bounds for general (nonlinear) sampling numbers of (quasi-)Banach smoothness spaces in $L^2$. In particular, we show that in relevant cases such as…

Numerical Analysis · Mathematics 2023-08-02 Thomas Jahn , Tino Ullrich , Felix Voigtlaender

In this paper we study the general reconstruction of a compactly supported function from its Fourier coefficients using compactly supported shearlet systems. We assume that only finitely many Fourier samples of the function are accessible…

Functional Analysis · Mathematics 2015-07-31 Jackie Ma

In high-dimensional statistical inference, sparsity regularizations have shown advantages in consistency and convergence rates for coefficient estimation. We consider a generalized version of Sparse-Group Lasso which captures both…

Machine Learning · Statistics 2020-08-12 Xinyu Zhang