A Probabilistic Dual-Fusion Version of Bernsteinís Polynomial Approximation Operator
by Ashok Sahai.
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 f (x) ? C[0, 1]. A probabilistic ĎDual-Fusioní version of Bernsteinís Polynomial Operator is proposed. The potential of the aforesaid improvement algorithm 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.
Approximation; Bernstein operator; Simulated empirical study
Ashok Sahai, email@example.com
READING THE ARTICLE: You can read the article in
portable document (.pdf) format (489471 bytes.)
NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.
This page has been accessed 1617 times since APRIL 1, 2011.
Return to the Home Page.