A. Sahai, “An Iterative Algorithm for Improved Approximation by Bernstein’s Operator Using Statistical Perspective,” Applied Mathematics and Computation, Vol. 149, No. 2, 2004, pp. 327-335. doi:10.1016/S0096-3003(03)00081-X

has been cited by the following article:

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

  AUTHORS: Shanaz Ansari Wahid

  KEYWORDS: Approximation, Bernstein Operator, Dual-Fusion, Simulated Empirical Study

  JOURNAL NAME: Applied Mathematics, Vol.2 No.12, December 27, 2011

  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.