Max-Min Durrmeyer Exponential Sampling Operators
- Max–Min Durrmeyer-type exponential sampling operators are nonlinear approximation processes that use Mellin kernels and supremum–minimum algebra on bounded, log-uniformly continuous functions.
- They employ discrete and continuous moment conditions to ensure robust pointwise, uniform, and modular convergence in generalized Orlicz spaces.
- Numerical experiments validate these operators with improved error bounds and stability, supporting applications in signal processing and function reconstruction.
Max–Min Durrmeyer-type exponential sampling operators constitute a nonlinear class of approximation processes acting on bounded, log-uniformly continuous functions and integrable functions on positive real intervals. These operators utilize Mellin-type kernels with discrete and continuous moment conditions and are designed to exhibit robust pointwise, uniform, and modular convergence properties, including in generalized Orlicz spaces equipped with the Haar measure. Their formulation involves supremum–minimum algebra, enabling output stability and improved accuracy under certain regularity conditions of the approximated function and kernel pairings. Numerical experiments confirm theoretical convergence rates and highlight practical strengths in both smooth and piecewise regimes (Pradhan et al., 6 Dec 2025, Pradhan et al., 16 Oct 2025).
1. Underlying Functional Framework
The domain of Max–Min Durrmeyer-type exponential sampling operators is structured around Mellin analysis and Orlicz space functional settings.
- Log-uniformly continuous and bounded functions: Let be compact. Functions belong to if such that for all , with bounded sup-norm .
- Mellin–Orlicz Spaces: For measurable , the Orlicz modular is , with convex and satisfying growth and continuity constraints. The space comprises functions with for some . The Luxemburg norm is defined as . The -condition on ensures equivalence of modular and norm convergence.
- Kernels and Moment Conditions: Mellin kernels and weights are chosen to satisfy discrete and continuous moment conditions:
- Discrete moments: for .
- Positivity: For , .
- Integrability: , .
2. Operator Definitions and Algebraic Structure
- Max–Product Durrmeyer Operator (Editor’s term: ): For ,
This operator is monotone, subadditive, and positively homogeneous, due to the max–product structure.
- Max–Min Durrmeyer Operator (Editor’s term: ):
The symbol denotes minimum. Both operators leverage supremum and minimum operations over discrete index sets defined by the scaling and kernel localization properties.
3. Convergence Theorems and Quantitative Rates
- Pointwise and Uniform Convergence: For , both operators satisfy uniform convergence:
The convergence is uniform on compact subintervals of (Pradhan et al., 6 Dec 2025, Pradhan et al., 16 Oct 2025).
- Modular Convergence in Orlicz Space:
If , then for any ,
When satisfies the -condition, modular convergence implies convergence in Luxemburg norm.
- Rates and Quantitative Error Bounds:
Error estimates are obtained via localization:
Where is the modulus of log-continuity and relates to kernel decay. For max–min, analogous bounds hold with an additional term due to the min-composition.
Quantitative rates in terms of the logarithmic modulus are given for by:
For log-Hölder continuous functions (), convergence rates are as .
4. Kernel Selection and Explicit Error Performance
- Classical Kernel Choices:
- Mellin B-spline of order 2: , supported on .
- Mellin B-spline of order 3: .
- Mellin–Fejér kernel: .
- Mellin–Jackson kernel: .
Moment values and positivity constants for these kernels determine existence, bounds, and localization properties of the operators in implementation, and impact numerical stability.
Error Table Illustration:
Empirical error data for the smooth oscillatory test function with and :
n at at at at 17 0.00916 0.01972 0.18534 0.21016 26 0.00679 0.01368 0.10942 0.12752 35 0.00497 0.00993 0.07972 0.09501 53 0.00321 0.00639 0.05126 0.06193 There is empirical confirmation of decay of error and operator-specific differences in smooth versus non-smooth regimes. Higher-order kernels enhance convergence and minimize Gibbs-type oscillations (Pradhan et al., 6 Dec 2025).
5. Analytical Techniques for Proof and Localization
The convergence theory for the Max–Min and Max–Product operators leverages several techniques:
Local–nonlocal decomposition: Splitting sums or maxima into neighborhoods near (where the kernel is localized) and elsewhere (where kernel contributions decay as ).
Triangle-type estimates for extremal functionals: Used for error control in supremum and minimum constructions.
Discrete moment and lower bound lemmas: Guarantee the existence of non-negligible kernel values in requisite intervals, precluding denominator degeneration.
Passing convexity via Fubini–Tonelli integration: Essential for modular convergence results in Orlicz spaces.
Density arguments: Approximating general functions via functions for controlling the modular difference.
6. Practical Implications, Stability, and Extensions
Operator Stability and Range: Max–Min Durrmeyer-type operators enforce outputs in when is bounded in , crucial for probabilistic or fuzzy system applications (Pradhan et al., 16 Oct 2025).
Nonlinear versus Linear Durrmeyer variants: The supremum–minimum structure often yields higher accuracy than linear summation counterparts, specifically under finite kernel support and regularity constraints.
Application Contexts: These operators suit Mellin-transform signal processing, numerical reconstruction of functions on stretched intervals, and scenarios requiring robust nonlinear approximation schemes.
Limitations and Open Questions:
- The requirement (strict positiveness of kernel) restricts endpoints for compact intervals.
- Saturation theorems and inverse results remain open for generalizations.
- Multivariate extensions, adaptive kernel selection, and data-driven sampling in the Mellin context are promising directions.
- Extensions to variable-exponent and weighted Orlicz spaces are natural and have initial study foundations (Pradhan et al., 14 Aug 2025).
7. Summary and Outlook
Max–Min Durrmeyer-type exponential sampling operators represent a nonlinear, kernel-driven, Mellin-analytic framework for function approximation, with thoroughly characterized convergence in log-uniform and modular topologies. They offer complementary advantages—max-product for smooth accuracy, max-min for stability near singularities—with provable rates and robust empirical performance. Ongoing research is focused on generalizing to broader function spaces, saturation and multivariate questions, and adaptive algorithmic deployment (Pradhan et al., 6 Dec 2025, Pradhan et al., 16 Oct 2025).