Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 1991 | Published
Journal Article Open

A Unified Approach to Spurious Solutions Introduced by Time Discretisation. Part I: Basic Theory

Abstract

The asymptotic states of numerical methods for initial value problems are examined. In particular, spurious steady solutions, solutions with period 2 in the timestep, and spurious invariant curves are studied. A numerical method is considered as a dynamical system parameterised by the timestep h. It is shown that the three kinds of spurious solutions can bifurcate from genuine steady solutions of the numerical method (which are inherited from the differential equation) as h is varied. Conditions under which these bifurcations occur are derived for Runge–Kutta schemes, linear multistep methods, and a class of predictor-corrector methods in a PE(CE)^M implementation. The results are used to provide a unifying framework to various scattered results on spurious solutions which already exist in the literature. Furthermore, the implications for choice of numerical scheme are studied. In numerical simulation it is desirable to minimise the effect of spurious solutions. Classes of methods with desirable dynamical properties are described and evaluated.

Additional Information

© 1991 SIAM. Received by the editors March 19, 1990; accepted for publication (in revised form) November 19, 1990. The research of this author was supported by the United Kingdom Science and Engineering Research Council. We thank J.M. Sanz-Serna for pointing out an error in an early version of Theorem 5.4 and for suggesting its resolution, Theorem 5.6. We also thank T. Eirola for helpful discussions and an anonymous referee for his careful reading of the manuscript.

Attached Files

Published - 0728086.pdf

Files

0728086.pdf
Files (2.8 MB)
Name Size Download all
md5:4c39c1a773549b9ceaf32b9daa326278
2.8 MB Preview Download

Additional details

Created:
August 20, 2023
Modified:
March 5, 2024