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

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 ...

In a recent paper, R. Morton and A. Krall introduced a new notion of orthogonality of polynomials on the real line in which a sequence of Chebyshev-type polynomials was shown to be orthogonal with ...