Next Article in Journal
Research on the Properties of Solutions to Fourth-Order Pseudo-Parabolic Equations with Nonlocal Sources
Previous Article in Journal
A Comparison of the Black Hole Algorithm Against Conventional Training Strategies for Neural Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Linear Approximation Processes Based on Binomial Polynomials

by
Octavian Agratini
*,† and
Maria Crăciun
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, 57 Fântânele Street, 400320 Cluj-Napoca, Romania
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2025, 13(15), 2413; https://doi.org/10.3390/math13152413 (registering DOI)
Submission received: 11 June 2025 / Revised: 22 July 2025 / Accepted: 24 July 2025 / Published: 27 July 2025
(This article belongs to the Section E: Applied Mathematics)

Abstract

The purpose of the article is to highlight the role of binomial polynomials in the construction of classes of positive linear approximation sequences on Banach spaces. Our results aim to introduce and study an integral extension in Kantorovich sense of these binomial operators, which are useful in approximating signals in Lp([0,1]) spaces, p1. Also, inspired by the coincidence index that appears in the definition of entropy, a general class of discrete operators related to the squared fundamental basis functions is under study. The fundamental tools used in error evaluation are the smoothness moduli and Peetre’s K-functionals. In a distinct section, numerical applications are presented and analyzed.
Keywords: binomial polynomial; umbral calculus; linear positive operator; r-modulus of smoothness; Peetre’s K-functionals; Kantorovich-type operator; Hardy–Littlewood maximal operator; index of coincidence binomial polynomial; umbral calculus; linear positive operator; r-modulus of smoothness; Peetre’s K-functionals; Kantorovich-type operator; Hardy–Littlewood maximal operator; index of coincidence

Share and Cite

MDPI and ACS Style

Agratini, O.; Crăciun, M. Linear Approximation Processes Based on Binomial Polynomials. Mathematics 2025, 13, 2413. https://doi.org/10.3390/math13152413

AMA Style

Agratini O, Crăciun M. Linear Approximation Processes Based on Binomial Polynomials. Mathematics. 2025; 13(15):2413. https://doi.org/10.3390/math13152413

Chicago/Turabian Style

Agratini, Octavian, and Maria Crăciun. 2025. "Linear Approximation Processes Based on Binomial Polynomials" Mathematics 13, no. 15: 2413. https://doi.org/10.3390/math13152413

APA Style

Agratini, O., & Crăciun, M. (2025). Linear Approximation Processes Based on Binomial Polynomials. Mathematics, 13(15), 2413. https://doi.org/10.3390/math13152413

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop