New conformal map for the trapezoidal formula for infinite integrals of unilateral rapidly decreasing functions111This work was partially supported by JSPS Grant-in-Aid for Young Scientists (B) JP17K14147.
Abstract
While the trapezoidal formula can attain exponential convergence when applied to infinite integrals of bilateral rapidly decreasing functions, it is not capable of this in the case of unilateral rapidly decreasing functions. To address this issue, Stenger proposed the application of a conformal map to the integrand such that it transforms into bilateral rapidly decreasing functions. Okayama and Hanada modified the conformal map and provided a rigorous error bound for the modified formula. This paper proposes a further improved conformal map, with two rigorous error bounds provided for the improved formula. Numerical examples comparing the proposed and existing formulas are also given.
keywords:
trapezoidal formula, Conformal map, Computable error boundMSC:
[2010] 65D30 , 65D32 , 65G201 Introduction and summary
In this paper, we are concerned with the trapezoidal formula for the infinite integral, expressed as
where is a mesh size. This approximation formula is fairly accurate if the integrand is analytic, which has been known since several decades ago [6, 7]. For example, the approximation
gives the correct answer in double-precision with , and the approximation
gives the correct answer in double-precision with . In general, however, the infinite sum on the right-hand side cannot be calculated, and thus, the sum has to be truncated at some and as
In the case where , this approximation requires and to obtain the correct answer in double-precision. On the other hand, in the case where , this approximation requires and to obtain the correct answer in double-precision. This is because is a rapidly decreasing function, i.e., decays exponentially as , whereas is not.
In the case where the integrand is not a rapidly decreasing function, a useful solution is the application of an appropriate conformal map before applying the (truncated) trapezoidal formula. When decays algebraically as like , by applying a conformal map , a new integral is obtained:
where the transformed integrand decays exponentially as . Therefore, the (truncated) trapezoidal formula should yield an accurate result when applied to the new integral. Appropriate conformal maps for certain typical cases have been usefully summarized by Stenger [8, 9].
One of the cases listed in the summary is rather convoluted: the integrand decays exponentially as , but decays algebraically as , like . We refer to such a function as a unilateral rapidly decreasing function. In such a case, Stenger [9] proposed the employment of a conformal map
and applied the trapezoidal formula as
(1) |
Furthermore, by appropriately setting , , and depending on the given positive integer , he theoretically analyzed the error as , where indicates the decay rate of the transformed integrand, and indicates the width of the domain in which the transformed integrand is analytic (described in detail further on). Okayama and Hanada [2] slightly modified the conformal map as follows:
and derived a new approximation formula:
(2) |
Furthermore, they theoretically showed that the error of the modified formula, say , is bounded by
(3) |
where , and is explicitly given in a computable form. This inequality not only shows that the modified formula (2) can attain faster convergence than (1), but it also indicates that the error can be rigorously estimated by the right-hand side. This is useful for verified numerical integration.
The present work improves upon their results. Rather than the conformal map or , we propose a new conformal map
The principle of this conformal map is derived from the fact that the convergence rate is improved by replacing with in some fields [1, 3, 5]. Consequently, the following approximation formula is derived:
(4) |
Furthermore, as the main contribution of this work, we provide two (general and special) theoretical error bounds in the same form as (3), where does not change, but a larger can be taken as compared to that in the previous studies. This indicates that the improved formula (4) can attain faster convergence than (1) and (2).
2 Summary of existing and new results
Sections 2.1 and 2.2 describe the existing results, and Sections 2.3 and 2.4 describe the new results. First, the relevant notations are introduced. Let be a strip domain defined by for . Furthermore, let and .
2.1 Error analysis of Stenger’s formula
An error analysis for Stenger’s formula (1) can be expressed as the following theorem, which is a restatement of an existing theorem [9, Theorem 1.5.16].
Theorem 2.1 (Okayama–Hanada [2, Theorem 2.1])
Assume that is analytic in with , and that there exist positive constants , , and such that
(5) | ||||
holds for all , and | ||||
(6) |
holds for all . Let , let and be defined as
(7) |
and let be defined as
(8) |
Then, there exists a constant independent of , such that
2.2 Error bound for the formula by Okayama and Hanada
Okayama and Hanada [2] proposed the replacement of with in Stenger’s formula (1). They also provided the following theoretical error bound for the modified formula (2).
Theorem 2.2 (Okayama–Hanada [2, Theorem 2.2])
In Theorem 2.2, the condition (5) is modified to (9), and the condition (6) is modified to (10). The former constitutes the most significant difference, because in Theorem 2.2 can be two times greater than that in Theorem 2.1, while remains unchanged. Owing to the difference, in Theorem 2.2 may be greater than that in Theorem 2.1, which affects the convergence rate .
Another difference between Theorems 2.1 and 2.2 lies in the constants on the right-hand side of the inequalities. All the constants in Theorem 2.2 are explicitly revealed, and the right-hand side can be computed to provide an error bound. This paper provides two error bounds for the improved formula (4) in the same manner as Theorem 2.2.
2.3 General error bound for the proposed formula
As a general case, we present the following error bound for the improved formula (4). The proof is given in Section 4.
Theorem 2.3
The crucial difference between Theorems 2.2 and 2.3 is the upper bound of ; in Theorem 2.2, whereas in Theorem 2.3. This implies that in the new approximation (4), may be greater than in the previous approximation (2). In this case, the convergence rate is improved (note that is not changed between the two theorems).
2.4 Special error bound for the proposed formula
As a special case, restricting the range of to , we present the following error bound for the improved formula (4). The proof is given in Section 5.
Theorem 2.4
In this theorem, the upper bound of is , which is smaller than that in Theorem 2.3 (). This is because the condition (6) is changed to (13), where (put ) has zero points at . However, the constants and are considerably smaller than and , respectively (comparing the first term). Therefore, Theorem 2.4 is useful for attaining a sharp error bound rather than a large upper bound of . It must be noted here that is still greater than in Theorems 2.1 and 2.2.
3 Numerical examples
This section presents the numerical results obtained in this study. All the programs were written in C language with double-precision floating-point arithmetic. The following three integrals are considered:
(16) | ||||
(17) | ||||
(18) |
where is the exponential integral defined by , is the cosine integral defined by , and is the sine integral defined by . The third integral (18) is taken from the previous study [2].
The integrand in (16) satisfies the assumptions of Theorems 2.1, 2.2, 2.3, and 2.4 with the parameters shown in Table 1. In Theorem 2.1, is not investigated since is not used for computation. In Theorems 2.1 and 2.2, is taken as since . In Theorem 2.3, is taken as since . In Theorem 2.4, is taken as since . The results are shown in Figure 1. As seen in the graph, the proposed formula with shows the fastest convergence as compared to the others. However, the corresponding error bound by Theorem 2.3 is relatively large, because the constant in (11) is large. In contrast, Theorem 2.4 produces a sharp error for the proposed formula with , although the convergence rate is slightly worse than that from Theorem 2.3.
The integrand in (17) satisfies the assumptions of Theorems 2.1, 2.2, 2.3, and 2.4 with the parameters shown in Table 2. In this case, must satisfy in Theorem 2.3, due to the singular points of . The results are shown in Figure 2. As seen in the graph, the proposed formula with shows the fastest convergence as compared to the others. Note that in this example, Theorem 2.3 and Theorem 2.4 have the same values, and thus, their approximation formulas are exactly the same. As for the error bound, Theorem 2.4 produces a sharper error than Theorem 2.3 in this case as well.
The integrand in (18) satisfies the assumptions of Theorems 2.1, 2.2, 2.3, and 2.4 with the parameters shown in Table 3. In this case, must satisfy in both Theorems 2.3 and 2.4, due to the singular points of . The results are shown in Figure 3. As seen in the graph, all formulas show a similar convergence rate, mainly because all formulas use the same value of . Approximation formulas of Theorem 2.3 and Theorem 2.4 are exactly the same, but Theorem 2.4 produces a sharper error than Theorem 2.3 in this case as well.
4 Proofs for Theorem 2.3
This section presents the proof of Theorem 2.3. It is organized as follows. In Section 4.1, the task is decomposed into two lemmas: Lemmas 4.2 and 4.3. To prove these lemmas, useful inequalities are presented in Sections 4.2, 4.3, 4.4, and 4.5. Following this, Lemma 4.2 is proved in Section 4.6, and Lemma 4.3 is proved in Section 4.7.
4.1 Sketch of the proof
Let . The main strategy in the proof of Theorem 2.3 is to split the error into two terms as follows:
(19) |
The first and second terms are called the discretization error and truncation error, respectively. The following function space is important for bounding the discretization error.
Definition 4.1
Let be a rectangular domain defined for by
Then, denotes the family of all functions that are analytic in such that the norm is finite, where
For functions belonging to this function space, the discretization error is estimated as follows.
Theorem 4.1 (Stenger [8, Theorem 3.2.1])
Let . Then,
In this paper, we show the following lemma, which completes estimation of the discretization error. The proof is given in Section 4.6.
Lemma 4.2
In addition, we bound the truncation error as follows. The proof is given in Section 4.7.
Lemma 4.3
4.2 Useful inequalities on
We prepare two lemmas here.
Lemma 4.4 (Okayama et al. [5, Lemma 4.7])
We have
(20) |
Lemma 4.5
We have
(21) |
Proof 1
Integrating both sides of the obvious inequality
we have
In the same manner, integrating both sides of the above inequality, we have
Here, putting , we rewrite the inequality as
which is equivalent to the desired inequality (21).
4.3 Useful inequalities on
We prepare three lemmas here. Note that denotes the closure of .
Lemma 4.6
It holds for all that
(22) |
Proof 2
Let where and are real numbers with and . By the definition of , it holds that
Since and monotonically increase with respect to , we have
Furthermore, using
and putting , we have
From and (21), we have
where
Since , it holds that
Therefore, monotonically increases, from which we have . This completes the proof.
Lemma 4.7
It holds for all that
(23) |
Proof 3
Lemma 4.8
It holds for all that
(24) |
Proof 4
4.4 Useful inequality on
We prepare the following lemma here.
Lemma 4.9
It holds for all that
(25) |
Proof 5
By the definition of , it holds that
Let where and are real numbers with and . Then, we have
from which we have . Therefore, it holds that
which is further bounded as
This completes the proof.
4.5 Useful inequalities on
We prepare four lemmas here.
Lemma 4.10 (Okayama et al. [5, Lemma 4.6])
It holds for all that
(26) |
where .
Lemma 4.11 (Okayama et al. [4, Lemma 4.21])
For all and , putting , we have
(27) | ||||
(28) |
Lemma 4.12 (Three lines lemma, cf. [Stein-Shakarchi, p. 133])
Let be analytic and bounded in and continuous on . Let . Then, we have
Lemma 4.13
Let be a constant satisfying . For all and , we have
(29) | ||||
(30) |
where .
Proof 6
First, consider (30), which is proved by showing
for all (put ). The derivative of is expressed as
Let be a value that satisfies and , i.e., has its maximum at . Using , we have
Since the function monotonically decreases for , holds (note that ). Thus, it holds that
Next, we show (29). Let
Since the function is analytic and bounded in and continuous on , by Lemma 4.12, we obtain (29) if we show the following two inequalities:
where . We show only the first one, because the second one is also shown in the same way. Putting , holds, and thus, in what follows we prove
(31) |
We consider the following two cases: (a) and (b) . In case (a), we have
Here, if we put , then we have , where . Since for , monotonically increases for . Therefore, holds, from which we have for , i.e., monotonically increases for . Thus, from , we have (31) as
In case (b), from (27), it holds that
(32) |
Using this, we have
Furthermore, since decreases monotonically for , we have (31). This completes the proof.
4.6 Estimation of the discretization error (proof of Lemma 4.2)
Lemma 4.2 is shown as follows.
Proof 7
Let . Since is analytic in , is analytic in . In addition, since is analytic in , is analytic in (note that ). Therefore, the remaining task is to show . From (9), by using (23) and (24), it holds for all that
(33) |
Furthermore, from (10), by using (25), (26), and (29), it holds for all that
(34) |
where and . By definition, is expressed as
(35) |
Using (27), (28), and (33), we can bound the second term as
from which we have
In the same manner, with regard to the fourth term of (35), using (27), (28), and (34), we have
Therefore, is expressed as
With regard to the first term, using (27), (28), and (34), we have
The integral is further bounded as
In the same manner, the third term is bounded as
With regard to the second term, using (27), (28), and (33), we have
In the same manner, the fourth term is bounded as
Thus, we have .
4.7 Estimation of the truncation error (proof of Lemma 4.3)
Lemma 4.3 is shown as follows.
5 Proofs for Theorem 2.4
This section presents the proof of Theorem 2.4. It is organized as follows. In Section 5.1, the task is decomposed into two lemmas: Lemmas 5.1 and 5.2. To prove these lemmas, a useful inequality is presented in Section 5.2. Then, Lemma 5.1 is proved in Section 5.3, and Lemma 5.2 is proved in Section 5.4.
5.1 Sketch of the proof
The main strategy in the proof of Theorem 2.4 is identical to that of Theorem 2.3, that is, splitting the error into the discretization error and the truncation error as (19). For the discretization error, we show the following lemma. The proof is given in Section 5.3.
Lemma 5.1
In addition, we bound the truncation error as follows. The proof is given in Section 5.4.
Lemma 5.2
5.2 Useful inequality on
We prepare the following lemma here.
Lemma 5.3
Let be a constant satisfying . For all and , we have
(36) | ||||
(37) |
where .
Proof 9
First, consider (37), which is proved by showing
for all (put ). Differentiating , we have
since holds. Therefore, decreases monotonically, and thus, it holds that .
Next, we show (36). Let . Since the function is analytic and bounded in and continuous on , by Lemma 4.12, we obtain (36) if we show the following two inequalities:
where . We show only the first one, because the second one is also shown in the same way. Putting , holds, and thus, in what follows we prove
(38) |
We consider the following two cases: (a) and (b) . In case (a), we have
Here, if we put , then we have , where . Since for , monotonically increases for . Therefore, holds, from which we have for , i.e., monotonically increases for . Thus, from , we have (38) as
In case (b), using (32), we have
Furthermore, since decreases monotonically for , we have (38). This completes the proof.
5.3 Estimation of the discretization error (proof of Lemma 5.1)
Lemma 5.1 is essentially shown by the following lemma, which holds for (not only ).
Lemma 5.4
Assume that is analytic in with , and that there exist positive constants , , , and such that
(39) | ||||
holds for all , and | ||||
(40) |
holds for all . Then, belongs to , and is bounded as
(41) |
where .
Proof 10
Since is analytic on , the remaining task is to show (41). From (39), by using (23), it holds for all that
(42) |
Furthermore, from (40), by using (25) and (26), it holds for all that
(43) |
where . As described earlier, is expressed as (35). Using (27) and (42), we have
from which we have
In the same manner, using (28) and (43), we have
Therefore, is expressed as
With regard to the first term, using (28) and (43), we have
The integral is further bounded as
In the same manner, the third term is bounded as
With regard to the second term, using (27) and (42), we have
In the same manner, the fourth term is bounded as
Thus, we obtain (41).
Using this lemma, Lemma 5.1 is shown as follows.
Proof 11
Let . Since is analytic in , is analytic in . In addition, since is analytic in , is analytic in (note that ). Therefore, the remaining task is to show . Using (28), we have
for all . Therefore, from (9), by using (24), it holds for all that
where . Furthermore, from (13), by using (36), it holds for all that
Thus, the assumptions of Lemma 5.4 are fulfilled with and
from which we have .
5.4 Estimation of the truncation error (proof of Lemma 5.2)
Lemma 5.2 is essentially shown by the following lemma.
Lemma 5.5
Assume that there exist positive constants , , , and such that
(44) | ||||
holds for all , and | ||||
(45) |
holds for all . Let , and let and be defined as (7). Then, we have
(46) |
Proof 12
Using this lemma, Lemma 5.2 is shown as follows.
References
- Hara and Okayama [2017] R. Hara, T. Okayama, Explicit error bound for Muhammad–Mori’s SE-Sinc indefinite integration formula over the semi-infinite interval, in: Proceedings of the 2017 International Symposium on Nonlinear Theory and its Applications, pp. 677–680.
- Okayama and Hanada [2020] T. Okayama, S. Hanada, A modified Stenger’s quadrature formula for infinite integrals of unilateral rapidly decreasing functions and its theoretical error bound, Mathematics and Computers in Simulation (2020). DOI: 10.1016/j.matcom.2020.03.006.
- Okayama and Machida [2017] T. Okayama, K. Machida, Error estimate with explicit constants for the trapezoidal formula combined with Muhammad–Mori’s SE transformation for the semi-infinite interval, JSIAM Letters 9 (2017) 45–47.
- Okayama et al. [2013] T. Okayama, T. Matsuo, M. Sugihara, Error estimates with explicit constants for Sinc approximation, Sinc quadrature and Sinc indefinite integration, Numerische Mathematik 124 (2013) 361–394.
- Okayama et al. [2020] T. Okayama, Y. Shintaku, E. Katsuura, New conformal map for the Sinc approximation for exponentially decaying functions over the semi-infinite interval, Journal of Computational and Applied Mathematics 373 (2020) 112358.
- Schwartz [1969] C. Schwartz, Numerical integration of analytic functions, Journal of Computational Physics 4 (1969) 19–29.
- Stenger [1973] F. Stenger, Integration formulae based on the trapezoidal formula, Journal of the Institute of Mathematics and its Applications 12 (1973) 103–114.
- Stenger [1993] F. Stenger, Numerical Methods Based on Sinc and Analytic Functions, Springer-Verlag, New York, 1993.
- Stenger [2011] F. Stenger, Handbook of Sinc Numerical Methods, CRC Press, Boca Raton, FL, 2011.