Skip Navigation



IMA Journal of Numerical Analysis Advance Access published online on February 20, 2009

IMA Journal of Numerical Analysis, doi:10.1093/imanum/drn070
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Boutelje, B. R.
Right arrow Articles by Hill, A. T.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The author 2009. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Nonautonomous stability of linear multistep methods

B. R. Boutelje and A. T. Hill{dagger}

Department of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, UK

{dagger} Corresponding author. Email: ath{at}maths.bath.ac.uk

Received on 7 April 2008. Revised on 19 September 2008.


   Abstract

A linear scalar nonautonomous initial-value problem (IVP) is governed by a scalar {lambda}(t) with a nonpositive real part. For a wide class of linear multistep methods, including BDF4–6, it is shown that negative real {lambda}(t) may be chosen to generate instability in the method when applied to the IVP. However, a uniform-in-time stability result holds when {lambda}(·) is a Lipschitz function, subject to a related restriction on h. The proof involves the construction of a Lyapunov function based on a convex combination of G-norms.

Key Words: linear multistep methods; stability; Lyapunov functions


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.