Each of these rules will be called a Gauss-Christoffel quadrature formula if it has maximum degree of exactness, i.e. if (1.1) is an exact equality whenever / is a polynomial of degree 2n — 1. It is a well-known fact, due to Christoffel [3], that such quadrature formulas exist uniquely, provided the weight function w(x) is nonnegative, integrable with /* w(x)dx > 0, and such that all its moments

The existence and uniqueness of the Gaussian interval quadrature formula with respect to the Hermite weight function on R is proved. Similar results have been recently obtained for the Jacobi weight on [−1, 1] and for the generalized Laguerre weight on [0,+∞). Numerical construction of the Gauss–Hermite interval quadrature rule is also investigated, and a suitable algorithm is proposed. A few n...

In this paper, we will derive several error inequalities for a quadrature formula with a parameter, which will not only provide some generalizations of the known results, but also give some other interesting quadrature formulae as special cases. Furthermore, sharp upper and lower error bounds for the double error inequalities are obtained. Applications in numerical integration are also given. ©...

In this note, we give some estimate of the generalized quadrature formula of Gauss-Jacobi$$underset{a}{overset{a+eta left( b,aright) }{int }}left( x-aright)^{p}left( a+eta left( b,aright) -xright) ^{q}fleft( xright) dx$$in the cases where $f$ and $left| fright| ^{lambda }$ for $lambda >1$, are $s$-preinvex functions in the second sense.

It is shown how recent ideas on rational Gauss-type quadrature rules can be extended to Gauss-Kronrod, Gauss-Turr an, and Cauchy principal value quadrature rules. Numerical examples illustrate the advantages in accuracy thus achievable. 0. Introduction The idea of constructing quadrature rules that are exact for rational functions with prescribed poles, rather than for polynomials, has received...