The Stability of the Gauss-Laguerre Rule for Cauchy P.V. Integrals on the Half Line

Abstract

In this paper, the authors give a different and more precise analysis of the stability of the classical Gauss-Laguerre quadrature rule for the Cauchy P.V. integrals on the half line. Moreover, in order to obtain this result they give some new estimates for the distance of the zeros of the Laguerre polynomials that can be useful also in other contests.

Share and Cite:

Capobianco, M. and Criscuolo, G. (2023) The Stability of the Gauss-Laguerre Rule for Cauchy P.V. Integrals on the Half Line. American Journal of Computational Mathematics, 13, 505-511. doi: 10.4236/ajcm.2023.134027.

1. Introduction

A careful analysis of Gauss-Laguerre formulas for ordinary integrals can be found in [1] . The present paper is instead aimed at the use of the Gauss-Laguerre formulas for the approximation of the Cauchy principal value integrals. The main results on the topic can be found in [2] (see also the references therein). The aim of the present paper is to give the upper bound of the stability factor when this kind of quadrature rule is used.

We consider the class of singular principal value integrals

H ( f w α ; t ) = 0 f ( x ) x t w α ( x ) d x = lim ε = 0 + f ( x ) x t w α ( x ) d x , t > 0 , (1)

where f satisfies the smoothness conditions

f C w α 0 : = { f C 0 [ 0 , ) : l i m x f ( x ) w α = 0 } , (2)

and

0 1 u 1 ω ( f ; u ) w α , d u < , (3)

where ω ( f ; . ) w α , is the weighted Ditzian-Lubinsky modulus of smoothness [3] .

We propose a Gauss-Laguerre type quadrature formula to evaluate the singular principal value integral H ( f w α ; t ) defined by (1) assuming that the function f has good integration property at the superior limit of integration interval; this assumption is the same that assures the boundedness of H ( f w α ) . In this first part we study the stability of the proposed procedure with respect to the distance of the singularity t from the quadrature knots. The proposed method to compute (1) is well known in the case of bounded intervals. Even though the fundamental idea is not new, a thorough investigation of this algorithm is of interest since there are significant differences between the case of a bounded interval and the case of an unbounded interval from the point of view of approximation theory.

2. The Stability of Gauss-Laguerre Quadrature Rule

The GL type formula to evaluate H ( f w α ) is constructed by interpolating the function f on x n , k α , k = 1 , , n , and on the singularity t assuming that t x n , k α , k = 1 , , n . Taking into account that such formula can be written

H ( f w α ; t ) = H ( w α ; t ) f ( t ) + k = 1 n λ n , k α f ( x n , k α ) f ( t ) x n , k α t + R n G L ( f ; w α ; t ) = [ H ( w α ; t ) k = 1 n λ n , k α x n , k α t ] f ( t ) + k = 1 n λ n , k α x n , k α t f ( x n , k α ) + R n G L ( f ; w α ; t ) = H n G L ( f ; w α ; t ) + R n G L ( f ; w α ; t ) , (4)

we have

R n G L ( f ; w α ; t ) = R n G L ( f f ( t ) e 1 t ; w α ) .

Therefore, the formula (4) has degree of exactness 2n, i.e. R n G L ( f ; w α ; t ) = 0 whenever f is a polynomial of degree ≤ 2n.

Obviously, from a theoretical point of view, this formula turns out to be convergent if the function f is sufficiently smooth. Furthermore, it has the advantage of simplicity in the computation of the coefficients, but unfortunately it may exhibit numerical cancellation and generally it cannot converge when a knot x n , k α is very close to t. In order to establish a bound of the amplification factor of (4) which depends on the position of t with respect to the points x n , k α , we need some some notations and preliminary lemmas.

If A and B are two expressions depending on some variables, then we write A ~ B if and only if | A B 1 | ± 1 const uniformly for the variables under consideration.

