Abstract
Semi-implicit multistep methods are an efficient tool for solving large-scale ODE systems. This recently emerged technique is based on modified Adams–Bashforth–Moulton (ABM) methods. In this paper, we introduce new semi-explicit and semi-implicit predictor–corrector methods based on the backward differentiation formula and Adams–Bashforth methods. We provide a thorough study of the numerical stability and performance of new methods and compare their stability with semi-explicit and semi-implicit Adams–Bashforth–Moulton methods and their performance with conventional linear multistep methods: Adams–Bashforth, Adams–Moulton, and BDF. The numerical stability of the investigated methods was assessed by plotting stability regions and their performances were assessed by plotting error versus CPU time plots. The mathematical developments leading to the increase in numerical stability and performance are carefully reported. The obtained results show the potential superiority of semi-explicit and semi-implicit methods over conventional linear multistep algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.