Abstract
The n-point Gauss quadrature rule states that∫- 11 f (x) ω (x) d x = underover(∑, i = 1, n) wi f (zi) + Rn (f),where zi and wi, i = 1, ..., n, are called, respectively, the Gaussian nodes and weights. It is known that the formula is exact of degree 2 n - 1. We provide an extension of this rule by considering x = - 1 and 1 as the pre-assigned nodes of certain order n1 and n2, respectively. For this, we construct interpolating orthogonal polynomials that make the suggested rule capable of utilizing the maximum information related to the value and derivatives of the integrand f at these points. Our proposed rule is different from Gauss-Lobatto and Gauss-Radau quadrature formulae, which also take care of these points to a certain extent. The results related to the degree of exactness and convergence are also presented. Some questions related to our proposed rule which may require further investigation are narrated as well.
| Original language | English |
|---|---|
| Pages (from-to) | 637-645 |
| Number of pages | 9 |
| Journal | Journal of the Franklin Institute |
| Volume | 344 |
| Issue number | 5 |
| DOIs | |
| State | Published - Aug 2007 |
Keywords
- 3-Term recurrence relation
- Convergence
- Degree of exactness
- Gauss quadrature rule
- Hermite interpolation
- Interpolating orthogonal polynomials
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Computer Networks and Communications
- Applied Mathematics