13.05.2018 Views

merged

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Solving Nonlinear First-order Ordinary Differential Equations (ODEs) using<br />

Backward Differentiation Formulae (BDF).<br />

Noramira Binti Mohd Ezi<br />

Supervisor: Dr. Loy Kak Choon<br />

Bachelor of Science (Computational Mathematics)<br />

School of Informatics and Applied Mathematics<br />

Backward Differentiation Formulae (BDF) methods are categorised as linear multistep<br />

methods. BDF methods are fully implicit, thereby increasing the overall stability of the<br />

schemes. Higher-order BDF methods are popular used to solve stiff nonlinear first-order<br />

ODEs without relying on a very small step size. While gaining better accuracy by using<br />

test problems, for fisrt, second and third order BDF methods are reproduce the order of<br />

convergence using Octave programming language. BDF methods with higher-order of<br />

accuracy are exceptionally accurate but are less efficient than explicit and semi-implicit<br />

methods since they require Newton’s method to be computed at each step size. The<br />

significance of output from this research project is a proper understanding of BDF<br />

methods and to know how to compute first-order nonlinear ODEs especially involving stiff<br />

nonlinear ODEs problems.<br />

968 | UMT UNDERGRADUATE RESEARCH DAY 2018

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!