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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.