Efficient Approximation Using Probabilistically Improved Combinatorial Structure of Bernstein's Polynomial Operator's Weights through the Fusion of Dual-Perspectives


  •  Shanaz Wahid    

Abstract

A new polynomial approximation operator has been proposed which uses weight-functions of the well-known Bernstein’s Polynomial operator in its probabilistically improved combinatorial structure, achieved through a rather-ingenious ‘Fusion’ of two dual perspectives. These weights are functions of the impugned variable of the unknown function being approximated, and are not mere constants. The new approximation formula has been compared empirically with the simple classical method of polynomial approximation using the well-known “Bernstein Operator”. The percentage absolute relative errors for the proposed approximation formula and that with the “Bernstein Operator” have been computed for certain selected functions and with different number of node points in the interval of approximation. It has been observed that the proposed approximation formula produces exceedingly-significantly better results.



This work is licensed under a Creative Commons Attribution 4.0 License.