Approximation of Finite Hilbert and Hadamard Transforms by Using Equally Spaced Nodes

In the present paper, we propose a numerical method for the simultaneous approximation of the finite Hilbert and Hadamard transforms of a given function f, supposing to know only the samples of f at equidistant points. As reference interval we consider [ − 1 , 1 ] and as approximation tool we use iterated Boolean sums of Bernstein polynomials, also known as generalized Bernstein polynomials. Pointwise estimates of the errors are proved, and some numerical tests are given to show the performance of the procedures and the theoretical results.

Compactly Supported Tight and Sibling Frames Based on Generalized Bernstein Polynomials

We obtain a family of refinable functions based on generalized Bernstein polynomials to provide derived properties. The convergence of cascade algorithms associated with the new masks is proved, which guarantees the existence of refinable functions. Then, we analyze the symmetry, regularity, and approximation order of the refinable functions, which are of importance. Tight and sibling frames are constructed and interorthogonality of sibling frames is demonstrated. Finally, we give numerical examples to explicitly illustrate the construction of the proposed approach.

The r-monotonicity of generalized Bernstein polynomials

Let f ∊ C[0, 1] and let the Bn(f, q; x) be generalized Bernstein polynomials based on the q-integers that were introduced by Phillips. We prove that if f is r-monotone, then Bn(f, q; x) is r-monotone, generalizing well-known results when q = 1 and the results when r = 1 and r = 2 by Goodman et al. We also prove a sufficient condition for a continuous function to be r-monotone.