A Probabilistic Proof of the Weierstrass Approximation Theorem

DOI10.2307/2322960zbMath0564.41005OpenAlexW4240411271MaRDI QIDQ3678128

Kenneth M. Levasseur

Publication date: 1984

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2322960

zbMATH Keywords

Bernstein polynomialsbinomial distributionChebyshev's inequalityWeierstrass approximation theoremprobabilistic proof

Mathematics Subject Classification ID

Approximation by polynomials (41A10)

Related Items (11)

Receiver operating characteristic (ROC) curves: equivalences, beta model, and minimum distance estimation ⋮ Bernstein-type approximation of set-valued functions in the symmetric difference metric ⋮ On the randomized Bernstein approximation theorem and the order of approximation ⋮ Bernstein operational matrix of differentiation and collocation approach for a class of three-point singular BVPs: error estimate and convergence analysis ⋮ Uniform approximation and Bernstein polynomials with coefficients in the unit interval ⋮ Feller’s Scheme in Approximation by Nonlinear Possibilistic Integral Operators ⋮ Numerical solution of fractional differential equations with a Tau method based on Legendre and Bernstein polynomials ⋮ On modified Chebyshev polynomials ⋮ A possibilistic approach of the max-product Bernstein kind operators ⋮ Identifiability and estimation of meta-elliptical copula generators ⋮ Weierstrass and approximation theory

This page was built for publication: A Probabilistic Proof of the Weierstrass Approximation Theorem