Table of Contents
Fetching ...

Max-product Kantorovich sampling operators: quantitative estimates in functional spaces

Lorenzo Boccali, Danilo Costarelli, Gianluca Vinti

TL;DR

The paper addresses the rate of modular approximation by max-product Kantorovich sampling operators $K_{n}^{\chi}$ in Orlicz spaces $L^{\varphi}(\Omega)$. The authors develop Jackson-type estimates using the Orlicz-type modulus of smoothness $\omega(f,\delta)_{\varphi}$ and a kernel-decay condition $(\chi4)$ to obtain explicit modular error bounds. For compact domains, a Peetre-type Orlicz K-functional bound $\mathcal{K}(f,\lambda,\delta)_{\varphi}$ yields a modular error bound of the form $I^{\varphi}[\lambda_{1}(K_{n}^{\chi}(f)-f)] \le A_{1}\mathcal{K}(f,\lambda_{0},A_{2}/n)_{\varphi}$ with explicit constants. The results cover a wide class of functional spaces (e.g., $L^{p}$, interpolation, exponential spaces) and imply Lipschitz-class convergence rates, providing a unified framework for non-linear max-product sampling in approximation theory.

Abstract

In this paper, we study the order of approximation for max-product Kantorovich sampling operators based upon generalized kernels in the setting of Orlicz spaces. We establish a quantitative estimate for the considered family of sampling-type operators using the Orlicz-type modulus of smoothness, which involves the modular functional of the space. From this result, it is possible to obtain the qualitative order of convergence when functions belonging to suitable Lipschitz classes are considered. On the other hand, in the compact case, we exploit a suitable definition of K-functional in Orlicz spaces in order to provide an upper bound for the approximation error of the involved operators. The treatment in the general framework of Orlicz spaces allows one to obtain a unifying theory on the rate of convergence, as the proved results can be deduced for a wide range of functional spaces, such as $L^{p}$-spaces, interpolation spaces and exponential spaces.

Max-product Kantorovich sampling operators: quantitative estimates in functional spaces

TL;DR

The paper addresses the rate of modular approximation by max-product Kantorovich sampling operators in Orlicz spaces . The authors develop Jackson-type estimates using the Orlicz-type modulus of smoothness and a kernel-decay condition to obtain explicit modular error bounds. For compact domains, a Peetre-type Orlicz K-functional bound yields a modular error bound of the form with explicit constants. The results cover a wide class of functional spaces (e.g., , interpolation, exponential spaces) and imply Lipschitz-class convergence rates, providing a unified framework for non-linear max-product sampling in approximation theory.

Abstract

In this paper, we study the order of approximation for max-product Kantorovich sampling operators based upon generalized kernels in the setting of Orlicz spaces. We establish a quantitative estimate for the considered family of sampling-type operators using the Orlicz-type modulus of smoothness, which involves the modular functional of the space. From this result, it is possible to obtain the qualitative order of convergence when functions belonging to suitable Lipschitz classes are considered. On the other hand, in the compact case, we exploit a suitable definition of K-functional in Orlicz spaces in order to provide an upper bound for the approximation error of the involved operators. The treatment in the general framework of Orlicz spaces allows one to obtain a unifying theory on the rate of convergence, as the proved results can be deduced for a wide range of functional spaces, such as -spaces, interpolation spaces and exponential spaces.
Paper Structure (3 sections, 8 theorems, 58 equations)

This paper contains 3 sections, 8 theorems, 58 equations.

Key Result

Lemma 2.1

Let $\chi$ be a fixed generalized kernel. Then it turns out that: where $\beta >0$ is the constant arising from condition $(\chi3)$. In particular, we have $m_{0}(\chi) \le \| \chi \|_{\infty}$.

Theorems & Definitions (15)

  • Lemma 2.1: CCGV, Lemma 2.1
  • Lemma 2.2: Coroianu, Lemma 2.3
  • Remark 2.1
  • Lemma 2.3: Coroianu, Lemma 2.6
  • Lemma 2.4
  • Theorem 2.1: Boccali, Theorem 4.1
  • Remark 2.2
  • Theorem 3.1
  • proof
  • Remark 3.1
  • ...and 5 more