How many k-step linear block methods exist and which of them is the most efficient and simplest one?

Higinio Ramos and Paul Popescu

Applied Mathematics and Computation, 2018, vol. 316, issue C, 296-309

Abstract: 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.

Keywords: Ordinary differential equations; Initial value problems; k-step block methods; Efficient formulation (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317305878
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:316:y:2018:i:c:p:296-309

DOI: 10.1016/j.amc.2017.08.036

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().