Research Article  Open Access
Convergence of Variational Iteration Method for Fractional Delay IntegrodifferentialAlgebraic Equations
Abstract
Fractional order delay integrodifferentialalgebraic equations are often used for many practical modeling problems in science and engineering, which have time lag, memory, constraint limit, and so forth. These yield some difficulties in numerical computation. The iterative methods are good choice. In the present paper, we construct variational iteration method for solving them by using the appropriate restricted variation. This overcomes the difficulties caused by limitations of large storage amount and algebraic constraint and extends the previous conclusions.
1. Introduction
Fractional delay integrodifferentialalgebraic equations (FDIDAEs) are often used for modeling many science and engineering problems with memory and algebraic constraints, such as flexible multibody dynamics and integrated circuits. Recently, fractional integrodifferential equations (FIDEs) have received much attention; for instance, the stability and asymptotic stability of FIDEs are studied in [1â€“3]; the numerical methods for solving FIDEs can be found in [4â€“7]; for the approximate analytical methods for solving FIDEs, the readers can refer to [8â€“10]. The studies on differentialalgebraic equations (DAEs) are mainly concentrated in qualitative analysis as well as convergence and stability of numerical methods. For instance, the structural characteristics and asymptotic stability of the (neutral) DAEs are presented in [11, 12]; the convergence results of oneleg methods, RungeKutta methods, BDF methods, and linear multistep methods for DAEs are obtained in [13â€“16]; the stability of RungeKutta methods and Rosenbrock methods for (neutral) DAEs are studied in [17, 18]. As for integrodifferentialalgebraic equations, only a few studies have been undertaken, for instance, the convergence and stability of RungeKutta methods [19â€“21].
The variational iteration method (VIM) is one of the important methods used to obtain approximate analytical solutions [22â€“25] and possesses some good properties, such as flexibility, convenience, accuracy, and less storage. In particular, this method was used to solve pantograph equations [26, 27], differential (integral) equations [28â€“30], fractional differential (integral) equations [31â€“34], delay differentialalgebraic equations [35] and fractional differentialalgebraic equations [36], and so forth.
As far as we know, there are few works about numerical methods (including the VIM) for FDIDAEs. The aim of this paper is to use the VIM to solve FDIDAEs and obtain the corresponding convergence results.
2. Convergence
Consider the initial value problems of FDIDAEs. denotes the derivative of order , , , the delay functions and satisfy , , , and are smooth vector functions on the real Euclidean spaces, and satisfies the Lipschitz conditionwhere , , the order derivatives of initial value functions and are continuous, the Jacobian matrix is invertible, and is bounded (, , denotes the partial derivatives of the function to th variable) in a neighborhood of the exact solution. We assume that system (1) has smooth solutions . Throughout this article, denotes the standard Euclidean norm, and the matrix norm is subordinate to .
Applying the VIM to (1), we can construct the correction functionalwhere is a general Lagrange multiplier, which can be defined optimally by variational theory, and denotes the restrictive variation; that is, . In order to obtain , we select (see [36]) and have
By using part integral to (4), the stationary conditions are obtained as
Moreover, the general Lagrange multiplier can be readily identified by
Therefore, the variational iteration formula can be written as
Theorem 1. Let and , . Then the sequences and defined by (7a) and (7b) with , , and converge to the solutions of (1).
Proof. From system (1), we haveLet , , , and when , .
From (7a)â€“(8b), we obtainBased on the fact that the functions are smooth, the matrix is invertible, and hence we have where () denotes the partial derivative of the function to th variable.
Let and . From (2), (10a), and (10b), we haveWe can deriveNow, we proceed as follows:We havewhere , , and are constants and is the spectral radius of the iterative matrix in the above inequality.
We select , and therefore , . Moreover, we haveBy using Stirlingâ€™s formula, we have and thus as .
If the right function ,, we consider the initial value problems of fractional delay integrodifferentialalgebraic equationswhere the matrix , , and are smooth vector functions on the real Euclidean spaces, and satisfies the Lipschitz condition where are defined in the same way as those in system (1). We assume that system (17) has smooth solutions .
Applying the VIM to (17), we can construct the correction functionals
We select , and thus
By using part integral to (19a) and (19b), the stationary conditions are obtained as and, moreover, the general Lagrange multiplier can be readily identified by
Theorem 2. Let and . Then the sequences and defined by (19a) and (19b) with , , and converge to the solutions of (17).
Proof. The proof process is similar to that in system (1).
In general, the Lagrange multiplier obtained with exponential form can increase convergence speed of iterative sequences.
3. Special Cases
Remark 3. If the right function of system (1) has no integral item and no delay item, it becomes the fractional differentialalgebraic equation. The results obtained are consistent with the ones discussed in [36]. Moreover, we present a new way to prove the convergence.
Remark 4. When , system (1) can be written as the delay integrodifferentialalgebraic equation. Moreover, if the right function of system (1) has no integral item, it becomes the delay differentialalgebraic equation discussed in [35].
In conclusion, we get the more general result, which extends the conclusions of existing literature.
4. Illustrative Examples
In this section, some illustrative examples are given to show the efficiency of the VIM for solving fractional delay differentialalgebraic equations.
Example 1. Consider the initial value problem of fractional delay differentialalgebraic equationWhen , the exact solution of system (23) is Applying the VIM to (23), we can construct the correction functionalMoreover, the iteration sequence with the initial approximations and is obtained from (25a) and (25b) as follows:The approximate solution and exact solution are plotted in Figures 1 and 2. The imaginary line is the curve of the approximate solution, and the solid line is the curve of the exact solution, which shows that the method gives a very good approximation to the exact solution.
Example 2. Consider the initial value problem of fractional delay differentialalgebraic equationWhen , the exact solution of system (27) isUsing the VIM in the previous section, we construct the following correction functional:Moreover, the iteration sequence with the initial approximations and is obtained from (29a) and (29b) as follows:When the iteration number , the corresponding relative errors are shown in Tables 1 and 2.


Example 3. Consider the initial value problem of a fractional delay integrodifferentialalgebraic equation
When , the exact solutions of system (31) are
Using the VIM in the previous section, we construct the following correction functionals:
Moreover, the iteration sequence with the initial approximations and is obtained from (33a) and (33b) as follows:
The approximate solutions and exact solutions are plotted in Figures 3 and 4. The imaginary line is the curve of the approximate solution, and the solid line is the curve of the exact solution, which shows that the method gives a very good approximation to the exact solution.
Example 4. Consider the initial value problem of a fractional delay integrodifferentialalgebraic equationWhen , the exact solution of system (35) is We select , and, using the VIM in the previous section, we construct the following correction functionals: Moreover, the iteration sequence with the initial approximations and is obtained from (37a) and (37b) as follows:When the iteration number , the corresponding relative errors are shown in Tables 3 and 4.
To compare the convergence speed of iterative sequences with different Lagrange multiplier , then, we select and construct the following correction functionals Moreover, the iteration sequence with the initial approximations and is obtained from (39a) and (39b), and when the iteration number , the error comparisons of different are shown in Tables 5 and 6.
The Error denotes the error of with , and the Error denotes the error of with .
The Error denotes the error of with , and the Error denotes the error of with .
Tables 5 and 6 show that the Lagrange multiplier with exponential form can increase convergence speed of iterative sequences in Example 4.



