The Weierstrass Approximation Theorem and Large Deviations
From MaRDI portal
The authors use the theory of large deviations to prove the Weierstrass approximation theorem and obtain the rate of convergence of the Bernstein polynomials to a function satisfying a Lipschitz condition.
Recommendations
Cited in
(11)- Feedback equivalence and uniform ensemble reachability
- Computation of open-loop inputs for uniformly ensemble controllable systems
- A Probabilistic Proof of the Weierstrass Approximation Theorem
- scientific article; zbMATH DE number 1972827 (Why is no real title available?)
- Uniform ensemble controllability for one-parameter families of time-invariant linear systems
- WEIERSTRASS' THEOREM IN THE TWENTIETH CENTURY: A SELECTION
- Weierstrass first theorem and Bernoulli trials
- How close is the approximation by Bernstein polynomials?
- On the randomized Bernstein approximation theorem and the order of approximation
- A numerical approach based on Bernstein collocation method: application to differential Lyapunov and Sylvester matrix equations
- On some series approximations arising from the probabilistic proof of Weierstrass approximation
This page was built for publication: The Weierstrass Approximation Theorem and Large Deviations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373338)
