Volume 2018, Issue 1 8241784
Research Article
Open Access

Stability Analysis of Additive Runge-Kutta Methods for Delay-Integro-Differential Equations

Hongyu Qin

Hongyu Qin

Wenhua College, Wuhan 430074, China

Search for more papers by this author
Zhiyong Wang

Zhiyong Wang

School of Mathematical Sciences, University of Electronic Science and Technology of China, Sichuan 611731, China uestc.edu.cn

Search for more papers by this author
Fumin Zhu

Corresponding Author

Fumin Zhu

College of Economics, Shenzhen University, Shenzhen 518060, China szu.edu.cn

Search for more papers by this author
Jinming Wen

Jinming Wen

Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada M5S3G4, utoronto.ca

Search for more papers by this author
First published: 11 June 2018
Academic Editor: Gaston Mandata N’guérékata

Abstract

This paper is concerned with stability analysis of additive Runge-Kutta methods for delay-integro-differential equations. We show that if the additive Runge-Kutta methods are algebraically stable, the perturbations of the numerical solutions are controlled by the initial perturbations from the system and the methods.

1. Introduction

Spatial discretization of many nonlinear parabolic problems usually gives a class of ordinary differential equations, which have the stiff part and the nonstiff part; see, e.g., [15]. In such cases, the most widely used time-discretizations are the special organized numerical methods, such as the implicit-explicit numerical methods [6, 7], the additive Runge-Kutta methods [812], and the linearized methods [13, 14]. When applying the split numerical methods to numerically solve the equations, it is important to investigate the stability of the numerical methods.

In this paper, it is assumed that the spatial discretization of time-dependent partial differential equations yields the following nonlinear delay-integro-differential equations:
()
Here τ is a positive delay term, ψ(t) is continuous, f[1]: [t0, +] × XX, and f[2]: [t0, +] × X × X × XX, such that problem (1) owns a unique solution, where X is a real or complex Hilbert space. Particularly, when g ≡ 0, problem (1) is reduced to the nonlinear delay differential equations. When the delay term τ = 0, problem (1) is reduced to the ordinary differential equations.

The investigation on stability analysis of different numerical methods for problem (1) has fascinated generations of researchers. For example, Torelli [15] considered stability of Euler methods for the nonautonomous nonlinear delay differential equations. Hout [16] studied the stability of Runge-Kutta methods for systems of delay differential equations. Baker and Ford [17] discussed stability of continuous Runge-Kutta methods for integrodifferential systems with unbounded delays. Zhang and Vandewalle [18] discussed the stability of the general linear methods for integrodifferential equations with memory. Li and Zhang obtained the stability and convergence of the discontinuous Galerkin methods for nonlinear delay differential equations [19, 20]. More references for this topic can be found in [2130]. However, few works have been found on the stability of splitting methods for the proposed methods.

In the present work, we present the additive Runge-Kutta methods with some appropriate quadrature rules to numerically solve the nonlinear delay-integrodifferential equations (1). It is shown that if the additive Runge-Kutta methods are algebraically stable, the obtained numerical solutions are globally and asymptotically stable under the given assumptions, respectively. The rest of the paper is organized as follows. In Section 2, we present the numerical methods for problems (1). In Section 3, we consider stability analysis of the numerical schemes. Finally, we present some extensions in Section 4.

2. The Numerical Methods

In this section, we present the additive Runge-Kutta methods with the appropriate quadrature rules to numerically solve problem (1).

The coefficients of the additive Runge-Kutta methods can be organized in Buther tableau as follows (cf. [31]):
()

where , , and for k = 1,2.

Then, the presented ARKMs for problem (1) can be written by
()
where yn and are approximations to the analytic solution y(tn) and y(tn + cih), respectively, yn = ψ(tn) for n ≤ 0, for tn + cih ≤ 0, and denotes the approximation to , which can be computed by some appropriate quadrature rules
()
For example, we usually adopt the repeated Simpson’s rule or Newton-Cotes rule, etc., according to the requirement of the convergence of the method (cf. [18]).

3. Stability Analysis

In this section, we consider the numerical stability of the proposed methods. First, we introduce a perturbed problem, whose solution satisfies
()
It is assumed that there exist some inner product <·, ·> and the induced norm ‖·‖ such that
()
where α < 0, β1 < 0, β2 > 0, γ > 0, and θ > 0 are constants. It is remarkable that the conditions can be equivalent to the assumptions in [32, 33] (see. [34] Remark  2.1).

Definition 1 (cf. [9]). An additive Runge-Kutta method is called algebraically stable if the matrices

()
are nonnegative.

Theorem 2. Assume an additive Runge-Kutta method is algebraically stable and β1 + β2 + 4γτ2η2θ2 < 0, where η = max⁡{p1, p2.⋯, pk}. Then, it holds that

()
where yn and zn are numerical approximations to problems (1) and (5), respectively.

Proof. Let and be two sequences of approximations to problems (1) and (5), respectively, by ARKMs with the same stepsize h and write

()
With the notation, the ARKMs for (1) and (5) yield
()
Thus, we have
()
Since that the matrix is a nonnegative matrix, we obtain
()
Furthermore, by conditions (6), we find
()
and
()
Together with (11), (12), (13), and (14), we get
()
Note that
()

Then, we obtain

()

Hence,

()
where . This completes the proof.

Theorem 3. Assume an additive Runge-Kutta method is algebraically stable and β1 + β2 + 4γτ2η2θ2 < 0. Then, it holds that

()

Proof. Similar to the proof of Theorem 2, it holds that

()
Note that β1 + β2 + 4γτ2η2θ2 < 0 and ; we have
()
On the other hand,
()
()
Now, in view of (10), (21), (22), and (23), we obtain
()
This completes the proof.

Remark 4. In [35], Yuan et al. also discussed nonlinear stability of additive Runge-Kutta methods for multidelay-integro-differential equations. However, the main results are different. The main reason is that the results in [35] imply that the perturbations of the numerical solutions tend to infinity when the time increase, while the stability results in present paper indicate that the perturbations of the numerical solutions are independent of the time. Besides, the asymptotical stability of the methods is also discussed in the present paper.

4. Conclusion

The additive Runge-Kutta methods with some appropriate quadrature rules are applied to solve the delay-integro-differential equations. It is shown that if the additive Runge-Kutta methods are algebraically stable, the obtained numerical solutions can be globally and asymptotically stable, respectively. In the future works, we will apply the methods to solve more real-world problems.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China (71601125).

    Data Availability

    No data were used to support this study.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.