Computation of the largest Lyapunov exponent by the generalized cell mapping (Q1093076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4021667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of the largest Lyapunov exponent by the generalized cell mapping |
scientific article; zbMATH DE number 4021667 |
Statements
Computation of the largest Lyapunov exponent by the generalized cell mapping (English)
0 references
1986
0 references
The method of cell mappings has been developed as an efficient tool for the global study of dynamical systems. One of them, the generalized cell mapping (GCM), describes the behavior of a system in a probabilistic sense, and is essentially a markov chain analysis of dynamical systems. Since the largest Lyapunov exponent is widely used to characterize attractors of dynamical systems, we propose an algorithm for that quantity by the GCM. This allows us to examine the persistent groups of the GCM in terms of their Lyapunov exponent, thereby connecting them with their counterparts in point mapping systems.
0 references
Hénon-Pomeau map
0 references
forced Duffing system
0 references
cell mapping
0 references
Markov chain analysis
0 references
Lyapunov exponent
0 references
attractors
0 references
algorithm
0 references
0 references
0.7731486558914185
0 references
0.7654765844345093
0 references
0.7648521065711975
0 references
0.7629417777061462
0 references
