Abstract
The performance of the Block Generalised Multistep Adams and Backward Differentiation Formulae (BGMBDF) as compared with Generalised Multistep Adams and Backward Differentiation Formulae (GMBDF) is presented. These methods are used to solve initial value problems (IVPs) for stiff and nonstiff systems of ordinary differential equations (ODEs). The results obtained show that the BGMBDF reduces the total number of steps in computation. Keywords: Block; backward differentiation formulae; steps. Closure matroid.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
