Features of the Computational Implementation of the Algorithm for Estimating the Lyapunov Exponents of Systems with Delay
We consider the computational implementation of the algorithm for Lyapunov exponents spectrum numerical estimation for delay differential equations. It is known that for such systems, as well as for boundary value problems, it is not possible to prove the well-known Oseledets theorem which allows us...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2019-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1277 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We consider the computational implementation of the algorithm for Lyapunov exponents spectrum numerical estimation for delay differential equations. It is known that for such systems, as well as for boundary value problems, it is not possible to prove the well-known Oseledets theorem which allows us to calculate the required parameters very efficiently. Therefore, we can only talk about the estimates of the characteristics in some sense close to the Lyapunov exponents. In this paper, we propose two methods of linearized systems solutions processing. One of them is based on a set of impulse functions, and the other is based on a set of trigonometric functions. We show the usage flexibility of these algorithms in the case of quasi-stable structures when several Lyapunov exponents are close to zero. The developed methods are tested on a logistic equation with a delay, and these tests illustrate the “proximity” of the obtained numerical characteristics and Lyapunov exponents. |
|---|---|
| ISSN: | 1818-1015 2313-5417 |