scholarly journals A Quantitative Comparison of Numerical Method for Solving Stiff Ordinary Differential Equations

2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
S. A. M. Yatim ◽  
Z. B. Ibrahim ◽  
K. I. Othman ◽  
M. B. Suleiman
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Initial Value Problems ◽  
Computation Time ◽  
Quantitative Comparison ◽  
Initial Value ◽  
Step Size ◽  
Stiff Ordinary Differential Equations ◽  
Block Methods ◽  
Variable Step

We derive a variable step of the implicit block methods based on the backward differentiation formulae (BDF) for solving stiff initial value problems (IVPs). A simplified strategy in controlling the step size is proposed with the aim of optimizing the performance in terms of precision and computation time. The numerical results obtained support the enhancement of the method proposed as compared to MATLAB's suite of ordinary differential equations (ODEs) solvers, namely, ode15s and ode23s.

scholarly journals A Family of Stiffly Stable Second Derivative Block Methods for Initial Value Problems in Ordinary Differential Equations

2019 ◽  
pp. 221-239 ◽  
Author(s):  
Samuel A. Ajayi ◽  
Kingsley O. Muka ◽  
Oluwasegun M. Ibrahim
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Initial Value Problems ◽  
Absolute Stability ◽  
Truncation Error ◽  
Second Derivative ◽  
Initial Value ◽  
First Order ◽  
Stiff Ordinary Differential Equations ◽  
Block Methods

In this paper, we present a family of stiffly stable second derivative block methods (SDBMs) suitable for solving first-order stiff ordinary differential equations (ODEs). The methods proposed herein are consistent and zero stable, hence, they are convergent. Furthermore, we investigate the local truncation error and the region of absolute stability of the SDBMs. A flowchart, describing this procedure is illustrated. Some of the developed schemes are shown to be A-stable and L-stable, while some are found to be A()-stable. The numerical results show that our SDBMs are stiffly stable and give better approximations than the existing methods in the literature.

scholarly journals Solving third order ordinary differential equations directly using hybrid numerical models

2020 ◽  
pp. 69-76
Author(s):  
J. O. Kuboye ◽  
O. F. Quadri ◽  
O. R. Elusakin
Keyword(s):  
Power Series ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Initial Value Problems ◽  
Numerical Models ◽  
Gaussian Elimination ◽  
Initial Value ◽  
Third Order ◽  
Block Methods ◽  
Grid Points

In this work, numerical methods for solving third order initial value problems of ordinary differential equations are developed. Multi-step collocation is used in deriving the methods, where power series approximate solution is employed as a basis function. Gaussian elimination approach is considered in finding the unknown variables $a_j, j=0(1)8$ in interpolation and collocation equations, which are substituted into the power series to give the continuous implicit schemes. The discrete schemes and its derivatives are derived by evaluating the grid and non-grid points. These schemes are arranged in a matrix form to produce block methods. The order of the developed methods are found to be six. The numerical results proved the efficiency of the methods over the existing methods.

scholarly journals A Numerical Algorithm for Solving Stiff Ordinary Differential Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
S. A. M. Yatim ◽  
Z. B. Ibrahim ◽  
K. I. Othman ◽  
M. B. Suleiman
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Computation Time ◽  
Test Problems ◽  
Variable Order ◽  
Step Size ◽  
Differentiation Formula ◽  
Stiff Ordinary Differential Equations ◽  
Backward Differentiation Formula ◽  
The Stability

An advanced method using block backward differentiation formula (BBDF) is introduced with efficient strategy in choosing the step size and order of the method. Variable step and variable order block backward differentiation formula (VSVO-BBDF) approach is applied throughout the numerical computation. The stability regions of the VSVO-BBDF method are investigated and presented in distinct graphs. The improved performances in terms of accuracy and computation time are presented in the numerical results with different sets of test problems. Comparisons are made between the proposed method and MATLAB’s suite of ordinary differential equations (ODEs) solvers, namely, ode15s and ode23s.

A Multiple Interval Chebyshev-Gauss-Lobatto Collocation Method for Ordinary Differential Equations

2016 ◽  
Vol 9 (4) ◽  
pp. 619-639 ◽  
Author(s):  
Zhong-Qing Wang ◽  
Jun Mu
Keyword(s):  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Collocation Method ◽  
Initial Value Problems ◽  
Numerical Experiments ◽  
High Order Accuracy ◽  
Nonlinear Ordinary Differential Equations ◽  
Initial Value ◽  
Order Accuracy ◽  
Long Time

AbstractWe introduce a multiple interval Chebyshev-Gauss-Lobatto spectral collocation method for the initial value problems of the nonlinear ordinary differential equations (ODES). This method is easy to implement and possesses the high order accuracy. In addition, it is very stable and suitable for long time calculations. We also obtain thehp-version bound on the numerical error of the multiple interval collocation method underH1-norm. Numerical experiments confirm the theoretical expectations.

Sign in / Sign up

Export Citation Format

Share Document