- Research
- Open access
- Published:
A new type OF hybrid multistep multiderivative formula for solving stiff IVPs
Advances in Difference Equations volume 2019, Article number: 286 (2019)
Abstract
We present a new class of higher-order multistep multiderivative methods for the numerical solution of stiff initial value problems. These methods are obtained based on free parameters and off-point. The methods have minimum error bounds. The constructed class is A-stable for orders 3 and 4, and \(A(\alpha)\)-stable for orders 5 and 6. The new class is L-stable for all orders. They are suitable for solving stiff systems of initial value problems with large eigenvalues lying close to the imaginary axis. The stability regions of the new class are plotted, and some problems are solved, which show the superiority of the class in efficiency and accuracy.
1 Introduction
Consider the initial value problems for the first-order ordinary differential equation
Here \(y: [x _{0}; b] \rightarrow R^{\mathrm{d}}\) and \(f: [x _{0}; b] \times R^{{d}} \rightarrow R^{{d}}\) are assumed to be sufficiently smooth, and \(y _{0} \in R^{{d}}\) is the given initial value. Without any loss of generality we assume the step-size \(h > 0\) to be constant, and we define the grid points along the x-axis by \(x _{{n}} = x _{0} + nh; n = 0; 1; 2; \ldots;N\), where \(Nh = b - x_{0}\), and the set of equally spaced points on the integration interval is defined by \(x _{0} < x _{1}< x _{2}< \cdots <x_{n+1}= b\).
Equations having highly oscillatory solution or stiff problems are very common problems in many fields, such as biology, celestial mechanics, control, fluids, heat transfer [20], chemical kinetics, lasers, and mechanics; see [7]. In general, any physical system modeled by an ordinary differential equation and having physical components with greatly different time constants leads to a stiff problem. In the literature of ordinary differential equations (ODEs), various definitions are seen for the stiffness [3, 9, 13, 17, 19], one being somewhat more precise than another. The essence of stiffness is that the solution to be computed is slowly varying but there exist rapidly damped perturbations.
The numerical solution of these kinds of problems is a central task in all simulation environments for mechanical, electrical, and chemical systems. From discussion on the relative merits of linear multistep and Runge–Kutta methods it emerged that the former class of methods, though generally more efficient in terms of accuracy and weak stability properties for a given number of functions evaluations per step, suffered the disadvantage of requiring additional starting values and special procedures for changing step length. These difficulties would be reduced, without sacrifice, if we could lower the step number of the linear multistep methods without reducing their order. The difficulty here lies in satisfying the essential condition of zero-stability. This “zero-stability barrier” was circumvented by the introduction of modified linear multistep formula, which incorporates a function evaluation at off-step point. Such formula, simultaneously proposed by Agarwal, Ibrahim, and Yousry [2], Butcher [4], Gear [11], Gragg and Stetter [12], Ibrahim and Yousry [15], and Shokri [18] were christened “hybrid” by the last author since, whilst retaining certain linear multistep characteristics, hybrid methods share with Runge–Kutta methods the property of utilizing data at points other than the step points [5, 6]. Thus, we may regard the introduction of hybrid formula as an important step by Kopal [16]. In this paper, our objective is to construct stable multistep multiderivative methods with off-points and good stability characteristic properties, fewer function evaluations, and rapid convergence to the exact solution.
The k-step classical hybrid method formula is as follows:
where \(\alpha _{{k}} = +1\), \(\alpha _{0}\) and \(\beta _{0}\) are not both zero, \(s\notin \{0, 1, \dots, k\}\), and \(f_{n+s}= f(x_{n+s},y_{n+s})\). These methods are similar to linear multistep methods but with one essential modification: an additional predictor is introduced at the off-step point. This greater generality allows the consequences of the Dahlquist barrier to be avoided, and it is actually possible to obtain convergent k-step methods with order \(2k+1\) up to \(k= 7\). Even higher orders are available if two or more off-step points are used. The other independent discoveries of this approach were reported in [3, 8, 10, 11].
Another important class of linear multistep methods for the numerical solution of first-order ordinary differential equations is the classical Obrechkoff methods. The k-step classical Obrechkoff method using the first l derivatives of y for solution of (1) is given by [12]
According to [17], the error constant decreases more rapidly with increasing l rather than with increasing k. It is difficult to satisfy the zero-stability for large k. The weak stability interval appears to be small.
For many problems, such explicit differentiation is intolerably complicated, but when it is feasible to evaluate the first few total derivatives of y, then generalizations of linear multistep methods that employ such derivatives can be very efficient [1].
2 Construction of the new hybrid superimplicit method
The main aim of this section is to consider the numerical integration of (1). We consider k-step methods with first l derivatives of y and ν off-step points of the form
where \(\alpha _{{i}}\), \(\beta_{ij}\), \(\gamma _{{j}}\) are arbitrary constants to be determined, and \(0 < s< k\) are parameters. Formula (4) can only be used if we know the values of the solution \(y(x)\) and associated derivatives at k successive points. These k values will be assumed to be given.
For \(s > k\), the methods are called superimplicit because they require the knowledge of functions not only at past and present but also at future steps (off-points).
The next work concerns the parametric formula with one off-point as follows:
The associative formula to obtain the first and second derivatives at the superfuture points is
where \(y'= f (x,y)\) and \(y''= g(x, y) = f_{{x}} + f_{ {y}} f\), and the coefficients are chosen so that (5) and (6) have orders \(k+1\) and \(k-1\), respectively.
The associated polynomials are given by
We can assume that the functions \(\rho (z ), \sigma (z)\), and \(\eta(z)\) have no common factors.
We use a Taylor series expansion to determine all the coefficients of (5), for which we have
Definition 1
The new multistep method (5) is said to be of order p if
Hence for any function \(y(x)\in C^{(p+2)}\) and for some nonzero constant \(C_{p+1}\), we have
where \(C_{p+1}\) is called the error constant.
In particular, \(L(y(x),h)\) vanishes identically when \(y(x)\) is a polynomial whose degree is less than or equal to p.
Lemma 1
The new multistep method (5) is consistent if and only if
Proof
We know that the general linear multistep methods are consistent if and only if they have the order \(p \geq 1\). This implies \(C _{0} = C _{1} = 0\). Therefore by a simple calculation we get (9). □
3 Stability analysis
In this section, we introduce different types of stability. We study A, \(A(\alpha)\), and L-stability of the new superfuture methods (5)–(6) for \(k= 2-5\) with one off-point.
Definition 2
(Lambert [17])
A numerical method is said to be A-stable if its region of absolute stability S contains the whole complex left-half plane.
Definition 3
(Lambert [17])
A k-step method is said to be L-stable if it is A-stable and has a stability matrix with vanishing eigenvalues at infinity.
If we apply (5)–(6) to the test equation \(y' = \lambda y\) for which \(y'' = \lambda ^{2} y\), then we get
where \(\chi = h \lambda \) Substituting (11) inti (10), we obtain
This equation can be written as
The associated characteristic equation takes the form
For stability, ξ must satisfy the condition \(|\xi |\leq1\), with strict inequality for multiple roots; see [17]. We use the boundary locus method to determine the absolute stability region; for \(\xi = e^{i\theta}\), a cubic equation gives rise to three roots locus curves, which together describe the stability domain. The stability regions of method (5)–(6) for steps \(k=2\) up to 5 are plotted in Fig. 1. The method (5)–(6) is A-stable for \(k=2\) and 3, and is \(A(\alpha)\) stable for \(k=4\) and 5, where \(\alpha =85.1^{\circ}\) for \(k=4\) and \(\alpha = 75.7^{\circ}\) for \(k=5\). From (14) it is clear that since the power of χ in the denominator is higher than that in the numerator, the solution tends to zero, and so (5)–(6) is L-stable or \(L(\alpha)\)-stable according to its A-stability or \(A(\alpha)\)-stability.
4 Four-step methods with one off-step point
We are going to discuss in details method (4)–(5) for \(k=4\). The coefficients of method (5)–(6) for \(k=2, 3, 5\), the error constants, and the values of the parameters that minimize the truncation error are listed in the Appendix.
Upon choosing \(k = 4\) in (5)–(6), we get
The coefficients of (16) and (17) are as follows:
Here \(\beta _{4}\), \(\gamma _{4}\), s, μ, \(\nu _{0}\) are free parameters, and the error constant of the local truncation error is
The values, \(s=4\) and \(\gamma _{4}= -72/415\) minimize the truncation error, and the error constant becomes \(\frac{24}{2075}\).
5 Stability analysis
We study the stability analysis of method (4)–(5) for \(k=4\).
Definition 4
(Lambert [17])
An LMM is called \(A( \alpha)\)-stable (\(0 < \alpha <\pi/2\)) if \(S \supseteq S_{\alpha } = \{ \mu , \vert \arg ( - \mu ) < \alpha , \mu \ne 0\} \vert \).
To analyze the method for the absolute stability, the associated characteristic equation of the method (16)–(17) takes the form
By using boundary locus method and Wolfram Mathematica the absolute stability region is plotted. The figure shows that the method is \(A( \alpha)\)-stable with \(\alpha =85.1^{\circ}\). The absolute stability region is plotted in Fig. 1.The methods are unstable at the shaded region.
From equation (14) we have
This equation shows that method (16)–(7) is \(L(\alpha)\)-stable.
6 Numerical examples
In this section, we present some numerical results obtained by our new methods (5)–(6) with step \(k=3\). The values of the parameters used are \(\beta _{3} = 0.2, \gamma _{3} = 0.2, s = 4,\mu = - 0.6, \nu _{0} = 0.3\), and the numerical results are compared with those of other multistep methods.
Test 1
(Robertson chemical kinetics problem, Hojjati [14])
Consider the stiff initial value problem
Numerical results for the Robertson problem by method (5)–(6) are compared with those of the parallel SDMM method in Table 1. The solution curves are displayed in Fig. 2.
Test 2
The following stiff initial value problem arises from a chemistry problem:
with \(y _{1} (0) = 0\), \(y _{2} (0) = 1\), \(y _{3} (0) =1\). For \(x=2\), the exact solution is
This problem is solved by method (5)–(6), and the second derivative BDF method (SDBDF) with \(h=0.0001\). The absolute errors of the numerical integration at \(x=2\) are tabulated in Table 2.
Test 3
Consider the stiff system
The exact solution is given by
This problem is solved by method (5)–(6), and the sixth-order method given by [19]
The absolute errors of the numerical integration are illustrated in Table 3.
7 Conclusion
Multiderivative methods are used to solve stiff problems effectively. This paper has been able to develop implicit formulas of linear multistep methods to hybrid superimplicit formulas for the solution of initial value problems. Here a hybrid multistep multiderivative method is derived with parameters that control stability and the degree of accuracy. It is clear from the tables that our new methods are accurate. However, choosing the values of the parameter such that the method is super implicit, the new method has large stability regions. The method is L-stable for \(k=2\) and 3 and \(L( \alpha)\)-stable with large α for \(k=4\) and 5. The parameters are determined to minimize the truncation errors for different k.
Abbreviations
- ODEs:
-
ordinary differential equations
- BDF:
-
backward differentiation formula
- SDBDF:
-
second-derivative BDF method
- S:
-
absolute stability region
References
Agarwal, P., El-Sayed, A.A.: Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation. Phys. A, Stat. Mech. Appl. 500, 40–49 (2018)
Agarwal, P., Ibrahim, I.H., Yousry, F.M.: G-stability one-log hybrid methods for solving DAEs. Adv. Differ. Equ. 2019, 103 (2019)
Aiken, R.C. (ed.): Stiff Computation. Oxford University Press, U.K. (1985)
Butcher, J.C.: A modified multistep method for the numerical integration of ordinary differential equations. J. ACM 12, 124–135 (1965)
Cesarano, C., Bazighifan, O.: Oscillation of fourth-order functional differential equations with distributed delay. Axioms 8(5), 1–7 (2019)
Cesarano, C., Pinelas, S., Al-Showaikh, F., Bazighifan, O.: Asymptotic properties of solutions of fourth-order delay differential equations. Symmetry 12(5), 1–10 (2019)
Coleman, J.P., Ixaru, L.G.: P-stability and exponential fitting methods for \(y''=f(x,y)\). IMA J. Numer. Anal. 16(2), 179–199 (1996)
Dahlquist, G.: On accuracy and unconditional stability of linear multistep methods for second order differential equations. BIT Numer. Math. 18(2), 133–136 (1978)
Dekker, K., Verwer, J.G.: Stability of Runge–Kutta Method for Stiff Nonlinear Differential Equations. CWI Monographs, vol. 2. North-Holland, Amsterdam (1984)
Franco, J.M.: An explicit hybrid method of Numerov type for second-order periodic initial-value problems. J. Comput. Appl. Math. 59, 79–90 (1995)
Gear, C.W.: Hybrid methods for initial value problems in ordinary differential equations. J. Soc. Ind. Appl. Math., Ser. B Numer. Anal. 2, 69–86 (1965)
Gragg, W.B., Steeter, H.J.: Generalized multistep predictor-corrector methods. J. ACM 11, 188–209 (1964)
Hairer, E., Wanner, G.: Solving Ordinary Differential Equation II: Stiff and Differential-Algebraic Problems. Springer, Berlin (1996)
Hojjati, G.: A class of parallel methods with superfuture points technique for the numerical solution of stiff systems. J. Mod. Methods Numer. Math. 6(2), 57–63 (2015)
Ibrahim, I.H., Yousry, F.M.: Hybrid special class for solving differential algebraic equations. Numer. Algorithms 69(2), 301–320 (2015)
Kopal, Z.: Numerical analysis. Am. Math. Mon. 71(1), 107 (1964)
Lambert, J.D.: Numerical Methods for Ordinary Differential Systems: The Initial Value Problem. Wiley, New York (1991)
Shokri, A.: The symmetric P-stable hybrid Obrechkoff methods for the numerical solution of second order IVPs. TWMS J. Pure Appl. Math. 5(1), 28–35 (2014)
Yakubu, D.G., Aminu, M., Aminu, A.: The numerical integration of stiff systems using stable multistep multiderivative methods. J. Mod. Methods Numer. Math. 8(1–2), 99–117 (2017)
Zhou, H., Agarwal, P.: Existence of almost periodic solution for neutral Nicholson blowflies model. Adv. Differ. Equ. 1, 329 (2017)
Acknowledgements
We are really thankful to the reviewers for their useful suggestions and corrections.
Availability of data and materials
Not applicable.
Funding
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
Author information
Authors and Affiliations
Contributions
All authors’ contributions are equal, and they all read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
The coefficients of (5) and (6) for \(k=2\) are
The error constant of the local truncation error is
The values \(s=2\) and \(\beta _{2} = - 3\gamma _{2}\) minimize the truncation error, and the error constant becomes \(\frac{1}{48}\).
The coefficients of (5) and (6) for \(k=3\) are
The error constant of the local truncation error is
The values \(s=3\) and \(\gamma _{3} = - 18/85\) minimize the truncation error, and the error constant becomes \(\frac{9}{425}\).
The coefficients of (5) and (6) for \(k=5\) are
The error constant of the local truncation error is
The values \({s}=5\) and \(\gamma _{5} = - 1800/12{,}019\) minimize the truncation error, and the error constant becomes \(\frac{600}{84{,}133}\).
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Agarwal, P., Ibrahim, I.H. A new type OF hybrid multistep multiderivative formula for solving stiff IVPs. Adv Differ Equ 2019, 286 (2019). https://doi.org/10.1186/s13662-019-2215-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-2215-0