• Corpus ID: 236141425

Sampling discretization of the uniform norm

@inproceedings{Kashin2021SamplingDO,
  title={Sampling discretization of the uniform norm},
  author={Boris Kashin and Sergei Konyagin and Vladimir N. Temlyakov},
  year={2021}
}
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set with fixed cardinality. We give two different proofs of the fact that for any N -dimensional subspace of the space of continuous functions it is sufficient to use eCN sample points for an accurate upper bound for the uniform norm. Previous known results show… 

References

SHOWING 1-10 OF 50 REFERENCES
Universal discretization
TLDR
The construction of the universal sets of points is based on deep results on existence of special nets, known as (t, r, d)-nets, which are optimally good for each subspace of a collection from the point of view of the integral norm discretization.
Integral norm discretization and related problems
The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above
Observations on discretization of trigonometric polynomials with given spectrum
(here and below, C, C1, C2, . . . are different positive constants). Estimates like (3) for various finite-dimensional function spaces have found diverse applications in analysis. Systems Φ of
The Volume Estimates and Their Applications
Abstract : We prove new estimates for the entropy numbers of classes of multivariate functions with bounded mixed derivative. It is known that the investigation of these classes requires development
The Marcinkiewicz-Type Discretization Theorems
This 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
Entropy numbers and Marcinkiewicz-type discretization theorem
This paper studies the behavior of the entropy numbers of classes of functions with bounded integral norms from a given finite dimensional linear subspace. Upper bounds of these entropy numbers in
The Marcinkiewicz-type discretization theorems for the hyperbolic cross polynomials
The main goal of this paper is to study the discretization problem for the hyperbolic cross trigonometric polynomials. This important problem turns out to be very difficult. In this paper we begin
Optimal weighted least-squares methods
We consider the problem of reconstructing an unknown bounded function $u$ defined on a domain $X\subset \mathbb{R}^d$ from noiseless or noisy samples of $u$ at $n$ points $(x^i)_{i=1,\dots,n}$. We
Greedy Approximation
This first book on greedy approximation gives a systematic presentation of the fundamental results. It also contains an introduction to two hot topics in numerical mathematics: learning theory and
Efficient reconstruction of functions on the sphere from scattered data
Motivated by the fact that most data collected over the surface of the earth is available at scattered nodes only, the least squares approximation and interpolation of such data has attracted much
...
1
2
3
4
5
...