Bernstein polynomial estimation provides a robust nonparametric technique for approximating both density and distribution functions. Based on the properties of Bernstein polynomials, which uniformly ...

Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...

This is a preview. Log in through your library . Abstract The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...