Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
KAUST Grant NumberFIC/2010/05
Online Publication Date2011-04-29
Print Publication Date2012-02
Permanent link to this recordhttp://hdl.handle.net/10754/599733
MetadataShow full item record
AbstractIn this paper nonlinear monotonicity and boundedness properties are analyzed for linear multistep methods. We focus on methods which satisfy a weaker boundedness condition than strict monotonicity for arbitrary starting values. In this way, many linear multistep methods of practical interest are included in the theory. Moreover, it will be shown that for such methods monotonicity can still be valid with suitable Runge-Kutta starting procedures. Restrictions on the stepsizes are derived that are not only sufficient but also necessary for these boundedness and monotonicity properties. © 2011 Springer Science+Business Media, LLC.
CitationHundsdorfer W, Mozartova A, Spijker MN (2011) Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods. Journal of Scientific Computing 50: 265–286. Available: http://dx.doi.org/10.1007/s10915-011-9487-1.
SponsorsThe work of A. Mozartova is supported by a grant from the Netherlands Organisation for Scientific Research NWO. The work of W. Hundsdorfer for this publication was partially supported by Award No. FIC/2010/05 from King Abdullah University of Science and Technology (KAUST).
JournalJournal of Scientific Computing