We bring here some properties of the knots x n , k α , k = 1,2, , n and of the Christoffel constants λ n , k α , k = 1,2, , n of the GL formula (4). These properties can be found in [4] and [5] where are proved for a more general class of weight functions.

Let x n , k α , k = 1,2, , n be the zeros of the n-th Laguerre orthogonal polynomial ordered in increasing order. We have

c 1 n < x n , 1 α < x n , 2 α < < x n , n α < 4 n 2 α + 2 c 2 ( 4 n ) 1 3 , (5)

with some constants c 1 and c 2 independent of n 1 and k { 1,2, , n } .

The Christoffel constants λ n , k α , k = 1,2, , n admit the following bounds

λ n , k α ~ x n , k α 4 n x n , k α w α ( x n , k α ) , k { 1,2, , n } , λ n , k α ~ Δ x n , k α w α ( x n , k α ) , k { 2,3, , n } , (6)

uniformly for n 1 and where Δ x n , k α = x n , k α x n , k 1 α .

Let r n = f t n and t n Π n be such that E n ( f ) w α , = min p n Π n ( f p n ) w α = ( f t n ) w α .

For any t > 0 , n N we denote by x n , c α the knot closest to t, defined by

| x n , c α t | = min 1 k n | x n , k α t | .

Lemma 1. We have

k = 2 , k c n Δ x n , k α | x n , k α t | = O ( log e n ) , t > 0.

Proof. It easy seen that

Δ x n , k α | x n , k α t | = O ( 1 ) , k = 2 , , n , k c , t > 0 ,

and

Δ x n , k α Δ x n , k + 1 α = O ( 1 ) , k = 2 , , n 1.

Thus

k = 2 , k c n Δ x n , k α | x n , k α t | = O ( k = 2 c 2 Δ x n , k + 1 α | x n , k α t | ) + k = c + 2 n Δ x n , k α | x n , k α t | + O ( 1 ) = O ( ( x n , 1 α x n , c 1 α + x n , c + 1 α x n , n α ) d x | x t | ) + O ( 1 ) .

Hence performing the integrations we get the lemma. □

Lemma 2. For any t > 0 such that t x n , k α , k = 1, , n , and with some constant C independent of f, n and t,

| k = 1 n λ n , k α x n , k α t r n ( x n , k α ) | C E n ( f ) w α , [ log e n + Δ x n , c α | x n , c α t | w α ( x n , c α ) ] ,

where x n ,0 α = 2 x n ,1 α x n ,2 α .

Proof. We write

| k = 1 n λ n , k α x n , k α t r n ( x n , k α ) | = | k = 1 n λ n , k α w α 1 / 2 ( x n , k α ) x n , k α t r n ( x n , k α ) w α ( x n , k α ) | E n ( f ) w α , [ k = 1 , k c n λ n , k α w α 1 / 2 ( x n , k α ) | x n , k α t | + λ n , c α w α 1 / 2 ( x n , c α ) | x n , c α t | ] . (7)

First, we obtain from (6)

k = 2 , k c n λ n , k α w α 1 / 2 ( x n , k α ) | x n , k α t | C k = 2 , k c n Δ x n , k α | x n , k α t | C log e n . (8)

Here we have used Lemma 1.

Now, if c = 1 then the last sum of (7) is equal to the first sum in (8). On the other hand, if c 1 , we have | t x n ,1 α | Δ x n ,2 α / 2 ; then

λ n ,1 α w α 1 / 2 ( x n ,1 α ) | x n ,1 α t | C .

So, in all cases,

k = 1 , k c n λ n , k α w α 1 / 2 ( x n , k α ) | x n , k α t | C log e n , t > 0. (9)

Finally, again by using (6),

λ n , c α | x n , c α t | w α 1 / 2 ( x n , c α ) ~ Δ x n , c α | x n , c α t | w α ( x n , c α ) , t > 0 , (10)

taking into account the definition of x n ,0 α . Combining (7), (9) and (10) the assertion follows. □

