Finite-time Lyapunov dimension and hidden attractor of the Rabinovich system

The Rabinovich system, describing the process of interaction between waves in plasma, is considered. It is shown that the Rabinovich system can exhibit a hidden attractor in the case of multistability as well as a classical self-excited attractor. The hidden attractor in this system can be localized by analytical/numerical methods based on the continuation and perpetual points. The concept of finite-time Lyapunov dimension is developed for numerical study of the dimension of attractors. A conjecture on the Lyapunov dimension of self-excited attractors and the notion of exact Lyapunov dimension are discussed. A comparative survey on the computation of the finite-time Lyapunov exponents and dimension by different algorithms is presented. An adaptive algorithm for studying the dynamics of the finite-time Lyapunov dimension is suggested. Various estimates of the finite-time Lyapunov dimension for the hidden attractor and hidden transient chaotic set in the case of multistability are given.


Introduction
One of the main tasks of the investigation of dynamical systems is the study of established (limiting) behaviour of the system after transient processes, i.e. the problem of localization and analysis of attractors (limited sets of the system states, which are reached by the system from close initial data after transient processes) [1][2][3]. While trivial attractors (stable equilibrium points) can be easily found analytically or numerically, the search of periodic and chaotic attractors can turn out to be a challenging problem (see, e.g. famous 16th Hilbert problem [4] on the number of coexisting periodic attractors in twodimensional polynomial systems, which was formulated in 1900 and is still unsolved, and its generalization for multidimensional systems with chaotic attractors [5]). For numerical localization of an attractor, one needs to choose an initial point in the basin of attraction and observe how the trajectory, starting from this initial point, after a transient process visualizes the attractor. Self-excited attractors, even coexisting in the case of multistability [6], can be revealed numerically by the integration of trajectories, started in small neighbourhoods of unstable equilibria, while hidden attractors have the basins of attraction, which are not connected with equilibria and are "hidden somewhere" in the phase space [7][8][9][10]. Remark that in numerical computation of trajectory over a finite-time interval, it is difficult to distinguish a sustained chaos from a transient chaos (a transient chaotic set in the phase space, which can persist for a long time) [11]. The search and visualization of hidden attractors and transient sets in the phase space are challenging tasks [12].
In this paper, we study hidden attractors and transient chaotic sets in the Rabinovich system. It is shown that the methods of numerical continuation and perpetual point are helpful for localization and understanding of hidden attractor in the Rabinovich system.
For the study of chaotic dynamics and dimension of attractors, the concept of the Lyapunov dimension [13] was found useful and became widely spread [14][15][16][17][18]. Since only a finite time can be considered in the numerical analysis of dynamical system, in this paper we develop the concept of the finite-time Lyapunov dimension [19] and approaches to its reliable numerical computation. A new adaptive algorithm for the computation of finite-time Lyapunov dimension and exponents is used for studying the dynamics of the dimension. Various estimates of the finite-time Lyapunov dimension for the Rabinovich hidden attractor in the case of multistability are given.

The Rabinovich system: interaction between waves in plasma
Consider a system, studied in 1978 by Rabinovich [20] and Pikovski et al. [21], describing the interaction of three resonantly coupled waves, two of which are parametrically excited. Here, the parameter h is proportional to the pumping amplitude and the parameters ν 1,2 are normalized dumping decrements.
After the linear transformation (see, e.g. [22]): and time rescaling: we obtain a generalized Lorenz system: where System (4) with a = 0 coincides with the classical Lorenz system [23]. As it is discussed in [22], system (4) can also be used to describe the following physical processes: the convective fluid motion inside rotating ellipsoid, the rotation of rigid body in viscous fluid, the gyrostat dynamics, the convection of horizontal layer of fluid making harmonic oscillations and the model of Kolmogorov's flow.

