%0 Journal Article
%T An Efficient Combinatorial-Probabilistic Dual-Fusion Modification of Bernstein¡¯s Polynomial Approximation Operator
%A Shanaz Ansari Wahid
%J Applied Mathematics
%P 1535-1538
%@ 2152-7393
%D 2011
%I Scientific Research Publishing
%R 10.4236/am.2011.212218
%X The celebrated Weierstrass Approximation Theorem (1885) heralded intermittent interest in polynomial approximation, which continues unabated even as of today. The great Russian mathematician Bernstein, in 1912, not only provided an interesting proof of the Weierstrass¡¯ theorem, but also displayed a sequence of the polynomials which approximate the given function . An efficient ¡®Combinatorial-Probabilistic Dual-Fusion¡¯ version of the modification of Bernstein¡¯s Polynomial Operator is proposed. The potential of the aforesaid improvement is tried to be brought forth and illustrated through an empirical study, for which the function is assumed to be known in the sense of simulation.
%K Approximation
%K Bernstein Operator
%K Dual-Fusion
%K Simulated Empirical Study
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=16452