A New Upper Bound for Sampling Numbers
A New Upper Bound for Sampling Numbers
Abstract We provide a new upper bound for sampling numbers $$(g_n)_{n\in \mathbb {N}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>g</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:msub> </mml:math> associated with the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. …