Bernshtein's interpolational polynomials
This paper states without proof six theorems about approximation of distributions of random variables by interpolatory polynomials. The main result is Theorem 1: Let \(F_0\) be a strictly monotonic continuous probability distribution. Then for each \(n\) and each monotonic sequence \(0\leq b_1 \leq b_2 \leq \dots \leq b_n=1\) the function \[ \sum_{j=1}^n b_j {n \choose j }(1-F_0(x))^{n-j}F_0(x)^j \tag{1} \] is a continuous probability distribution. Each continuous probability distribution \(F(x)\) can be approximated in the uniform norm by linear combinations (1) with suitable numbers \(n\) and \(b_j\).
- Probability measures, Appell polynomials and polynomial approximation
- The Bernstein constant and polynomial interpolation at the Chebyshev nodes.
- On an interpolation polynomial of S. N. Bernstein type
- Asymptotics of polynomial interpolation and the Bernstein constants
- scientific article; zbMATH DE number 56688 (Why is no real title available?)
- Probabilistic aspects of Bernstein polynomials
This page was built for publication: Bernshtein's interpolational polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363873)