Sampling discretization of integral norms and its application
share
The paper addresses the problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretization results under two standard kinds of assumptions – conditions on the entropy numbers and conditions in terms of the Nikol'skii-type inequalities. We prove some upper bounds on the number of sample points sufficient for good discretization and show that these upper bounds are sharp in a certain sense. Then we apply our general conditional results to subspaces with special structures, namely, subspaces with the tensor product structure. We demonstrate that applications of results based on the Nikol'skii-type inequalities provide somewhat better results than applications of results based on the entropy numbers conditions. Finally, we apply discretization results to the problem of sampling recovery.
READ FULL TEXT