arXiv:1602.05410v3 [nlin.CD] 26 Nov 2016 h ypnvdmninhsbe eeoe nanme fppr (s papers of number int others). a of and in are 78] developed dimension 45, been n 35, this has high of dimension of estimates Lyapunov problem various a the thus, often [74]), is in attractors T of discussion dimension attractors. Hausdorff of dimension the Hausdorff of the estimating for [36] Yorke fLoo ehdi suggested. discrete-t is For method discussed. Leonov are of method Leonov the with connection aycsst e ffcieyeatLauo ieso oml [46 Lyap formula dimension direct Lyapunov s the exact the effectively on of t get based localization to is without is cases method sets many invariant method Leonov Leo of of Leonov dimension by advantage Lyapunov The The the proposed functions. 63]). approach, Lyapunov-like 62, analytical cial 55, effective 50, an [46, is there mension rpitsbitdt hsc etr acpe]di 10. doi: [accepted] A Letters Physics to submitted Preprint .Introduction 1. e get to of cases, dimension many Lyapunov in and, the space estimate phase to the formula. in one dimension f set allows Lyapunov-like the it special of that with localization is method Leonov Lyapunov method G.A. direct by the the proposed on approach, based analytical computin is effective and an estimating for is methods there numerical used widely with Along Abstract ytm,18-0,adtenmrclcluaino h Lyapuno Lyapun the of and Keywords: calculation exponents numerical Lyapunov Foia¸s the the and Eden, via 1985-90), Constantin, systems, dimension 1980), Hausdorff and maps, the Kaplan of of dimension works: bound it Oesterl´e Lyapunov related (upper here and key the way, Douady rigorous the 1979), but and dimension, simple Lyapunov method a Leonov In the suggested. discrete-t between is For method discussed. Leonov are of method Leonov the with connection nt-ieLauo xoet,ivrac ihrsett diffeom to respect with invariance exponents, Lyapunov finite-time h ypnvdmninadisetmto i h envmet Leonov the via estimation its and dimension Lyapunov The ute h naineo h ypnvdmninwt epc od to respect with dimension Lyapunov the of invariance the Further computin and estimating for methods numerical used widely with Along h ocp fteLauo ieso a ugse ntesemina the in suggested was dimension Lyapunov the of concept The t respect with dimension Lyapunov the of invariance the work this In mi address: Email b eateto ahmtclIfrainTcnlg,Unive Technology, Information Mathematical of Department trco,Hudr ieso,Lauo ieso n t Kaplan its and dimension Lyapunov dimension, Hausdorff attractor, a aut fMteaisadMcais t eesugState Petersburg St. Mechanics, and Mathematics of Faculty [email protected] ..Kuznetsov N.V. NV unto ) Kuznetsov (N.V. 06jpylt.060.3 uy3 2018 3, July 1016/j.physleta.2016.04.036 st fJyv¨askyl¨a, of Finland rsity m yaia ytm nanalog an systems dynamical ime m yaia ytm nanalog an systems dynamical ime xoet n dimension. and exponents v fteHudr ieso via dimension Hausdorff the of s edrc ueia computation numerical direct he rhss envmethod Leonov orphisms, nvriy Russia University, n ea uprbounds (upper Temam and , 7 0 3 4 6 9 64]. 59, 56, 54, 53, 50, 47, , mrclcmlxt se e.g. (see, complexity umerical n19.TeLoo method Leonov The 1991. in a talw n oestimate to one allows it hat etvl neatLyapunov exact an ffectively ti h hs pc n in and space phase the in et ntos h datg of advantage The unctions. speetdteconnection the presented is vdmnino dynamical of dimension ov o n19 6](e also (see [60] 1991 in nov rs.Ltrtecnetof concept the Later erest. e ..[4 4 6 8 32, 28, 26, 24, [14, e.g. ee, ok tecneto the of concept (the Yorke h ypnvdimension Lyapunov the g iemrhssadits and diffeomorphisms o nvmto ihspe- with method unov ae yKpa and Kaplan by paper l ffoopim n its and iffeomorphisms nain eswithout sets invariant h ypnvdi- Lyapunov the g Yreformula, -Yorke hod. 2. Lyapunov dimension of maps and dynamical systems Consider an autonomous differential equation
u˙ = f(u), f : U Rn Rn, (1) ⊆ → where f is a continuously differentiable vector-function. Suppose that any solution u(t, u0) of (1) such that u(0,u0)= u0 U exists for t [0, ), it is unique and stays in U. Then the evolutionary t ∈ ∈ ∞ operator ϕ (u0)= u(t, u0) is continuously differentiable and satisfies the semigroup property:
ϕt+s(u )= ϕt(ϕs(u )), ϕ0(u )= u t, s 0, u U. (2) 0 0 0 0 ∀ ≥ ∀ 0 ∈ Thus, ϕt is a smooth dynamical system in the phase space (U, ): ϕt , (U Rn, ) . { }t≥0 || · || { }t≥0 ⊆ ||·|| Here u = u2 + + u2 is Euclidean norm of the vector u =(u ,...,u ) Rn. Similarly, one 1 n 1 n can consider|| || a dynamical··· system generated by the difference equation ∈ p u(t +1)= ϕ(u(t)), t =0, 1, .. , (3) where ϕ : U Rn U is a continuously differentiable vector-function. Here ϕt(u)=(ϕ ϕ ϕ)(u), ⊆ → ◦ ◦··· t times ϕ0(u)= u, and the existence and uniqueness (in the forward-time direction) take place for all t 0. t | {z≥ } Further ϕ t≥0 denotes a smooth dynamical system with continuous or discrete time. Consider{ } the linearizations of systems (1) and (3) along the solution ϕt(u):
y˙ = J(ϕt(u))y, J(u)= Df(u), (4)
y(t +1)= J(ϕt(u))y(t), J(u)= Dϕ(u), (5) where J(u) is the n n Jacobian matrix, the elements of which are continuous functions of u. Suppose that det J(u×) =0 u U. Consider the fundamental6 ∀ ∈ matrix, which consists of linearly independent solutions yi(t) n { }i=1 of the linearized system,
Dϕt(u)= y1(t), ..., yn(t) , Dϕ0(u)= I, (6) where I is the unit n n matrix. An important cocycle property of fundamental matrix (6) is as follows × Dϕt+s(u)= Dϕt ϕs(u) Dϕs(u), t, s 0, u U. (7) ∀ ≥ ∀ ∈ t t Let σi(t, u)= σi(Dϕ (u)), i =1, 2, .., n, be the singular values of Dϕ (u) (i.e. σi(t, u) > 0 and 2 t ∗ t σi(t, u) are the eigenvalues of the symmetric matrix Dϕ (u) Dϕ (u) with respect to their algebraic multiplicity), ordered so that σ1(t, u) σn(t, u) > 0 for any u U, t 0. The singular value function of order d [0, n] at the≥ point ···≥u U for Dϕt(u) is defined∈ as ≥ ∈ ∈ 1, d =0, t ω (Dϕ (u)) = σ1(t, u)σ2(t, u) σd(t, u), d 1, 2, .., n , (8) d ··· ∈{ } σ (t, u) σ (t, u)σ (u)d−⌊d⌋, d (0, n), 1 ··· ⌊d⌋ ⌊d⌋+1 ∈ t t where d is the largest integer less or equal to d. Remark that det Dϕ (u) = ωn(Dϕ (u)). Similarly,⌊ ⌋ we can introduce the singular value function for arbitrary| quadratic matrices| and then by the Horn inequality [31] for any two n n matrices A and B and any d [0, n] we have (see, e.g. [10, p.28]) × ∈ ω (AB) ω (A)ω (B), d [0, n]. (9) d ≤ d d ∈ 2 n t Let a nonempty set K U R be invariant with respect to the dynamical system ϕ t≥0, i.e. ϕt(K) = K for all t⊂ > 0.⊆ Since in the numerical experiments only finite time t{can} be considered, for a fixed t 0 let us consider the map defined by the evolutionary operator ϕt(u): ϕt : U Rn U. ≥ The⊆ concept→ of the Lyapunov dimension was suggested in the seminal paper by Kaplan and Yorke [36] and later it was developed in a number of papers (see, e.g. [14, 23, 26, 32, 45]). The following definition is inspirited by Douady and Oesterl´e[20]. Definition 1. The local Lyapunov dimension1 of the map ϕt (or finite-time local Lyapunov di- mension of the dynamical system ϕt ) at the point u U is defined as { }t≥0 ∈ dim (ϕt,u) = inf d [0, n]: ω (Dϕt(u)) < 1 . (10) L { ∈ d } t If the infimum is taken over an empty set (i.e. ωn(Dϕ (u)) 1), we assume that the infimum and considered dimension are taken equal 2 to n. ≥ The Lyapunov dimension of the map ϕt (or finite-time Lyapunov dimension of the dynamical system ϕt ) with respect to the invariant set K is defined as { }t≥0 t t t dimL(ϕ ,K) = sup dimL(ϕ ,u) = sup inf d [0, n]: ωd(Dϕ (u)) < 1 . (11) u∈K u∈K { ∈ }
t The continuity of the functions u σi(Dϕ (u)), i = 1, 2, .., n, on U implies that for any 7→ t d [0, n] and t 0 the function u ωd(Dϕ (u)) is continuous on U (see, e.g. [20],[27, p.554]). Therefore∈ for a compact≥ set K U 7→and t 0 we have ⊂ ≥ t t sup ωd(Dϕ (u)) = max ωd(Dϕ (u)). (12) u∈K u∈K By relation (12) for a compact invariant set K one can prove that
t t dimL(ϕ ,K) = inf d [0, n] : max ωd(Dϕ (u)) < 1 . (13) { ∈ u∈K } In the seminal paper [20] Douady and Oesterl´eproved rigorously that the Lyapunov dimension of the map ϕt with respect to the compact invariant set K is an upper estimate of the Hausdorff dimension of the set K: dim K dim (ϕt,K). (14) H ≤ L For numerical estimations of dimension, the following remark is important. From (7) and (9) it follows that
t+s t s s t s sup ωd(Dϕ (u)) = sup ωd Dϕ (ϕ (u))Dϕ (u) sup ωd(Dϕ (u)) sup ωd(Dϕ (u)) t, s 0 u∈K u∈K ≤ u∈K u∈K ∀ ≥
nt t n and sup ωd(Dϕ (u)) (sup ωd(Dϕ (u))) for any integer n 0. Thus for any t 0 there exists u∈K ≤ u∈K ≥ ≥ τ = τ(t) > 0 such that dim (ϕt+τ ,K) dim (ϕt,K). (15) L ≤ L While in the computations we can consider only finite time t and the map ϕt, from a theoretical point of view, it is interesting to study the limit behavior of finite-time Lyapunov dimension of the dynamical system ϕt with respect to the compact invariant set K. { }t≥0
1This is not a dimension in a rigorous sense (see, e.g. [4, 33, 40]). The notion ’local Lyapunov dimension’ is used, e.g. in [22, 32]. 2 t t t In general, since ω0(Dϕ (u)) 1 and d ωd(Dϕ (u)) is a left-continuous function, we have dimL(ϕ ,u) = t ≡ 7→ n t max d [0,n]: ωd(Dϕ (u)) 1 . If all σi(t,u) 1 are assumed to be positive and ωn(Dϕ (u)) < 1, then in (10) the infimum{ ∈ is achieved (see≥ (21)} and the{ Kaplan-Yorke} formula (23)).
3 t Definition 2. The Lyapunov dimension of the dynamical system ϕ t≥0 with respect to the in- variant set K is defined as { }
t t dimL( ϕ t≥0,K) = inf dimL(ϕ ,K). (16) { } t>0 From (14) and (13) we have
t t dimH K dimL( ϕ t≥0,K) = inf sup dimL(ϕ ,u) (17) ≤ { } t>0 u∈K and (15) implies t t inf dimL(ϕ ,K) = lim inf dimL(ϕ ,K). (18) t>0 t→+∞ Remark that if sup ω (Dϕt(u)) < 1 for a certain d [0, n], then u∈K d ∈ t t inf sup ωd(Dϕ (u)) = lim inf sup ωd(Dϕ (u))=0 (19) t>0 u∈K t→+∞ u∈K and dim ( ϕt ,K) dim (ϕt,K) < d. (20) L { }t≥0 ≤ L Definition 3. (see, e.g. [1]) The finite-time Lyapunov exponents (or the Lyapunov exponent t functions of singular values) of the dynamical system ϕ t≥0 at the point u U are denoted by t { } ∈ LEi(t, u)=LEi(Dϕ (u)), i =1, 2, .., n, and defined as 1 LE (t, u)= ln σ (t, u), t> 0. i t i
Here LE1(t, u) LEn(t, u) for all t> 0 since the singular values are ordered by decreasing. ≥···≥ t t For the sake of simplicity, we assume that ω1(Dϕ (u)) > 1 > ωn(Dϕ (u)) for t > 0,u K. t t t ∈ t Thus, n> dimL(ϕ ,u) > 1 and ωdimL(ϕ ,u)(Dϕ (u)) = 1. Therefore for j(t, u)= dimL(ϕ ,u) and s(t, u) = dim (ϕt,u) dim (ϕt,u) we have ⌊ ⌋ L − ⌊ L ⌋ j(t,u) 1 0= ln(ω (Dϕt(u))) = LE (t, u)+ s(t, u) LE (t, u). (21) t j(t,u)+s(t,u) i j(t,u)+1 i=1 X
Since LEi(t, u) are ordered by decreasing and s(t, u) < 1, we have
m j(t,u)+1 j(t, u) = max m : LE (t, u) 0 , LE (t, u) < 0, LE (t, u) < 0, { i ≥ } i j(t,u)+1 i=1 i=1 X X (22) LE (t, u)+ + LE (t, u) 0 s(t, u)= 1 ··· j(t,u) < 1. ≤ LE (t, u) | j(t,u)+1 | If j(t, u)=0 or j(t, u)= n, then let s(t, u) = 0. The expression
LE (t, u)+ + LE (t, u) dimKY( LE (t, u) n )= j(t, u)+ 1 ··· j(t,u) (23) L { i }i=1 LE (t, u) | j(t,u)+1 |
4 corresponds to the Kaplan-Yorke formula [36] with respect to finite-time Lyapunov exponents (the n 3 set LEi(t, u) 1 , ordered by decreasing ). Remark that there exists s such that s(t, u) < s < 1 { } t t and ωj(t,u)+s(Dϕ (u)) < 1 for any such s, and ωd(Dϕ (u)) 1 for 0 d j(t, u)+ s(t, u). Thus t ≥ ≤ ≤ j(t, u)+ s(t, u) = dimL(ϕ ,u) for j(t, u) and s(t, u) defined by (22). Therefore, we get Proposition 1. For the Lyapunov dimension of the map ϕt (or finite-time Lyapunov dimension of the dynamical system ϕt ) with respect to the compact invariant set K we have { }t≥0 LE (t, u)+ + LE (t, u) dim K sup dim (ϕt,u) = sup dimKY( LE (t, u) n) = sup j(t, u)+ 1 ··· j(t,u) . H ≤ L L { i }1 LE (t, u) u∈K u∈K u∈K | j(t,u)+1 | For numerical computation of the finite-time Lyapunov exponents4 there are developed various continuous and discrete algorithms based on QR and SVD decompositions of fundamental matrix (see, e.g. MATLAB realizations in [44, 55]). However such algorithms may not work well in the case of coincidence or closeness of two or more Lyapunov exponents. Also it is important to remark that numerical computation of the Lyapunov exponents can be done only for a finite time T , the justification of the choice of which is usually omitted, while it is known that in such computations unexpected “jumps” can occur (see, e.g. [15, p.116, Fig.6.3]). The various methods (see, e.g. [2, 30, 73, 80]) are also developed for the estimation of the Lyapunov exponents from time series. However there are known examples in which the results of such computations differ substantially from the analytical results [5, 79].
3 Various characteristics of chaotic behavior are based on the limit values of finite-time Lyapunov exponents (LEs): LEi(u) = lim sup LEi(t,u),i =1, .., n. For example, Kaplan-Yorke formula with respect to LEs is considered t→+∞ in [14, 24] and the sum of positive LEs may be used [66, 71] as the characteristic of Kolmogorov-Sinai entropy rate (see [3, 18, 37, 77]). Relying on ergodicity, the LEs and Lyapunov dimension of attractor are often computed along one trajectory (see also [25, 26, 36, 45]), which is attracted or belongs to the attractor. But, in general, one has to consider a grid of points on K and the corresponding local Lyapunov dimensions (see, e.g. [44, 55]). For a given invariant set K and a given point u0 K there are two essential questions related to the computation of the Lyapunov exponents ∈ KY n and the use of the Kaplan-Yorke formulas of local Lyapunov dimension supu∈K dimL ( lim supt→+∞ LEi(t,u) 1 ): { KY n} whether lim sup LEi(t,u0) = lim LEi(t,u0) is valid, and if not, whether the relation supu∈K dimL ( LEm(u) 1 )= t→+∞ t→+∞ { } KY t n supu∈K\{ϕ (u0),t≥0} dimL ( LEi(u) 1 ) is true. In order to get rigorously the positive answer to these questions, { } t from a theoretical point of view, one may use various ergodic properties of the dynamical system ϕ t≥0 (see, e.g. Oseledets [68], Ledrappier [45], and auxiliary results in [8, 17]). However, from a practical point{ of} view, the rigorous use of the above results is a challenging task (e.g. even for the well-studied Lorenz system) and hardly can be done effectively in the general case (see, e.g. the corresponding discussions in [7],[15, p.118],[70],[81, p.9] and the works [43, 48] on the Perron effects of the largest Lyapunov exponent sign reversals). For an example of the effective rigorous use of the ergodic theory for the estimation of the Hausdorff and Lyapunov dimensions, see, e.g. [75]. 4 Another widely used definition of the Lyapunov exponents goes back to Lyapunov [65]. Finite-time Lyapunov n 1 n t exponents LCEi(t,u) 1 of the fundamental matrix columns (y (t,u), ..., y (t,u)) = Dϕ (u) (called also finite- { } 1 i n time Lyapunov characteristic exponents, LCE) are defined as the set t ln y (t,u) 1 ordered by decreasing for t> 0. In contrast to the definition of the Lyapunov exponents of singular{ values,|| finite-time||} Lyapunov exponents of fundamental matrix columns may be different for different fundamental matrices (see, e.g. [42]). To get the set of all possible values of the Lyapunov exponents of fundamental matrix columns (the set with the minimal sum of values), one has to consider the so-called normal fundamental matrices [65]. Using, e.g, Courant-Fischer theorem [31], it is possible to show that LCE1(t,u)=LE1(t,u) and LEi(t,u) LCEi(t,u) for 1