Research Article  Open Access
Lu Pan, Xiaoming He, Tao Lü, "High Accuracy Combination Method for Solving the Systems of Nonlinear Volterra Integral and IntegroDifferential Equations with Weakly Singular Kernels of the Second Kind", Mathematical Problems in Engineering, vol. 2010, Article ID 901587, 21 pages, 2010. https://doi.org/10.1155/2010/901587
High Accuracy Combination Method for Solving the Systems of Nonlinear Volterra Integral and IntegroDifferential Equations with Weakly Singular Kernels of the Second Kind
Abstract
This paper presents a high accuracy combination algorithm for solving the systems of nonlinear Volterra integral and integrodifferential equations with weakly singular kernels of the second kind. Two quadrature algorithms for solving the systems are discussed, which possess high accuracy order and the asymptotic expansion of the errors. By means of combination algorithm, we may obtain a numerical solution with higher accuracy order than the original two quadrature algorithms. Moreover an a posteriori error estimation for the algorithm is derived. Both of the theory and the numerical examples show that the algorithm is effective and saves storage capacity and computational cost.
1. Introduction
In this paper, we first consider the following system of differential equations: where , , and , , or 1, as well as , , are continuous functions for and .
The problem (1.1) can be transformed to the following system of nonlinear integral equations: find and satisfying which is a special case of nonlinear Volterra integral system with weakly singular kernels of the second kind where , and is continuous function on and .
Nonlinear Volterra integral and integrodifferential equations with weakly singular kernels of the second kind play important roles in the mathematical modeling of many physical and biological phenomena, particularly in such fields as heat transfer, nuclear reactor dynamics, and thermoelasticity, in which it is necessary to take into account the effect of past history. Plenty of work has been done to develop and analyze numerical methods for solving the Volterra integral and integrodifferential equations with weakly singular kernels of the second kind; see [1–5] and reference therein. The recent progress in this research area has been achieved for the extrapolation method [6], the spline collocation method [7], and the Galerkin method [8, 9]. However, there are few works for solving the systems of these types of equations, which are more important than single equation for many applications. For example, the elastodynamic problems for piezoelectric and pyroelectric hollow cylinders under radial deformation can be successfully transformed into a system of two second kind Volterra integral equations.
The combination method as an accelerating convergence technique for solving integral equations was firstly presented in 1984 [10]. Similar to the extrapolation method, the combination method combines several approximations to obtain an approximation of higher accuracy. One important advantage of the extrapolation method and the combination method is parallel computation since those original approximations can be computed independently. However, the extrapolation method uses a coarse grid and some finer grids. We must do much more work on the finer grids than the coarse one, which lowers the degree of parallelism. On the other hand, the loads of computing the approximations in the combination method are close to each other. Hence the combination method is an efficient parallel method to obtain an approximation of high accuracy with a high degree of parallelism. Recently this method has been used to solve the first kind Abel integral equations [11]. In this paper, we will apply the high accuracy combination method for solving the systems of nonlinear Volterra integral and integrodifferential equations with weakly singular kernels of the second kind, for which there are few results, even for the general convergence to be proved in Section 4 of this paper.
In this paper, based on Lyness's [12] modified midpoint rectangular quadrature rule and modified trapezoidal quadrature rule, we will construct two quadrature methods to solve the systems. By means of the asymptotic expansions of the errors for both algorithms, we present a high accuracy combination algorithm. Then by using the generalization of discrete Gronwall inequality [13], the convergence rate, stability, and the asymptotic expansion of the error of the combination approximate solution are proved. Comparing to other algorithms, for example, extrapolation methods [6, 14], the combination algorithm has the advantage of less computation complexity because both of the modified midpoint rectangular quadrature rule and the modified trapezoidal quadrature rule have the same step size. Moreover an a posteriori error estimation is obtained, by which we can rectify the accuracy of our algorithm in processing.
2. Existence and Uniqueness of the Solution
Since the uniqueness, existence, and numerical methods of (1.2) can be decided by (1.1), we only discuss the problem (1.3) in the following.
Let satisfy Lipschitz condition (A): then there is a unique solution in (1.3). In fact , and We can choose such that . Thus we have Let be a continuous function space which maps into and let be a mapping from to itself. Then we have where , and where , which is due to .
Lemma 2.1. Suppose that condition (A) is satisfied, then there is a unique solution to (1.3).
Proof. Assume that and are two different solutions to (1.3). Defining , we get
Therefore using Gronwall inequality, we get , which leads to the uniqueness.
In order to prove existence, we use a simple iterative process: let , and
Now we will prove that is a convergent sequence. Let
then from (2.6) and (2.4) we get
where denotes convolution, , and .
Taking Laplace transformation, we can easily deduce that
Taking inverse Laplace transformation, we get
Note that for , we have
or
But using (2.10), we easily prove that
is a convergent series, which means that
and is the solution to (1.2).
3. The Numerical Methods
In this section two quadrature algorithms which are based on [12] will be given to solve the systems. Consider the weakly singular integral and Navot's modified trapezoidal rule [15] There is an error estimate as follows: We differentiate with respect to in (3.3) and get Then we have such that Thus we have Equations (3.5) and (3.6) are the integral functions with logarithm singularity and their modified trapezoidal rule, and (3.7) is an asymptotic expansion of the error.
From [16], we have the modified midpoint rectangular rule Hence we get From (3.4)–(3.7), we get More generally we have Therefore from (3.7) and (3.10), if , we get or Note that the combination has a high accuracy order , which is higher than in (3.7) and (3.10).
If , in (3.5), then where , and (3.13) becomes Using (3.14) and (3.15), we can construct two algorithms for solving Volterra integral system of equations. Since the kernels of the systems are weakly singular, the following Navot's quadrature rule is used. Setting , we get Now we recall the following lemma from [8].
Lemma 3.1. Let , , , , then modified trapezoidal rule has an asymptotic error expansion where , , and are RiemannZeta function and its derivative function, and are Bernoulli numbers.
From the above, we obtain the following discrete system of equations for modified trapezoidal quadrature method: where , , , , and
On the other hand, we also obtain the discrete system for modified midpoint rectangular quadrature method where
Because the discrete system is nonlinear diagonal system of equations, we introduce the following iterative algorithms.
Algorithm 3.2 (modified trapezoidal quadrature method). We have the following steps.Step 1. Take sufficiently small and let and .Step 2. Compute in parallel by the following simple iteration: where , , and is defined by (3.20).Step 3. If , then let and stop the iteration, otherwise set , go to Step 2.
Algorithm 3.3 (modified midpoint rectangular quadrature method). We have the following steps.Step 1. Take sufficiently small and let and .Step 2. Compute in parallel by the following simple iteration: where , , and is defined by (3.22).Step 3. If , then let and stop the iteration, otherwise set , go to Step 2.
4. Convergence and Error Estimation
In this section we will analyze the convergence of Algorithm 3.2 proposed in Section 3. The proof of convergence rate of Algorithm 3.3 is similar. When , the system can be expressed as By Lemma 3.1, the remainder has the following estimate: where and .
Letting and be the solution of the discrete equations, we derive
Lemma 4.1. Suppose that the sequence satisfies where , , , and is sufficiently small such that . Then where , , and .
Theorem 4.2. Assume that is sufficiently small, then the system of the nonlinear discrete equation (3.19) has a unique solution and the simple iteration (3.24) is geometrically convergent.
Proof. Firstly, if and are solutions to (3.19), then satisfies the inequality
where we use . Note that , then we easily deduce that
where .
If is sufficiently small such that , we have
Then by Lemma 4.1, we get , . Hence the uniqueness is shown.
Secondly, from the iteration (3.24) we have
Then
where . We assume that is small enough such that . Thus we prove that the simple iteration (3.24) is geometrically convergent, and its limit is the unique solution of (3.19).
Theorem 4.3. There is a positive constant independent of such that where is defined in Algorithm 3.2.
Proof. Letting , we get By Algorithm 3.2 and Lipschitz condition, we have Using Lemma 3.1, we get .
Theorem 4.4. There is a positive constant independent of such that the errors have the following error bound:
Proof. Taking , we get If is sufficiently small such that , we have Using inequality (4.5), we can get
Corollary 4.5. Assume that in Algorithm 3.2, one can obtain the estimate
5. Asymptotic Expansion, Combination, and a Posteriori Error Estimate
In the following we only derive the asymptotic expansions of the errors and the a posteriori error estimation of Algorithm 3.2. For Algorithm 3.3 we just simply present the corresponding result.
From Lemma 3.1 and (4.1) by using Taylor's expansion, we have where , , and
For , we have Here , .
Using Theorem 4.4 and Taylor's expansion, we get where we assume that is derivable for , and let Then Obviously if , then .
Now we construct the following auxiliary system of linear Volterra integral equations: find satisfying and their discrete system of equations: find satisfying From Theorem 4.4, we have Substituting (5.8) and (5.7) into (5.6), we get Note that . Using Lemma 4.1, we get From (5.9) we obtain where if . Similarly for Algorithm 3.3 we have or where if and From the above discussion, we have proved the following theorem for the combination method.
Theorem 5.1.
(1) If , then
Furthermore, one has the following a posteriori error estimate:
That is, one can estimate the average errors by .
(2) If , then
Hence one can obtain a high order of accuracy, which is better than One also easily deduces that the modified midpoint rectangular quadrature method is better than modified trapezoidal quadrature method when .
6. Numerical Examples
In this section, we present two numerical examples to illustrate the features of the combination method discussed in this paper. Let denote the error of modified trapezoidal quadrature method, the error of modified midpoint rectangular quadrature method, and the error of combination method.
Example 6.1. Consider the following system of integral equations with algebraic singularity:
with the exact solution , .
The errors of the approximation solutions obtained by Algorithms 3.2 and 3.3 and their combination are presented in Tables 1, 2, 3, and 4. Numerical results show that the combination method has higher order convergence rate than the two original algorithms. Tables 1–4 also show that the error ratios of Algorithms 3.2 and 3.3 are close to the theoretic value, which is and the error ratio of the combination method is better than the .
