Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 316, Issue -, Pages 296-309Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2017.08.036
Keywords
Ordinary differential equations; Initial value problems; k-step block methods; Efficient formulation
Categories
Ask authors/readers for more resources
There have appeared in the literature a lot of k-step block methods for solving initial-value problems. The methods consist in a set of k simultaneous multistep formulas over k non-overlapping intervals. A feature of block methods is that there is no need of other procedures to provide starting approximations, and thus the methods are self-starting (sharing this advantage of Runge-Kutta methods). All the formulas are usually obtained from a continuous approximation derived via interpolation and collocation at k + 1 points. Nevertheless, all the k-step block methods thus obtained may be considered as different formulations of one of them, which results to be the most efficient and simple formulation of all of them. The theoretical analysis and the numerical experiments presented support this claim. (C) 2017 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available