Answers are grounded in this paper and cite their sources.
In this article, we derive a block procedure for some K-step linear multi-step methods (for K = 1, 2 and 3), using Legendre polynomials as the basis functions. We give discrete methods used in block and implement it for solving the non-stiff initial value problems, being the continuous interpolant derived and collocated at grid and off-grid points. Numerical examples of ordinary differential equations (ODEs) are solved using the proposed methods to show the validity and the accuracy of the introduced algorithms. A comparison with fourth-order Runge-Kutta method is given. The ob-tained numerical results reveal that the proposed method is efficient.
No takes yet. Share an insight, caveat, or question.
Khadijah M. Abualnaja (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: