Multistep Methods and General Linear Methods

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter is devoted to the study of multistep and general multivalue methods. After retracing their historical development (Adams, Nyström, Milne, BDF) we study in the subsequent sections the order, stability and convergence properties of these methods. Convergence is most elegantly set in the framework of onestep methods in higher dimensions. Sections III.5 and III.6 are devoted to variable step size and Nordsieck methods. We then discuss the various available codes and compare them on the numerical examples of Section II.10 as well as on some equations of high dimension. Before closing the chapter with a section on special methods for second order equations, we discuss two highly theoretical subjects: one on general linear methods, including Runge-Kutta methods as well as multistep methods and many generalizations, and the other on the asymptotic expansion of the global error of such methods.

Cite

CITATION STYLE

APA

Multistep Methods and General Linear Methods. (2008). In Solving Ordinary Differential Equations I (pp. 355–474). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-78862-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free