Weighted quadrature rules with weight function on [0, ∞)
Introduction
Let us start our discussion with the following differential equation:which is known as the generic equation of classical orthogonal polynomials of degree n. If this equation is written in self-adjoint form, then the first order equation:is derived. The solution of (2) is known as the Pearson distributions family [4] and can be indicated aswhere d∗ = d − 2a and e∗ = e − b.
As a special case, let us consider the values a = 1, b = 0, c = 0, d = 2 − p and e = 1. Replacing these values in (1) gives the equation:If (4) is solved the polynomial solutionis derived. According to [7], these polynomials are orthogonal with respect to the weight function on [0, ∞) if and only if:In other words, we have:if and only if: m, n = 0, 1, 2, … , N < (p − 1)/2, . Moreover, they satisfy the three term recurrence relation:where: and .
Here we mention that the polynomials are suitable tool to use in the functions approximation theory, provided that those functions satisfy the Dirichlet conditions. Let us consider an example to clarify our purpose.
Suppose n = 3 and p > 7 in the orthogonal polynomials . The arbitrary function f(x) can be approximated byin whichOne observes that the finite set , is a basis space for all polynomials of degree at most three. In other words, if f(x) = a3x3 + a2x2 + a1x + a0 is assumed, then the approximation (9) will be exact.
By noting this comment, we can now propound an application of polynomials in the numerical integration theory by a straightforward example. We would like to find an analytical two-point formula as follows:provided that p > 5. According to explained themes, (11) must be exact for the basis f(x) = xj; j = 0, 1, 2, 3 if and only if x1, x2 are two roots of . For instance, if , then we getin which and are zeros of and w1, w2 are obtained from the linear system:Solving (13) eventually gives the two-point formula as follows:which is exact for any arbitrary polynomial of degree at most three.
Section snippets
Application of introduced orthogonal polynomials in quadrature rules in general case
As we know the main form of Gauss quadrature rules is given by:where the weights , and nodes are unknowns and the nodes are predetermined. w is [1], [3], [5] also a positive measure on [a, b].
The residue Rn,m[f] is determined (see for instance [8]) by:It can be shown that Rn,m[f] = 0, for any linear combination of the sequence {1, x, … , x2n+m−1} if and only
Examples
Example 1 Since we presented a 2-point formula in relation (14), it is better now to propound a 3-point integration formula. For this purpose, according to the main relation (7), the condition p > 7 must be satisfied in order that one can use a 3-point formula. By noting this fact, suppose p = 8. Hence we have:whereand x1 =
Numerical results
In this section we consider some numerical examples. First, the results obtained by the 2-point formula (14) are presented in Table 1. Then, we have the resutls using the 3-point formula for Example 1 in Table 2. And finally, the results obtained by the 4-point formula for Example 2 are given in Table 3.
Conclusion
In this paper, an approach was introduced to estimate a finite class of weighted quadrature rules with the weight function on [0,∞). The advantages of presented formulas were also discussed. Some analytical examples were finally given and compared.
References (8)
- et al.
On numerical improvement of closed Newton-Cotes quadrature rules
Appl. Math. Comput.
(2005) - et al.
Methods of Numerical Integration
(1984) Construction of Gauss–Christoffel quadrature formulas
Math. Comp.
(1968)Orthogonal polynomials-construction theory and applications
J. Comp. Appl. Math.
(1985)