Attractors and transient chaos
Consider system (4) as an autonomous differential equation of general form: where u = (x, y, z) ∈ R 3 , and the continuously differentiable vector function f : R 3 → R 3 represents the right-hand side of system (4). Define by u(t, u 0 ) a solution of (7) such that u(0, u 0 ) = u 0 . For system (7), a bounded closed invariant set K is where dist(K , u) = inf v∈K ||v − u|| is the distance from the point u ∈ R 3 to the set K ⊂ R 3 (see, e.g. [9]). Since the whole phase space is a global attractor and any finite union of attractors is again an attractor, it is reasonable to consider only minimal global and local attractors, i.e. the smallest bounded closed invariant set possessing the property (ii) or (i).
Computational errors (caused by a finite precision arithmetic and numerical integration of differential equations) and sensitivity to initial data allow one to get a visualization of chaotic attractor by one pseudotrajectory computed for a sufficiently large time interval. One needs to choose an initial point in the basin of attraction of the attractor and observe how the trajectory, starting from this initial point, after a transient process visualizes the attractor. Thus, from a computational point of view, it is natural to suggest the following classification of attractors, based on the simplicity of finding the basins of attraction in the phase space.
Definition 1 [7,9,10,25] An attractor is called a selfexcited attractor if its basin of attraction intersects with any open neighbourhood of an equilibrium; otherwise it is called a hidden attractor.
For a self-excited attractor, its basin of attraction is connected with an unstable equilibrium and, therefore, self-excited attractors can be found numerically by the standard computational procedure in which after a transient process, a trajectory, starting in a neighbourhood of an unstable equilibrium, is attracted to the state of oscillation and then traces it; then, the computations are being performed for a grid of points in vicinity of the state of oscillation to explore the basin of attraction and improve the visualization of the attractor. Thus, self-excited attractors can be easily visualized (e.g. the classical Lorenz and Hénon attractors are self-excited with respect to all existing equilibria and can be easily visualized by a trajectory from their vicinities).
For a hidden attractor, its basin of attraction is not connected with equilibria and, thus, the search and visualization of hidden attractors in the phase space may be a challenging task. Hidden attractors are attractors in the systems without equilibria (see, e.g. rotating electromechanical systems with Sommerfeld effect (1902) [26,27]), and in the systems with only one stable equilibrium (see, e.g. counterexamples [7,28] to Aizerman's (1949) and Kalman's (1957) conjectures on the monostability of nonlinear control systems [29,30]). One of the first related problems is the second part of 16th Hilbert problem [4] on the number and mutual disposition of limit cycles in two-dimensional polynomial systems, where nested limit cycles (a special case of multistability and coexistence of periodic attractors) exhibit hidden periodic attractors (see, e.g. [7,31,32]). The classification of attractors as being hidden or selfexcited was introduced by Leonov and Kuznetsov in connection with the discovery of the first hidden Chua attractor [25,[33][34][35][36][37][38] and has captured much attention of scientists from around the world (see, e.g. ).
Since in numerical computation of trajectory over a finite-time interval, it is difficult to distinguish a sustained chaos from a transient chaos (a transient chaotic set in the phase space, which can nevertheless persist for a long time) [11,69], a similar classification can be introduced for the transient chaotic sets.
Definition 2 [70,71] A transient chaotic set is called a hidden transient chaotic set if it does not involve and attract trajectories from a small neighbourhood of equilibria; otherwise, it is called self-excited.
In order to distinguish an attracting chaotic set (attractor) from a transient chaotic set in numerical experiments, one can consider a grid of points in a small neighbourhood of the set and check the attraction of corresponding trajectories towards the set.
For system (1) with parameters ν 1 = 1, ν 2 = 4, and increasing h, it is possible to observe [21] the classical scenario of transition to chaos (via homoclinic and subcritical Andronov-Hopf bifurcations) similar to the scenario in the Lorenz system. For 4.84 h 13.4 in system (1), there is a self-excited chaotic attractor (see e.g. Fig. 1), which coexists with two stable equilibria. The same scenario can be obtained for system (4) when parameters b > 0 and a < 0 are fixed and r is increasing. Besides self-excited chaotic attractors, a hidden attractor was found [71,72] in the system. Note that in [9,73], system (4) with a > 0 was studied and a hidden attractor was also found numerically.
Further, we localize a hidden chaotic attractor in system (4) with a < 0 by the numerical continuation : coexistence of three local attractors-two stable equilibria S ± and a chaotic self-excited attractor (self-excited with respect to the unstable zero equilibrium S 0 ) method starting from a self-excited chaotic attractor. We change parameters, considered in [72], in such a way that the chaotic set is located not too close to the unstable zero equilibrium to avoid a situation, when numerically integrated trajectory oscillates for a long time and then falls on the unstable manifold of unstable zero equilibrium, leaves the chaotic set and tends to one of the stable equilibria.

Localization via numerical continuation method
One of the effective methods for numerical localization of hidden attractors in multidimensional dynamical systems is based on the homotopy and numerical continuation method (NCM). It is based on the assumption that the position of the attractor changes continuously with the parameters changing. The idea is to construct a sequence of similar systems such that for the first (starting) system, the initial point for numerical computation of oscillating solution (starting attractor) can be obtained analytically, for example, it is often possible to consider the starting system with a self-excited starting attractor; then, the transformation of this starting attractor in the phase space is tracked numerically while passing from one system to another; the last system corresponds to the system in which a hidden attractor is searched.
For the study of the scenario of transition to chaos, we consider system (7) with f (u) = f (u, λ), where λ ∈ Λ ⊂ R d is a vector of parameters, whose variation in the parameter space Λ determines the scenario. Let λ end ∈ Λ define a point corresponding to the system, where a hidden attractor is searched. Choose a point λ begin ∈ Λ such that we can analytically or numerically localize a certain nontrivial (oscillating) attractor A 1 in system (7) with λ = λ begin (e.g. one can consider a self-excited attractor, defined by a trajectory u 1 (t) numerically integrated on a sufficiently large time interval t ∈ [0, T ] with the initial point u 1 (0) in the vicinity of an unstable equilibrium). Consider a path 1 in the parameter space Λ , i.e. a continuous function γ : [0, 1] → Λ for which γ (0) = λ begin and γ (1) = λ end , and a sequence of points {λ j } k j=1 on the path, where λ 1 = λ begin , λ k = λ end , such that the distance between λ j and λ j+1 is sufficiently small. On each next step of the procedure, the initial point for a trajectory to be integrated is chosen as the last point of the trajectory integrated on the previous step: u j+1 (0) = u j (T ). Following this procedure and sequentially increasing j, two alternatives are possible: the points of A j are in the basin of attraction of attractor A j+1 , or while passing from system (7) with λ = λ j to system (7) with λ = λ j+1 , a loss of stability bifurcation is observed and attractor A j vanishes. If under changing λ from λ begin to λ end , there is no loss of stability bifurcation of the considered attractors, then a hidden attractor for λ k = λ end (at the end of the procedure) is localized.

Localization using perpetual points
The equilibrium points of a dynamical system are the ones at which the velocity and acceleration of the system simultaneously become zero. In this section, we show that there are points, termed as perpetual points [74], which may help to visualize hidden attractors.
For system (7), the equilibrium points u ep are defined by the equationu = f (u ep ) = 0. Consider a derivative of system (7) with respect to time: where is the Jacobian matrix.
Here, g(u) may be termed as an acceleration vector. 1 In the simplest case, when d = 1, the path is a line segment.
System (9) shows the variation of acceleration in the phase space. Similar to the equilibrium points estimation, where we set the velocity vector to zero, we can also get a set of points, whereü = g(u pp ) = 0 in (9), i.e. the points corresponding to the zero acceleration. At these points, the velocityu may be either zero or nonzero. This set includes the equilibrium points u ep with zero velocity as well as a subset of points with nonzero velocity. These nonzero velocity points u pp are termed as perpetual points [12,[74][75][76]. (4) can be derived from the following system The reason why perpetual points may lead to hidden states [perpetual point method (PPM)] is still discussed (see, e.g. [77,78]).

Hidden attractor in the Rabinovich system
Next, we apply the NCM for localization of a hidden attractor in the Rabinovich system (4) and check whether the attractor can be also localized using PPM.
In this experiment, we fix parameter r and, using condition (ii) of Lemma 1, define parameters a = − 1 The eigenvalues of the Jacobian matrix at the equilibria S 0 , S ± of system (4) for these parameters are the following: for the localization of hidden attractor in system (4) with r = 100. Here, i.e. the equilibrium S 0 remains saddle and the equilibria S ± become stable focus-nodes The initial point P 0 (a 0 , b 0 ) corresponds to the parameters for which in system (4), there exists a selfexcited attractor. Then for the considered line segment, a sufficiently small partition step is chosen, and at each iteration step of the procedure, an attractor in the phase space of system (4) is computed. The last computed point at each step is used as the initial point for the computation at the next step. In this experiment, we use NCM with 3 steps on the path Fig. 2). At the first step, we have self-excited attractor with respect to unstable equilibria S 0 and S ± ; at the second step, the equilibria S ± become stable but the attractor remains self-excited with respect to equilibrium S 0 ; at the third step, it is possible to visualize a hidden attractor of system (4) (see Fig. 3).
Around equilibrium S 0 , we choose a small spherical vicinity of radius δ (in our experiments, we check δ ∈ [0.1, 0.5]) and take N random initial points on it (in our experiment, N = 4000). Using MATLAB, we integrate system (4) with these initial points in order to explore the obtained trajectories. We repeat this procedure several times in order to get different initial points for trajectories on the sphere. We get the following results: all the obtained trajectories attract to either the stable equilibrium S + or the equilibrium S − and do not tend to the attractor. This gives us a reason to classify the chaotic attractor, obtained in system (4), as the hidden one.
Remark that there exist hidden chaotic sets in the Rabinovich system, which cannot be localized by PPM. For example, for parameters r = 6.8, a = −0.5, b ∈ [0.99, 1] [72], the hidden attractor obtained by NCM is not localizable via PPM (see Fig. 5).

Finite-time and limit values of the Lyapunov dimension and Lyapunov exponents
The Lyapunov exponents [2] and Lyapunov dimension [13] are widely used for the study of attractors (see, e.g. [14][15][16][17][18]). Nowadays, various approaches to the definition of Lyapunov dimension are used. Since in numerical experiments we can consider only finite time, in this paper we develop the concept of finite-time Lyapunov dimension [19] and an approach to its reliable numerical computation. This approach is inspirited by the works of Douady and Oesterlé [79], Hunt [80], and Rabinovich et al. [81]. For a fixed t ≥ 0 let us consider the map ϕ t : R 3 → R 3 defined by the shift operator along the solutions of system (7): ϕ t (u 0 ) = u(t, u 0 ), u 0 ∈ R 3 . Since system (7) possesses an absorbing set [see (8)], the existence and uniqueness of solutions of system (7) for t ∈ [0, +∞) take place and, therefore, the system generates a dynamical system {ϕ t } t≥0 . Let a nonempty closed bounded set K ⊂ R 3 be invariant with respect to the dynamical system {ϕ t } t≥0 , i.e. ϕ t (K ) = K for all t ≥ 0 (e.g. K is an attractor). Further, we use Step 3 : a = −9.965 · 10 −2 , b = 7.7454 · 10 −2 , Fig. 3 Localization, by NCM, of a hidden attractor in system where J (u) is the 3×3 Jacobian matrix, the elements of which are continuous functions of u, and suppose that det J (u) = 0 ∀u ∈ R 3 . Consider a fundamental matrix of solutions of linear system (11), Dϕ t (u), such that Dϕ 0 (u) = I , where I is a unit 3×3 matrix. Denote by σ i (t, u) = σ i (Dϕ t (u)), i = 1, 2, 3, the singular values of Dϕ t (u) (i.e. σ i (t, u) > 0 and σ i (t, u) 2 are the eigenvalues of the symmetric matrix Dϕ t (u) * Dϕ t (u) with respect to their algebraic multiplicity), 2 ordered so that σ 1 (t, u) ≥ σ 2 (t, u) ≥ σ 3 (t, u) > 0 for any u ∈ R 3 and t > 0.
A singular value function of order d ∈ [0, 3] is defined as where d is the largest integer less or equal to d. For a certain moment of time t ≥ 0, the finite-time local Lyapunov dimension at the point u is defined as [19] dim L (t, u) = max{d ∈ [0, 3] : ω d (Dϕ t (u)) ≥ 1} (12) and the finite-time Lyapunov dimension of K is defined as The Douady-Oesterlé theorem [79] implies that for any fixed t ≥ 0, the Lyapunov dimension of the map ϕ t with respect to a closed bounded invariant set K , defined by (13), is an upper estimate of the Hausdorff dimension of the set K : For the estimation of the Hausdorff dimension of invariant closed bounded set K , one can use the map ϕ t with any time t (e.g. t = 0 leads to the trivial estimate dim H K ≤ 3) and, thus, the best estimation is dim H K ≤ inf t≥0 dim L (t, K ). The following property 2 Symbol * denotes the transposition of matrix. allows one to introduce the Lyapunov dimension of K as [19] dim L K = lim inf t→+∞ sup u∈K dim L (t, u) (15) and get an upper estimation of the Hausdorff dimension: Recall that a set K with noninteger Hausdorff dimension is referred to as a fractal set [15] and, when such set K is an attractor, it is called a strange attractor [82,83]. Consider a set of finite-time Lyapunov exponents 3 at the point u: Thus, we get an analog of the Kaplan-Yorke formula [13] with respect to the set of finite-time Lyapunov exponents which gives the finite-time local Lyapunov dimension: ). Thus, in the above approach, the use of Kaplan-Yorke formula (17) with the finite-time Lyapunov exponents is rigorously justified by the Douady-Oesterlé theorem.
Note that the Lyapunov dimension is invariant under Lipschitz diffeomorphisms [19,86], i.e. if the dynamical system {ϕ t } t≥0 and closed bounded invariant set K under a smooth change of coordinates w = χ(u) are transformed into the dynamical system {ϕ t χ } t≥0 and closed bounded invariant set χ(K ), respectively, then dim L ({ϕ t } t≥0 , K ) = dim L ({ϕ t χ } t≥0 , χ(K )). Also the Lyapunov dimension is invariant under positive time rescaling t → at, a > 0.

