Uniform approximation and Bernstein polynomials with coefficients in the unit interval

European Journal of Combinatorics

Volumn 32, Issue 3, 2011, Pages 448-463

  Qian, Weikang ^a   Riedel, Marc D ^a   Rosenberg, Ivo ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78650882300     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2010.11.004     Document Type: Article

References (10)

1. Berchtold J., Bowyer A. Robust arithmetic for multivariate Bernstein-form polynomials. Computer-Aided Design 2000, 32(11):681-689.
2. Bernstein S.N. Démonstration du théorème de Weierstrass fondée sur le calcul des probabilités. Communications of the Kharkov Mathematical Society 1912, 13:1-2.
3. Brown B., Card H. Stochastic neural computation I: computational elements. IEEE Transactions on Computers 2001, 50(9):891-905.
4. Davis P.J. Interpolation and Approximation 1963, Blaisdell Publishing Company.
5. Farouki R., Rajan V. On the numerical condition of polynomials in Bernstein form. Computer Aided Geometric Design 1987, 4(3):191-216.
6. Gaines B. Stochastic computing systems. Advances in Information Systems Science 1969, vol. 2:37-172. Plenum, ch. 2.
7. Levasseur K.M. A probabilistic proof of the Weierstrass approximation theorem. The American Mathematical Monthly 1984, 91(4):249-250.
8. Lorentz G. Bernstein Polynomials 1953, University of Toronto Press.
9. Qian W., Riedel M.D. The synthesis of robust polynomial arithmetic with stochastic logic. Design Automation Conference 2008, 648-653.
10. W. Qian, M.D. Riedel, Synthesizing logical computation on stochastic bit streams, Communications of the ACM, 2010 (submitted for publication).