Detection of the onset of numerical chaotic instabilities by lyapunov exponents

Alicia Serfaty De Markus

Discrete Dynamics in Nature and Society, 2001, vol. 6, 1-8

Abstract:

It is commonly found in the fixed-step numerical integration of nonlinear differential equations that the size of the integration step is opposite related to the numerical stability of the scheme and to the speed of computation. We present a procedure that establishes a criterion to select the largest possible step size before the onset of chaotic numerical instabilities, based upon the observation that computational chaos does not occur in a smooth, continuous way, but rather abruptly, as detected by examining the largest Lyapunov exponent as a function of the step size. For completeness, examination of the bifurcation diagrams with the step reveals the complexity imposed by the algorithmic discretization, showing the robustness of a scheme to numerical instabilities, illustrated here for explicit and implicit Euler schemes. An example of numerical suppression of chaos is also provided.

Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/6/185919.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/6/185919.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:185919

DOI: 10.1155/S1026022601000127

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().