Search

The paper deals with the numerical approximation of integrals of the type I ( f , y ) : = ∫ − 1 1 f ( x ) k ( x , y ) d x , y ∈ S ⊂ R where f is a smooth function and the kernel k ( x , y ) involves some kinds of “pathologies” (for instance, weak singularities, high oscillations and/or endpoint algebraic singularities). We introduce and study a product integration rule obtained by interpolating f by an extended Lagrange polynomial based on Jacobi zeros. We prove that the rule is stable and convergent with the order of the best polynomial approximation of f in suitable function spaces. Moreover, we derive a general recurrence relation for the new modified moments appearing in the coefficients of the rule, just using the knowledge of the usual modified moments. The new quadrature sequence, suitable combined with the ordinary product rule, allows to obtain a “mixed” quadrature scheme, significantly reducing the number of involved samples of f. Numerical examples are provided in order to support the theoretical results and to show the efficiency of the procedure.

Let w ( x ) = e − x β x α , w ¯ ( x ) = x w ( x ) and let { p m ( w ) } m , { p m ( w ¯ ) } m be the corresponding sequences of orthonormal polynomials. Since the zeros of p m + 1 ( w ) interlace those of p m ( w ¯ ) , it makes sense to construct an interpolation process essentially based on the zeros of Q 2 m + 1 : = p m + 1 ( w ) p m ( w ¯ ) , which is called “Extended Lagrange Interpolation”. In this paper the convergence of this interpolation process is studied in suitable weighted L 1 spaces, in a general framework which completes the results given by the same authors in weighted L u p ( ( 0 , + ∞ ) ) , 1 ≤ p ≤ ∞ (see [31] , [28] ). As an application of the theoretical results, an extended product integration rule, based on the aforesaid Lagrange process, is proposed in order to compute integrals of the type ∫ 0 + ∞ f ( x ) k ( x , y ) u ( x ) d x , u ( x ) = e − x β x γ ( 1 + x ) λ , γ > − 1 , λ ∈ R + , where the kernel k ( x , y ) can be of different kinds. The rule, which is stable and fast convergent, is used in order to construct a computational scheme involving the single product integration rule studied in [23] . It is shown that the “compound quadrature sequence” represents an efficient proposal for saving 1/3 of the evaluations of the function f, under unchanged speed of convergence.