Lemma 3. For any t > 0 such that t x n , k α , k = 1 , , n , and with some constant C independent of f, n and t,

| [ H ( w α ; t ) k = 1 n λ n , k α x n , k α t ] r n ( t ) | C E n ( f ) w α , [ t x n , c α + Δ x n , c α | x n , c α t | ] w α 1 / 2 ( t ) w α ( x n , c α ) ,

where x n ,0 α = 2 x n ,1 α x n ,2 α .

Proof. The lemma has been proved [2] with respect to the Hermite weight. Following the same steps of the proof of the Lemma 3.3 in [2] , it is possible to derive the assertion. Here we omit the details. □

In order to estimate the stability of the GL formula (4), we define

K n G L ( w α ; t ) = | H ( w α ; t ) k = 1 n λ n , k α x n , k α t | + k = 1 n λ n , k α | x n , k α t | , t > 0 , n N .

Theorem 4. For any t > 0 such that t x n , k α , k = 1, , n , and with some constant C independent of n and t,

K n G L ( w α ; t ) C w α ( x n , c α ) { log e n + [ t x n , c α + Δ x n , c α | x n , c α t | ] w α ( x n , c α ) } ,

where x n ,0 α = 2 x n ,1 α x n ,2 α .

Proof. Following the same steps of the proofs of the Lemmas 2 and 3, we have

k = 1 n λ n , k α | x n , k α t | C w α ( x n , c α ) { log e n + Δ x n , c α | x n , c α t | } , t > 0 , (11)

| H ( w α ; t ) k = 1 n λ n , k α x n , k α t | C w α ( x n , c α ) [ t x n , c α + Δ x n , c α | x n , c α t | ] , t > 0 , (12)

respectively. Then, the assertion follows by (11) and (12) taking into account the definition of K n G L ( w α ; t ) . □

Corollary 1. Assume that f C w α 0 , where the space C w α 0 is defined in (2)

and f satisfies the condition (3). If 0 < t ~ n and n are such that t 2 x n , n α x n , n 1 , then

K n G L ( w α ; t ) C log e n ,

with some constant C independent of n and t.

Proof. Taking into account that the assumptions on t and n give x n , c α = x n , n α , we have t / x n , c α ~ 1 and Δ x n , c α / | x n , c α t | 1 . Thus, the assertion follows from Theorem 4. □

Now assume that t > 0 is fixed. In order to specify the bound of the amplification factor K n G L ( w α ; t ) , we need to use a suitable subsequence of { H n ( f ; w α ; t ) } n = 1 . To derive it, the following lemma turns out helpful.

Lemma 5. Let w α ( x ) = x α e x , α > 1 . There exists n 0 such that uniformly for n n 0 , 2 k n ,

x n + 1, k + 1 α x n , k α C 1 a n 1 Δ x n , k α [ x n , k ( a n x n , k α ) ] 1 / 2 , (13)

x n , k α x n + 1, k α C 2 a n 1 Δ x n , k α [ x n , k ( a n x n , k α ) ] 1 / 2 , (14)

where a n ~ n is the Mhaskar-Rakhmanov-Saff number [6] , and C 1 , C 2 are positive constants.

Proof. At first we remark that x n + 1 , 1 α < x n , 1 α < x n + 1 , 2 α < x n , 2 α < < x n + 1 , k α < x n , k α < x n + 1 , k + 1 α < x n , k + 1 α < < x n , n 1 α < x n + 1 , n α < x n , n α < x n + 1 , n + 1 α , (cfr. [5] ).

Let us denote

l n , k ( w α ; x ) = L n ( w α ; x ) L n ( w α ; x n , k α ) ( x x n , k α ) , k = 1 , , n , (15)

the fundamental Lagrange polynomials with respect to the points x n , j α , j = 1, , n , zeros of the n-th Laguerre polynomial L n ( w α ) .

By using the relation

