2000 character limit reached
On sampling discretization in $L_2$
Published 22 Sep 2020 in math.FA, cs.NA, and math.NA | (2009.10789v2)
Abstract: We prove a sampling discretization theorem for the square norm of functions from a finite dimensional subspace satisfying Nikol'skii's inequality with an upper bound on the number of sampling points of the order of the dimension of the subspace
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.