In this paper some recent applications of the so-called Generalized Bernstein polynomials are collected. This polynomial sequence is constructed by means of the samples of a continuous function f on equispaced points of [0; 1] and depends on an additional parameter which yields the remarkable property of improving the rate of convergence to the function f, according with the smoothness of f. This means that the sequence does not suffer of the saturation phenomena occurring by using the classical Bernstein polynomials or arising in piecewise polynomial approximation. The applications considered here deal with the numerical integration and the simultaneous approximation. Quadrature rules on equidistant nodes of [0; 1] are studied for the numerical computation of ordinary integrals in one or two dimensions, and usefully employed in Nyström methods for solving Fredholm integral equations. Moreover, the simultaneous approximation of the Hilbert transform and its derivative (the Hadamard transform) is illustrated. For all the applications, some numerical details are given in addition to the error estimates, and the proposed approximation methods have been implemented providing numerical tests which confirm the theoretical estimates. Some open problems are also introduced.
We present a new image scaling method both for downscaling and upscaling, running with any scale factor or desired size. The resized image is achieved by sampling a bivariate polynomial which globally interpolates the data at the new scale. The method’s particularities lay in both the sampling model and the interpolation polynomial we use. Rather than classical uniform grids, we consider an unusual sampling system based on Chebyshev zeros of the first kind. Such optimal distribution of nodes permits to consider near-best interpolation polynomials defined by a filter of de la Vallée-Poussin type. The action ray of this filter provides an additional parameter that can be suitably regulated to improve the approximation. The method has been tested on a significant number of different image datasets. The results are evaluated in qualitative and quantitative terms and compared with other available competitive methods. The perceived quality of the resulting scaled images is such that important details are preserved, and the appearance of artifacts is low. Competitive quality measurement values, good visual quality, limited computational effort, and moderate memory demand make the method suitable for real-world applications.
1 May 2018 in Mathematics and Computers in Simulation