max x a n n 2 | w α ( x ) l n , k ( x ) w α ( x n , k α ) | ~ 1,

(see Theorem 1.3(c) in [7] ), we obtain from (15)

x n + 1, k + 1 α x n , k α C w α ( x n , k α ) w α ( x n + 1, k + 1 α ) | L n ( w α ; x n + 1, k + 1 α ) | | L n ( w α ; x n , k α ) | , k = 1, , n . (16)

By using

| L n ( w α ; x n , k α ) | ~ ( Δ x n , k α ) 1 [ x n , k ( a n x n , k α ) ] 1 / 4 w α ( x n , k α ) , k = 2, , n ,

| L n ( w α ; x n + 1, k + 1 α ) | ~ a n 1 [ x n + 1, k ( a n + 1 x n + 1, k + 1 α ) ] 1 / 4 w α ( x n + 1, k + 1 α ) , k = 1, , n ,

(see Theorem 1.3(a), (b) and Theorem 1.4 in [7] ) and taking into account that x n , k α ~ x n + 1, k + 1 α and a n x n , k α ~ a n + 1 x n + 1, k + 1 α , we obtain (13) from (16). Similarly we can prove (14). □

Assuming that t > 0 is fixed, we define the set

N t = { n N : | x n , c α t | C Δ x n , c α n } ,

where the parameter C > 0 is chosen a priori. Being t fixed we have that x n , c α ( a n x n , c α ) ~ a n . Thus, in view of Lemma 5, we deduce that N t is an infinite set. Indeed, if n N t , then n + 1 N t .

Finally, we remark that to construct the formula we have assumed t x n , k α , k = 1, , n . To derive a rule and the related error bound for all t, it would be of interest to investigate the limit case x n , c α t . Of course, this would require additional assumptions on the function f. However, the restriction t x n , k α , k = 1, , n , does not influence the effective approximation of H ( f w α ; t ) . Indeed, for any fixed t > 0 it is possible to construct the subsequence

{ H n G L ( f ; w α ; t ) } n N t and the related error can be derived.

Corollary 2. If t > 0 is fixed, then

K n G L ( w α ; t ) C n ,

with some constant C independent of n N t .

Proof. The assertion follows from Theorem 4 taking into account the definition of the set N t . □

3. Conclusion

Theorem 4 provides the upper bound of the amplification factor of the Gauss-Laguerre quadrature formula in the case of Cauchy principal value integrals. Corollary 2 instead provides a useful definition of a subsequence of the Gauss-Laguerre formula with respect to which the amplification factor is particularly useful in applications.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Shen, W. (2019) An Introduction to Numerical Computation World Scientific. World Scientific Publishing Company.
https://doi.org/10.1142/11388
[2] Capobianco, M.R., Criscuolo, G. and Giova, R. (2001) A Stable and Convergent Algorithm to Evaluate Hilbert Transform. Numerical Algorithms, 28, 11-26.
https://doi.org/10.1023/A:1014009809919
[3] Ditzian, Z. and Lubinsky, D.S. (1997) Jackson and Smoothness Theorems for Freud Weights. Constructive Approximation, 13, 99-152.
https://doi.org/10.1007/BF02678431
[4] Freud, G. (1971) Orthogonal Polynomials. Pergamon Press, Budapest.
[5] Szegö, G. (1975) Orthogonal Polynomials. American Mathematical Society, Providence, Rhode Island.
[6] Levin, E. and Lubinsky, D.S. (2005) Orthogonal Polynomials for Exponential Weights x2pe-2Q(x) on . Journal of Approximation Theory, 134, 199-256.
https://doi.org/10.1016/j.jat.2005.02.006
[7] Levin, E. and Lubinsky, D.S. (2006) Orthogonal Polynomials for Exponential Weights x2pe-2Q(x) on , II. Journal of Approximation Theory, 139, 107-143.
https://doi.org/10.1016/j.jat.2005.05.010

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.