z-logo
open-access-imgOpen Access
Numerical treatment of first order delay differential equations using extended block backward differentiation formulae
Author(s) -
C. Chibuisi,
Bright O. Osu,
S.O. Edeki,
G. O. Akinlabi
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1734/1/012023
Subject(s) - mathematics , delay differential equation , linear multistep method , numerical differentiation , collocation (remote sensing) , interpolation (computer graphics) , block (permutation group theory) , differential equation , mathematical analysis , ordinary differential equation , computer science , differential algebraic equation , geometry , animation , computer graphics (images) , machine learning
In this research, we developed and implemented extended backward differentiation methods (formulae) in block forms for step numbers k = 2, 3 and 4 to evaluate numerical solutions for certain first-order differential equations of delay type, generally referred to as delay differential equations (DDEs), without the use of interpolation methods for estimating the delay term. The matrix inversion approach was applied to formulate the continuous composition of these block methods through linear multistep collocation method. The discrete schemes were established through the continuous composition for each step number, which evaluated the error constants, order, consistency, convergent and area of absolute equilibrium of these discrete schemes. The study of the absolute error results revealed that, as opposed to the exact solutions, the lower step number implemented with super futures points work better than the higher step numbers implemented with super future points.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here