Convergence and high order of approximation by Steklov sampling operators

Abstract In this paper we introduce a new class of sampling-type operators, named Steklov sampling operators. The idea is to consider a sampling series based on a kernel function that is a discrete approximate identity, and which constitutes a reconstruction process of a given signal f , based on a family of sample values which are Steklov integrals of order r evaluated at the nodes k / w , $$k \in {\mathbb {Z}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>Z</mml:mi> </mml:mrow> </mml:math> , $$w&gt;0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>w</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> . The convergence properties of the introduced sampling operators in continuous functions spaces and in the $$L^p$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>L</mml:mi> <mml:mi>p</mml:mi> </mml:msup> </mml:math> -setting have been studied. Moreover, the main properties of the Steklov-type functions have been exploited in order to establish results concerning the high order of approximation. Such results have been obtained in a quantitative version thanks to the use of the well-known modulus of smoothness of the approximated functions, and assuming suitable Strang-Fix type conditions, which are very typical assumptions in applications involving Fourier and Harmonic analysis. Concerning the quantitative estimates, we proposed two different approaches; the first one holds in the case of Steklov sampling operators defined with kernels with compact support, its proof is substantially based on the application of the generalized Minkowski inequality, and it is valid with respect to the p -norm, with $$1 \le p \le +\infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>≤</mml:mo> <mml:mi>p</mml:mi> <mml:mo>≤</mml:mo> <mml:mo>+</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . In the second case, the restriction on the support of the kernel is removed and the corresponding estimates are valid only for $$1 &lt; p\le +\infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>&lt;</mml:mo> <mml:mi>p</mml:mi> <mml:mo>≤</mml:mo> <mml:mo>+</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> . Here, the key point of the proof is the application of the well-known Hardy–Littlewood maximal inequality. Finally, a deep comparison between the proposed Steklov sampling series and the already existing sampling-type operators has been given, in order to show the effectiveness of the proposed constructive method of approximation. Examples of kernel functions satisfying the required assumptions have been provided.