Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Marcinkiewicz-type discretization theorems
70
0
0.0
(
0
)
Authors
V.N. Temlyakov
Ask ChatGPT about the research
No Arabic abstract
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 works well for discretization of the integral norm. It is a combination of probabilistic technique, based on chaining, with results on the entropy numbers in the uniform norm.
rate research
Read More
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 a systematic study of this problem and demonstrate two different techniques -- the probabilistic and the number theoretical techniques.
The paper studies the sampling discretization problem for integral norms on subspaces of $L^p(mu)$. Several close to optimal results are obtained on subspaces for which certain Nikolskii-type inequality is valid. The problem of norms discretization is connected with the probabilistic question about the approximation with high probability of marginals of a high dimensional random vector by sampling. As a byproduct of our approach we refine the result of O. Gu$acute{e}$don and M. Rudelson concerning the approximation of marginals. In particular, the obtained improvement recovers a theorem of J. Bourgain, J. Lindenstrauss, and V. Milman concerning embeddings of finite dimensional subspaces of $L^p[0, 1]$ into $ell_p^m$. The proofs in the paper use the recent developments of the chaining technique by R. van Handel.
In this paper we consider the numerical approximation of systems of Boussinesq-type to model surface wave propagation. Some theoretical properties of these systems (multi-symplectic and Hamiltonian formulations, well-posedness and existence of solitary-wave solutions) were previously analyzed by the authors in Part I. As a second part of the study, considered here is the construction of geometric schemes for the numerical integration. By using the method of lines, the geometric properties, based on the multi-symplectic and Hamiltonian structures, of different strategies for the spatial and time discretizations are discussed and illustrated.
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, which are optimally (in the sense of order) good for each subspace of a collection from the point of view of the integral norm discretization. We call such sets universal. Our construction of the universal sets is based on deep results on existence of special nets, known as (t,r,d)-nets.
The main objective of this paper is to develop a general method of geometric discretization for infinite-dimensional systems and apply this method to the EPDiff equation. The method described below extends one developed by Pavlov et al. for incompressible Euler fluids. Here this method is presented in a general case applicable to all, not only divergence-free, vector fields. Also, a different (pseudospectral) representation of the velocity field is used. We will apply this method to the one-dimensional EPDiff equation and present numerical results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
