On spurious asymptotic numerical solutions of explicit Runge-Kutta methods

The bifurcation diagram associated with the logistic equationⁿ⁺¹ = aⁿ(1 – ⁿ) is by now well known, as is its equivalenceto solving the ordinary differential equation (ODE) u' = u(1– u) by the explicit Euler difference scheme. It has alsobeen noted by Iserles that other popular difference schemesmay not only exhibit period doubling and chaotic phenomena butalso possess spurious fixed points. We investigate, both analyticallyand computationally, Runge-Kutta schemes applied to the equationu'=f(u), for f(u) = u{1 – u) and f(u) = au(1 – u)(b– u), contrasting their behaviour with the explicit Eulerscheme. We determine and provide a local analysis of bifurcationsto spurious fixed points and periodic orbits. In particularwe show that these may appear below the linearised stabilitylimit of the scheme, and may consequently lead to erroneouscomputational results. Major part of the material was published as an internal report-NASATechnical Memorandum 102919, April 1990, also as Universityof Reading Numerical Analysis Report 3/90, March 1990. This work was performed whilst a visiting scientist at NASAAmes Research Center, Moffett Field. CA 94035 USA. Staff Scientist, Fluid Dynamics Division.