Adaptive algorithm for the computation of the finite-time Lyapunov dimension and exponents
Applying the statistical physics approach and assuming the ergodicity (see, e.g. [13,[87][88][89]), the Lyapunov dimension of attractor dim L K is often estimated by the local Lyapunov dimension dim L (t, u 0 ), corresponding to a "typical" trajectory, which belongs to the attractor: {u(t, u 0 ), t ≥ 0}, u 0 ∈ K , and its limit value lim t→+∞ dim L (t, u 0 ). However, from a practical point of view, the rigorous verification of ergodicity is a challenging task [84,90] and hardly it can effectively be done in a general case (see, e.g. discussions in [91], [ are called the absolute ones, and it is noted that the absolute Lyapunov exponents rarely exist 4 (in this case, one also has dim L  Note also that even if a numerical approximation (visualization) K of the attractor K is obtained, it is not straightforward how to get a point on the attractor itself: u 0 ∈ K . Thus, an easy way to get reliable estimation of the Lyapunov dimension of attractor K is to localize the attractor K ⊂ K ε , to consider a grid of points K ε grid on K ε , and to find the maximum of the corresponding finite-time local Lyapunov dimensions for a certain time t = T : max Concerning the time T , remark that while the time series obtained from a physical experiment are assumed to be reliable on the whole considered time interval, the time series produced by the integration of mathematical dynamical model (7) can be reliable on a limited time interval only 5 due to computational errors (caused by finite precision arithmetic and numerical integration of ODE). Thus, in general, the closeness of the real trajectory u(t, u 0 ) and the corresponding pseudotrajectoryũ(t, u 0 ) calculated numerically can be guaranteed on a limited short time interval only. For the numerical visualization of a chaotic attractor, the computation of a pseudo-trajectory on a longer time interval often allows one to obtain a more complete visualization of the attractor (pseudo-attractor) due to computational errors and sensitivity to initial data. However, for two different long-time pseudo-trajectoriesũ(t, u 1 0 ) andũ(t, u 2 0 ) visualizing the same attractor, the corresponding finite-time LEs can be, within the considered error, similar due to averaging over time [see (16)] and similar sets of points {ũ(t, u 1 0 )} t≥0 and {ũ(t, u 2 0 )} t≥0 . At the same time, the corresponding real trajectories u(t, u 1,2 0 ) may have different LEs (e.g. u 0 may correspond to an unstable periodic trajectory u(t, u 0 ), which is embedded in the attractor and does not allow one to visualize it). Here, one may recall the question [105, p. 98] (known as Eden conjecture) whether the supremum of the local Lyapunov dimensions is achieved on a stationary point or an unstable periodic orbit embedded in 5 In [102,103]  [0, 15,000], but finally u(t, u 0 ) converges to a stable stationary point as t → ∞ and has nonpositive limit Lyapunov exponents (see, e.g. [71]). the strange attractor. Thus, the numerical computation of trajectory for a longer time may not lead to a more precise approximation of the Lyapunov exponents and dimension (see, also example (24) below). Also any long-time computation may be insufficient to reveal the limit values of LEs if the trajectory belongs to a transient chaotic set, which can be (almost) indistinguishable numerically from sustained chaos (see Figs. 9a, 10a). Note that there is no rigorous justification of the choice of t and it is known that unexpected jumps of dim L (t, K ) can occur (see, e.g. Fig. 7). Thus, for a finite time interval t ∈ [0, T ), it is reasonable to compute inf t∈[0,T ) dim L (t, K ) instead of dim L (T, K ), but, at the same time, for any T the value dim L (T, K ) gives an upper estimate of dim H K .
Finally, in the numerical experiments, based on the finite-time Lyapunov dimension definition (15) [19] and the Douady-Oesterlé theorem [79], we have Additionally, we can consider a set of random points in K ε . If the maximums of the finite-time local Lyapunov dimensions for random points and grid points differ more than by δ, then we decrease the distance between grid points. This may help to improve the reliability of the result and at the same time to ensure its repeatability. Nowadays, there are several widely used approaches to numerical computation of the Lyapunov exponents; thus, it is important to state clearly how the LEs are being computed [92, p. 121]. Next, we demonstrate some differences in the approaches. For a certain u 0 ∈ R 3 , to compute the finite-time Lyapunov exponents according to (16), one has to find the fundamental matrix Φ(T, u 0 ) = Dϕ T (u 0 ) of (11) from the following variational equation: and its singular value decomposition (SVD) 6 : u 0 ), and compute the finite-time Lyapunov exponents {LE i (T, u 0 )} 3 1 from (T, u 0 ) as in (16). Further, we also need the QR decomposition 7 To avoid the exponential growth of values in the computation, the time interval has to be represented as a union of sufficiently small intervals, for example, (0, T ] = (0, τ ]∪(τ, 2τ ] · · ·∪((k−1)τ, kτ = T ]. Then, using the cocycle property, the fundamental matrix can be represented as (20) Here, if Φ(mτ, u 0 ) and u m = u(mτ, u 0 ) are known, u m ) is the solution of initial value problem (19) with u(0) = u m on the time interval [0, τ ].
By sequential QR decomposition of the product of matrices in (20), we get Then, the matrix with singular values in the SVD can be approximated by sequential QR decomposition of the product of matrices: is a lower triangular matrix and [107,108] Thus, the finite-time Lyapunov exponents can be approximated as The MATLAB implementation of the above method for the computation of finite-time Lyapunov exponents with the fixed number of iterations p can be found, for example, in [9]. For large k, the convergence can be very rapid: for example, for the Lorenz system with the classical parameters (r = 28, σ = 10, b = 8/3, a = 0), k = 1000 and τ = 1, the number of approximations p = 1 is taken in [108, p. 44]. For a more precise approximation of the finite-time Lyapunov exponents, we can adaptively choose p = p(l), l = 1, . . . , k so as to obtain a uniform estimate: Remark that there is another widely used definition of the "Lyapunov exponents" via the exponential growth rates of norms of the fundamental matrix 3 1 are the set { 1 t ln ||v i (t, u 0 )||} 3 1 ordered by decreasing. 8 Relying on ergodicity [84], Benettin et al. [109] (Benettin's algorithm; see also Wolf et al. [110]) approximate the LCEs by (21) with p = 0: The LCEs may differ from LEs, thus, the corresponding Kaplan-Yorke formulas with respect to LEs and LCEs: dim 9 may not coincide. The following artificial analytical example demonstrates the possible difference between LEs and LCEs. The matrix [19,86] has the following exact limit values where LCE 2 = LE 2 . For the finite-time values we have Approximations by the above algorithm with k = 1 are given in Table 1.
Remark that here the approximation of LCEs and LEs by Benettin's algorithm, i.e. by (23), becomes worse with increasing time:

Estimation of the Lyapunov dimension without integration of the system and the exact Lyapunov dimension
While analytical computation of the Lyapunov exponents and Lyapunov dimension is impossible in a general case, they can be estimated by the eigenvalues of the symmetrized Jacobian matrix [79,112].
be the eigenvalues of the symmetrized Jacobian matrix 1 2 (J (u) + J (u) * ), ordered so that λ 1 (u) ≥ λ 2 (u) ≥ λ 3 (u). The Kaplan-Yorke formula with respect to the ordered set of eigenvalues of the symmetrized Jacobian matrix [19] gives an upper estimation of the Lyapunov dimension: In a general case, one cannot get the same values of i on K has to be computed. To avoid numerical localization of the set K , we can consider an analytical localization, e.g. by the absorbing set B ⊃ K . Then for the corresponding grid of points B grid , we expect in numerical experiments the following: If the Jacobian matrix J (u eq ) at one of the equilibria has simple real eigenvalues: [19,86] the invariance of the Lyapunov dimension with respect to linear change of variables implies If the maximum of local Lyapunov dimensions on the global attractors, which involves all equilibria, is achieved at an equilibrium point: dim L u cr eq = max u∈K dim L u, then this allows one to get analytical formula for the exact Lyapunov dimension. 10 In general, a conjecture on the Lyapunov dimension of selfexcited attractor [19,114] is that for a typical system, the Lyapunov dimension of a self-excited attractor does not exceed the Lyapunov dimension of one of the unstable equilibria, the unstable manifold of which intersects with the basin of attraction and visualizes the attractor.
To avoid numerical computation of the eigenvalues, one can use an effective analytical approach [19,22,115], which is based on a combination of the Douady-Oesterlé approach with the direct Lyapunov method: for example, in [22] for system (4) with b = 1, it analytically obtained the following estimate The proof of the above conjecture and analytical derivation of the exact Lyapunov dimension formula for system (4) with all possible parameters is an open problem. In [116,117], it is demonstrated how the above technique can be effectively used to derive constructive upper bounds of the topological entropy of dynamical systems.

The finite-time Lyapunov dimension in the case of hidden attractor and multistability
Consider the dynamical system {ϕ t } t≥0 , generated by system (4) with parameters (5), and its attractor K .
Here, ϕ t (x 0 , y 0 , z 0 ) is a solution of (4) with the initial data (x 0 , y 0 , z 0 ). Since the dynamical system {ϕ t R } t≥0 , generated by the Rabinovich system (1), can be obtained from {ϕ t } t≥0 by the smooth transformation χ −1 , inverse to (2), and inverse rescaling time In our experiments, we consider system (4) with parameters r = 100, a = The results are given in Table 2. The dynamics of finite-time local Lyapunov dimensions for different points and their maximums on the grid of points are shown in Fig. 7.
For the absorbing set B h and the corresponding grid of points B h grid (the distance between grid points is 5), by estimation (25), we get the following estimate: Assuming σ + 1 ≥ b, the eigenvalues of the unstable zero equilibrium S 0 : are ordered by decreasing, i.e. λ 1 (S 0 ) > λ 2 (S 0 ) ≥ λ 3 (S 0 ). Therefore, for the considered values of parameters by (26), we get The above numerical experiments lead us to the following important remarks. While the Lyapunov dimen- and how the finite-time Lyapunov exponents were computed (e.g. by (23), (21), or (22) with the parameter δ).

Computation of the Lyapunov dimension and transient chaos
Consider an example, which demonstrates difficulties in the reliable numerical computation of the Lyapunov dimension (i.e. numerical approximation of the limit values of the finite-time Lyapunov dimensions).
Since the lifetime of transient chaotic process can be extremely long and taking into account the limitations of reliable integration of chaotic ODEs, even longtime numerical computation of the finite-time Lyapunov exponents and the finite-time Lyapunov dimension does not necessarily lead to a relevant approximation of the Lyapunov exponents and the Lyapunov dimension [see also effects in (24)].

Conclusion
In this work, the Rabinovich system, describing the process of interaction between waves in plasma, is considered. It is shown that the methods of numerical continuation and perpetual point are helpful for the localization and understanding of hidden attractor in the Rabinovich system. For the study of dimension of the hidden attractor, the concept of the finite-time Lyapunov dimension is developed. An approach to reliable numerical estimation of the finite-time Lyapunov exponents [see (21) and (22)] and finite-time Lyapunov dimension [see (18)] is suggested. Various numerical estimates of the finite-time Lyapunov dimension for the hidden attractor in the case of multistability are given.