In this paper we investigate some Nystr¨om methods for Fredholm integral equations in the interval [0, 1]. We give an overview of the order of convergence, which depends on the smoothness of the involved functions. In particular, we consider the Nystr¨om methods based on the so called Generalized Bernstein quadrature rule, on a Romberg scheme and on the so-called IMT rule. We prove that the proposed methods are convergent, stable and well conditioned. Also, we give several numerical tests for comparing these three methods
1 June 2000 in Integral Equations and Operator Theory
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.
1 November 2011 in Applied Mathematics and Computation