An Upper Bound Estimate and Stability for the Global Error of Numerical Integration Using Double Exponential Transformation
The double exponential formula was introduced for calculating definite integrals with singular point oscillation functions and Fourier integral. The double exponential transformation is not only useful for numerical computations but it is also used in different methods of Sinc theory. In this paper we give an upper bound estimate for the error of double exponential transformation. By improving integral estimates having singular final points, in theorem 1 we prove that the method is convergent and the rate of convergence is where h is a step size. Our main tool in the proof is DE formula in Sinc theory. The advantage of our method is that the time and space complexity is drastically reduced. Furthermore, we discovered upper bound error in DE formula independent of N truncated number, as a matter of fact we proved stability. Numerical tests are presented to verify the theoretical predictions and confirm the convergence of the numerical solution.
MSC: 65D30, 65D32.
Keyword: numerical integral, double exponential transformation, Sinc theory, quadrature formula.
The double exponential transformations (DE) is used for evaluation of integrals of an analytic function has end point singularity. Our innovation has discovered the upper bound error in DE formula independent of N truncated number, therefore we proved stability. First we introduce double exponential transformation method. The main idea in this method change the variable by a function which transforms the interval of integration change to . In section 1 we had provided background introduced the results of reference  and in section 3 we presents our main results in theorem 1 and provide numerical test to verify our result. Tanaka and Sugihara make full study of function classes for successful DE-Sinc approximations . In  Ooura expanded a double exponential formula for the Fourier transform. Ooura studied animt-type quadrature formula with the same asymptotic performance as the DE-formula . Several scientist studied DE-formula [5-10]. Stenger used DE Formula in Sinc approximations .
2 Double Exponential Transformation
Consider the following integral
where the interval is infinite or half infinite and the function under integral is analytic on and perhaps has singular point in or or both, now consider the change of variables below :
where is analytic on and
Such that after the change of variable the integrand decays double exponential:
By using the trapezoidal formula with mesh size h on (3) we have
The above infinite summation is truncated from to in computing (5) therefore we conclude,
Here the N+ 1 relates to zero point, for example, we have finally 50=25+24+1. What gives us the authority to truncate n numbers from the infinite summation? Indeed quickly approaches zero. An analysis of the graph for small values of t and (4) with c=2 is as follows Graph A shows the double exponential function.
Graph B clearly shows the expansions from both side close to axis x and error growth is slow and arrives at zero as we use the double exponential formula and abbreviate it as DE. For the integral over (-1, 1).
the transformation satisfied and substitute in (5) we have
After using double exponential formula we will obtain
In the next section, we compute the error in (5) with trapezoidal rule and mesh size h.
3 Upper Bound Error, Convergence Rate and Stability of D.E Function
is step size, and is constant, let
class function of f is valid for analytic function has a singularity in first point or end point or both, provided by
then the error estimate
The absolute error in open interval [kh,(k+1)h] using trapezoidal rule is,
In the next relations, the function decreases, therefore ,
On the other hand, we know that and by using the triangle inequality we have:
We know that if then and if then ; if then if then . Note that in (24), decreases because and for the derivation is negative and therefore, the function is also decreasing. By using (24) we have (25). We truncate the infinite summation from to :
There exists such that if then,
Multiplying in both sides of (26) we obtain
This is enough to show that,
so, we need the following lemma with t= kh and which means a =4/c can be used in next lemma . ∎
For and for such we have .
for this we prove that
the discriminant of the quadratic equation
if we put equal to the max root in quadratic equation (34),
Then the statement is satisfied. And note that,
If that is the roots are complex and the coefficient of is positive then for all of t inequality is true Hence we can set and the proof is complete. If we obtain:
In (25) we get:
Now we consider both sums separately.
Put (28) in case1 and use lemma (3.2) to set,
On the other hand we know that for we have,
by using the geometric series we obtain:
therefore (35) gives the following inequality:
we have , and
there exists so that if then and decreases because and for , ; hence .
we infer that
hence the case 1 is completed. ∎
Remark: Note that the upper bound error of theorem 1 is independent of N truncated number that means we proved stability.
If error approaches zero and integrand method is convergence
accuracy is .
By using this method we improve the space complexity and time complexity and we also increase the rate of convergence . In fact, we have found upper bound for global error (u.b.g.e).
4 Numerical Result
In the next example, utilising numerical computation and Maple software to show the result. Assume
The absolute error tolerance is where is the number of function evaluations and abs. error is the actual absolute error of the result and it gives an approximate value which is correct up to 16 significant digits.
Elapsed time is seconds.
TABLE 1 comparison
Comparison of the efficiency of DEFINT and ubge. The absolute error tolerance is where is the number of function evaluations and abs. error is the actual absolute error of the result and it gives an approximate value which is correct up to 16 significant digits .
Considering the performance of convergence rate of quadrature rules by using D.E function, the present formula is suitable for automatic integrator, sinc method, Fourier integral and increases the rate of convergence. It Improves the space complexity and the time complexity and has an important role in numerical analysis.
-  M. Mori , M. Sugihara, The Double Exponential Transformation in Numerical Analysis , Journal Of Computational And Applied Mathematics Vol.127, (2001), 287-299.
-  K. Tanaka, M. Sugihara, K. Murata, Function Classes for Successful DE-Sinc Approximation , Mathematics of Computation,Vol.78 , (2009), 1553-1571.
-  T. Ooura, A Double Exponential Formula for Fourier Transform , RIMS, Kyoto Univ., Vol. 41 , (2005), 971-978.
-  T. Ooura, Animt-Type Quadrature Formula with the Same Asymptotic Performance as the De-Formula , Journal of Computational and Applied Mathematics, Vol. 213 , (2008), 232-239.
-  K. Horiouchi, M.Sugihara, Sinc - Galerkin Method with The Double Exponential Transformation for the Two Point Boundary Problems , Technical Report, Dept. of Mathematical Engineering, University of Tokyo , (1998), 99-105.
-  M.Mori, A.Nurmuhammad, M.Muhammad, De-Sinc Method for Second Order Singularly Perturbed Boundary Value Problems , japan j.Indust.Appl.Math, Vol. 26 , (2009), 41-63.
-  M. Muhammad, A. Nurmuhammad, M. Mori, Numerical Solution of Integral Equations by Means of the Sinc collocation Method Based on the Double Exponential Transformation , Journal of Computational and Applied Mathematics , Vol. 177 , (2005), 269-286.
-  M. Sugihara, Optimality of The Double Exponential Formula âFunctional Analysis Approach , Numer Math, Vol. 75 , (1997).
-  F. Stenger, Numerical Methods Based on Sinc and Analytic Functions , (1993).
-  T. Koshihara, M. Sugihara, Optimality of The Double Exponential Formula âFunctional Analysis Approach , Numer Math, Vol. 75Proceedings Of The 1996 Annual Meeting Of The Japan Society For Industrial And Applied Mathematics , (1996).
-  O. Khatibi, A. Khatibi, Criteria for the Application of Double Exponential Transformation , arXive, Preprints.