Applied Mathematics

Volume 2, Issue 12 (December 2011)

ISSN Print: 2152-7385   ISSN Online: 2152-7393

Google-based Impact Factor: 0.58  Citations  

An Efficient Combinatorial-Probabilistic Dual-Fusion Modification of Bernstein’s Polynomial Approximation Operator

HTML  Download Download as PDF (Size: 143KB)  PP. 1535-1538  
DOI: 10.4236/am.2011.212218    3,870 Downloads   6,966 Views  

Affiliation(s)

.

ABSTRACT

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.

Share and Cite:

S. Wahid, "An Efficient Combinatorial-Probabilistic Dual-Fusion Modification of Bernstein’s Polynomial Approximation Operator," Applied Mathematics, Vol. 2 No. 12, 2011, pp. 1535-1538. doi: 10.4236/am.2011.212218.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.