Efficient Extrapolation Methods for ODEs, II

From MaRDI portal





[For part I see ibid. 3, 383-395 (1983; Zbl 0533.65047)]. The author presents here an interesting extension of his earlier results concerning integration codes based on the extrapolation of a modified midpoint rule. Instead of restricting attention to a comparison of codes which select the same formula at each step, he examines the relative efficiency of codes which each select their most efficient order. It is of course necessary to make certain assumptions about the sequences of integers incorporated in the codes considered, but these assumptions are not unreasonable. The conclusions which the author then derives accord well with the existing belief that two particular sequences previously suggested by \textit{R. Bulirsch} and \textit{J. Stoer} [Numer. Math. 8, 1-13 (1966; Zbl 0135.379)] and by \textit{P. Deuflhard} [ibid. 41, 399-422 (1983; Zbl 0543.65049)] respectively, offer increased efficiency.











This page was built for publication: Efficient Extrapolation Methods for ODEs, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700731)