Sampling scattered data with Bernstein polynomials: stochastic and deterministic error estimates

Abstract

Viewing the classical Bernstein polynomials as sampling operators, we study a generalization by allowing the sampling operation to take place at scattered sites. We utilize both stochastic and deterministic approaches. On the stochastic side, we consider the sampling sites as random variables that obey some naturally derived probabilistic distributions, and obtain Chebyshev type estimates. On the deterministic side, we incorporate the theory of uniform distribution of point sets (within the framework of Weyl's criterion) and the discrepancy method. We establish convergence results and error estimates under practical assumptions on the distribution of the sampling sites.

Department(s)

Mathematics

Document Type

Article

DOI

https://doi.org/10.1007/s10444-011-9233-0

Publication Date

2013

Journal Title

Advances in Computational Mathematics

Link to Full Text

Share

COinS