Analysis of Chaotic Dynamics by the Extended Entropic Chaos Degree

The Lyapunov exponent is the most-well-known measure for quantifying chaos in a dynamical system. However, its computation for any time series without information regarding a dynamical system is challenging because the Jacobian matrix of the map generating the dynamical system is required. The entropic chaos degree measures the chaos of a dynamical system as an information quantity in the framework of Information Dynamics and can be directly computed for any time series even if the dynamical system is unknown. A recent study introduced the extended entropic chaos degree, which attained the same value as the total sum of the Lyapunov exponents under typical chaotic conditions. Moreover, an improved calculation formula for the extended entropic chaos degree was recently proposed to obtain appropriate numerical computation results for multidimensional chaotic maps. This study shows that all Lyapunov exponents of a chaotic map can be estimated to calculate the extended entropic chaos degree and proposes a computational algorithm for the extended entropic chaos degree; furthermore, this computational algorithm was applied to one and two-dimensional chaotic maps. The results indicate that the extended entropic chaos degree may be a viable alternative to the Lyapunov exponent for both one and two-dimensional chaotic dynamics.


Introduction
The Lyapunov exponent (LE) is the most commonly used measure for quantifying the chaos of non-linear dynamical systems. The LE measures the average exponential separation rate of orbits with infinitesimally close initial points. The orbit produced by a smooth map f on R d is referred to as chaotic if the largest LE among all d LEs is positive. In principle, the Jacobian matrix: J n (x) = D f n (x) is necessary to compute LEs. However, in general, obtaining an explicit formula for J n (x) for a large n is challenging. In actual numerical computations, the LEs of a map f are obtained by approximating the image ellipsoid J n U of the unit sphere U. This approach involves the chain rule and the Gram-Schmidt orthogonalization procedure to compute the LEs of the map f [1]. Subsequently, all the LEs of the map f on R d can be computed, provided the Jacobian matrix J 1 (x) = D f (x) can be obtained.
Thus, LEs for a time series are generally incomputable in the absence of any information regarding the Jacobian matrix, J 1 (x). Therefore, researchers have suggested various estimation methods of LEs for a time series [2][3][4][5][6][7]. The largest LE for a time series may be estimated using these methods. However, estimating all the LEs and their total sum for the time series is not always possible.
The chaos degree quantifies the chaos of a dynamical system as follows: C(Λ * ϕ) − T(ϕ; Λ * ) in Information Dynamics [8]. Here, ϕ is referred to as the state and Λ * as a channel associated with the state change ϕ → Λ * ϕ. C(ϕ) is the complexity of the state ϕ and T(ϕ; Λ * ) is the transmitted complexity associated with the state change ϕ → Λ * ϕ. A channel Λ * is referred to as chaotic in the definition of Information Dynamics, provided chaos degree is positive. In a classical dynamical system, state ϕ and channel Λ * are provided as a probability distribution p (n) at time n and a transition probability matrix from p (n) at time n to p (n+1) at time n + 1. By substituting the Shannon entropy S(Λ * p (n) ) and the mutual entropy I(p (n) ; Λ * ) for C(Λ * ϕ) and T(ϕ; Λ * ) respectively, the entropic chaos degree (ECD) is obtained from S(Λ * p (n) ) − I(p (n) ; Λ * ) in classical dynamical systems [9]. Thus, the ECD becomes an information quantity equivalent to conditional entropy: S p (n+1) p (n) in classical dynamical systems. The ECD offers the advantage of being directly computable for time-series data, even if the dynamical equation generating the time-series data is unknown. Using the ECD, an attempt to characterize chaotic behaviors has been made [9][10][11].
There exists a relationship between the LE and ECD [12]. Unfortunately, the ECD is not always sufficient to be used as an alternative to the LE because it always attains a higher value than the LE for any chaotic map [13]. Therefore, based on the interpretation of the difference between the ECD and LE, an improved ECD was proposed for a one-dimensional chaotic map, and it was shown that the improved ECD is equivalent to the LE under typical chaotic conditions [13,14]. Furthermore, the extended entropic chaos degree (EECD) was introduced as an extended improved ECD to a multidimensional chaotic map. Further, it has also been shown that the EECD coincides with the sum of all LEs in typical chaotic conditions [15].
However, the above relationship between the EECD and LEs assumes several conditions, such that the numbers of mapping points and all components of the equipartition of I in the map from I to I must take the limit of infinity. However, these numbers must be set as finite numbers in actual numerical computations. Therefore, an improved calculation formula for the EECD was proposed, such that the EECD is almost computable as the sum of all LEs of a typical multidimensional chaotic map in actual numerical computations [16].
This study shows that all LEs of a multidimensional chaotic map can be estimated using an improved calculation formula for the EECD and proposes a computational algorithm for the EECD. Moreover, the computational algorithm of the EECD was applied to specific typical chaotic maps.

Entropic Chaos Degree
This section briefly reviews the definition of the ECD for a difference equation system. Let f be a map, such that f : I → I (≡ [a, b] d ). Consider the following difference equation: x n+1 = f (x n ), n = 0, 1, . . . . Let x 0 be an initial value and let {A i } be a finite partition of I such that: where A i is a Borel measurable subset of I. Then, the probability distribution p and the joint distribution p (n,n+1) i,j,A (M) at times n and n + 1, associated with the difference equation, is expressed as: where 1 A is the characteristic function of the set A. Subsequently, the ECD D of an orbit {x n } is defined as in [8] as: where p (n) Further, using the ECD, the orbit {x n } associated with the map f is uniquely determined in the definition of Information Dynamics (ID) in [8] as follows: Here, the ECD is denoted as D (M) (A, f ) without n, provided the orbit {x n } does not depend on time n. In a similar manner, the ECD is denoted as D (M,n) (A) without f , provided the orbit {x n } is not generated by the map f . However, the unique definitions of the orbit in ID may not be consistent with the original properties of the orbit. The basic properties of the ECD in [12] are briefly reviewed.
Let M be a sufficiently large natural number and let f be a one-dimensional map from I to I where I = [a, b]. Let {A i } be the L-equipartition of I, such that where Subsequently, the following theorems are proved in [12]: If the map f creates a stable periodic orbit, then the following equality holds: Theorem 2. Further, if the LE of f is positive, the following inequality holds:

Theorem 3.
Let λ( f ), λ(g) be the LEs of f , g such that f , g are differentiable almost everywhere in I. Assume that the absolute values d f dx (x) , dg dx (x) are constants for all x ∈ I. If λ( f ) ≥ λ(g) > 0, the following inequality holds for sufficiently large M: However, in Theorem 2, not vice versa because D (M,n) (A, f ) > 0 for a quasi-periodic orbit [12]. In Theorem 3, it is assumed that the maps f , g are piecewise linear functions, such as the Bernoulli shift map and the tent map. Next, the relationship between the ECD and the metric entropy is focused on. Let T be a measurable transformation from I to I, preserving a probability measure µ on I, and ξ provides a measurable partition of I. Then, the metric entropy of T with respect to µ and ξ of I is defined by in [17], Then, for sufficiently large M, ECD D (M) (ξ, T) is equal to or larger than the metric entropy h µ (T, ξ): see [16]. Using the ECD, the characterization of certain chaotic behaviors has been attempted by the authors of papers such as [9][10][11]. Unfortunately, the ECD is not always sufficient for use as an alternative to the LE because the ECD always attains a higher value than the LE for chaotic maps [13].

Extended Entropic Chaos Degree
This section briefly reviews the definition of the EECD for a difference equation system. where for k = 1, . . . , d.

Further, for any component
of smaller components, such that Using the function g i,j for any two components here, the numerator of R(S i,j ) is the number of B (i,j) l in A j ∩ f (A i ) for any A i and A j and the denominator of R(S i,j ) is the number of B (i,j) l in A j for any A i and A j . Thus, R(S i,j ) represents the volume rate of A j ∩ f (A i ) to A j at the 1/S i,j scale. Moreover, it was directly obtained from [15] lim where m denotes the Lebesgue measure of R d . Then, the EECD D S is defined in [15] as Clearly, the EECD becomes the ECD only if R(S i,j ) = 1 for any A i and A j . In other words, from Equation (8), the ECD always regards m(A j ∩ f (A i )) as m(A j ) in the infinite limit of S i,j . This results in a difference between the ECD and LE for chaotic maps [15].
First, the following theorem holds with respect to a periodic orbit [15]: Theorem 4. Let L, M be sufficiently large natural numbers. If map f creates a stable periodic orbit with period T, then the following equality holds: where p (n) Second, the relationship between the EECD and LE in a chaotic dynamical system is briefly reviewed. Let map f be a (piecewise) C 1 function on R d . For any x = (x 1 , x 2 , . . . , x d ) t , y = (y 1 , y 2 , . . . , y d ) t ∈ A i , let J be an approximate Jacobian matrix, such that Let r k (x, y) (k = 1, 2, . . . , d) be the eigenvalues of J t (x, y) J(x, y).
Now, let us consider a piecewise linear function f for a (piecewise) C 1 function f such that: where Here, In order to consider the piecewise linear function f as an approximate formula of the (piecewise) C 1 function f , the following assumption is introduced.

Assumption 1.
Assume that for sufficiently large natural numbers L and M, the points x in A i are uniformly distributed over A i , such that, for any subset B i of A i where m is the Lebesgue measure on R d and C(x, B i , n) is the number of points included in B i among n points, which are randomly sampled from A i .
Then, the following theorem is proven with respect to an aperiodic orbit.
Theorem 5. Let f be a (piecewise) C 1 function. Then the following equality is valid. and Proof. Let f be a (piecewise) linear function given as Equation (10) for a (piecewise) C 1 function f under Assumption 1. As shown in Section 4, for a large natural number L, From Equation (13), According to Theorem 5, the EECD becomes the sum of all the LEs of a (piecewise) C 1 function f as L, M, and S i,j reach infinity.
At the end of this section, the relationship between the EECD and metric entropy is explained. Let T be a measurable transformation from I to I, preserving a probability measure µ on I, and ξ provides a measurable partition of I. Let h µ (T, ξ) denote the metric entropy for the pair (µ, T) [17]. Subsequently, the EECD D

Computational Algorithm of the EECD
In this section, by reviewing the derivation processes of the improved calculation formula of the EECD in [16], it is shown that all the LEs for an aperiodic orbit can be estimated by calculating the EECD.
To satisfy the relation in Theorem 5, the infinite values of L, M, and S i,j must be used. However, in the actual numerical computations of the EECD, these numbers must be set as finite values. Therefore, an improved calculation formula for the EECD was proposed in [16].
First, the derivation of the improved EECD calculation formula is reviewed for a stable periodic orbit. It is assumed that the map f creates a stable periodic orbit. Then, for any component A i = ∅, there exists a component A j i such that: where |A| is the number of elements of the set A. From Equation (15), Setting then the following is obtained: From Equation (17), it is evident that R(S i,j i ) does not depend on A i : Thus, the following improved calculation formula for the EECD for a stable orbit is obtained: Second, the derivation process of the improved EECD calculation formula was reviewed for an aperiodic orbit. It is assumed that the map f does not create stable periodic orbits.
Let L and M be any sufficiently large natural numbers and let m be the Lebesgue measure on R d . Let f be a piecewise linear function f given as Equation (10) under Assmption 1. Let us assume that f has the unique invariant measure µ.
Then, the following is obtained: Here, the following relationship is used in the second approximation (Equation (19)).
For any set The variance-covariance matrix ∑ X for all points x on X, is expressed as Thus, an improved calculation formula of the EECD for an aperiodic orbit is obtained as: Thus, the improved calculation formula for the EECD is expressed as (21) It is shown that all the LEs for an aperiodic orbit can be estimated for calculating the EECD as follows. Now, it is assumed that all the points x on A i , f (A i ) are almost uniformly distributed over C i , D i : see Equation (12) Consider a random variable ξ that follows a uniform distribution on quently, the standard deviation σ k of ξ is expressed as From Equation (22), the following is obtained: Let (u k ) X be the eigenvector corresponding to the eigenvalue (λ k ) X , and From Equations (23) and (24), C i and D i are expressed as: Using Equations (25) and (26) yields: Furthermore, using Equations (27) and (28) the following is obtained: From Equation (29), Now, let r k (x) (k = 1, 2, . . . , d) be the eigenvalues of D f t (x)D f (x) such that r i (x) ≥ r j (x) (i ≥ j) by r k (x) (k = 1, 2, . . . , d) and let p(x) be the density function of x. Further, let Here the kth item (EECD k ) of the EECD in Equation (30) is defined such that: where D S,2 (A, f , l) (k ≥ l) and k, l ∈ {1, . . . , d}. Further, using Equations (30) and (31), the following is obtained: Thus, the computational of the EECD for the map f is proposed as follows Algorithm 1:

Algorithm 1: Computational algorithm of the EECD
Step 0. Consider a map f and create a partition {A i } in the following way: for any k = 1, . . . , d.
Step 1. Check whether the map f creates a stable periodic orbit.
Step 2. If it does, then compute the EECD such that: Step 3. If not, then compute the EECD k such that: for k = 1, 2, . . . , d, the process proceeds to Step 4.

Application of the Computational Algorithm of the EECD to Chaotic Dynamics
In this section, the computational algorithm of the EECD is applied to typical chaotic maps. The essential basic elements for producing chaotic behavior are operations: "stretching" and "folding," which are explained using a baker's map as an example of a chaotic map.
The baker's map f is defined as: The baker's map f comprises two operations. In the first operation (stretching), the unit square was stretched twice in the x 1 direction and is compressed by half in the x 2 direction. Whereas, during the second operation (folding), the right part sticking out from the unit square was cut vertically and stacked on top of the left part.
Using the unit interval instead of the unit square, the Bernoulli shift map f is expressed as: where x ∈ [0, 1]. Thus, several typical one-dimensional chaotic maps exist with both the stretching and folding operations. In the next section, the computational algorithm of the EECD is applied for typical one and two-dimensional chaotic maps.
In general, the double type in the C language has been used for numerical computations. However, to ensure calculation accuracy, the floating-point type with a 1024-bit mantissa was used in the numerical computations of the eigenvalues of the variancecovariance matrix using GNU Multiprecision Library (GMP).

Application of the Computational Algorithm of the EECD to a One-Dimensional Chaotic Map
Consider a one-dimensional chaotic map f : I → I, where I = [a, b]. Let {A i } be the L-equipartition of I given as Equation (2) The improved formula of the EECD for a one-dimensional aperiodic map f is then expressed as: Here σ 2 1 X is the variance of all points x on X. In the following, M = 100, 000 and L = 1000 are set.

Numerical Computation Results for a Generalized Bernoulli Shift Map
In this section, the computational algorithm of the EECD is applied to a generalized Bernoulli shift map f a as the most straightforward one-dimensional chaotic map. The generalized Bernoulli shift map f a has derivative d f a dx 1 (x 1 ) that depends only on parameter a. The generalized Bernoulli shift map f a is defined as: where x ∈ [0, 1] and 0 ≤ a ≤ 1. Then, the derivative d f a dx (x) of the generalized Bernoulli shift map f a is calculated as constant 2a. Thus, the LE of the generalized Bernoulli shift map f a was log 2a. Now, consider the orbit {x n } associated with the generalized Bernoulli shift map f a such that: x n+1 = f a (x n ), n = 0, 1, . . . , x 0 = 0.3333333. Figure 1 shows the bifurcation diagram of the generalized Bernoulli shift map f a in 0.5 ≤ a ≤ 1.0. With an increase in parameter a, the points continue to spread over the entire unit interval.

Numerical Computation Results for a Logistic Map
In this section, the computational algorithm of the EECD is applied to a logistic map f a as a typical one-dimensional chaotic map. The logistic map f a contains the derivative d f a dx (x) depending on x as well as parameter a.
The logistic map f a is defined as: where x ∈ [0, 1] and 3.5 ≤ a ≤ 4.0. Then, the derivative d f a dx (x) of the logistic map f a was calculated as a(1 − 2x). Thus, d f a dx 1 (x) depends on both parameters a and x. Now, consider the orbit {x n } associated with logistic map f a such that x n+1 = f a (x n ), n = 0, 1, . . . , x 0 = 0.3333333.

Application of the Computational Algorithm of the EECD to a Two-Dimensional Chaotic Map
Consider a two-dimensional chaotic map f : Let {A i } be the L 2 -equipartition of Igiven as Equation (7) at d = 2. Then, the improved formula of the EECD for a two-dimensional aperiodic map f is expressed as: Here, (λ k ) X (k = 1, 2) are the eigenvalues of ∑ X such that: (λ 1 ) X ≥ (λ 2 ) X . The variancecovariance matrix ∑ X for all points x on X, is expressed as: The eigenvalues of ∑ X can be expressed as those numbers λ such that: |λI − ∑ X | = 0. Using Equation (40), the following is obtained: Because (λ 1 ) X ≥ (λ 2 ) X , the following is true: In the following, M = 1,000,000 and L 2 = 1000 2 are set.

Numerical Computation Results for a Generalized Baker's Map
In this section, the computational algorithm of the EECD is applied to a generalized baker's map f a as one of the simplest two-dimensional chaotic maps. The generalized baker's map f a has Jacobian matrices D f a (x) that depend only on parameter a. In addition, its determinant detD f a (x) is also only dependent on parameter a.
The generalized baker's map f a is defined as follows: where x = (x 1 , x 2 ) t ∈ [0, 1] × [0, 1] and 0 ≤ a ≤ 1. Then, the Jacobian matrix of the baker's map f a is calculated as: Thus, D f a (x) depends only on parameter a. The dynamics associated with the generalized baker's map f a are dissipative for 0 ≤ a < 1, because |detD f a (x)| = a 2 [18]. Now, consider the orbit {x n } associated with the generalized baker map f a such that: x n+1 = f a (x n ), n = 0, 1, 2, . . . , Let f m a be the transformation from dv 0 to dv m on R 2 . This directly yields: Thus, Figure 5 shows the typical orbits of the generalized baker's map f a . With an increase in parameter a, points spread from certain lines over to the entire unit square.  Figure 6 shows the numerical computation results for the k-th S,2 (A, f a , k) (k = 1, 2) of the EECD, and total sum (LE 1 + LE 2 ) λ 1 ( f a ) + λ 2 ( f a ) of the LEs and EECD for the generalized baker's map f a . Comparisons of the EECD with LE 1 + LE 2 indicate that the EECD is approximately the same as LE 1 + LE 2 for the generalized baker map f a . The same is true for the EECD k and LE k for k = 1, 2 in 0.5 ≤ a ≤ 0.8. However, as parameter a increases in 0.8 < a ≤ 1.0, the difference between EECD k and LE k for k = 1, 2, increases.  Figure 6. LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD versus a for generalized baker's map f a .
With an increase in parameter a in 0.8 ≤ a ≤ 1.0, the shape of the domain of the points included in A i changes from multiple lines over the entire plane. Considering this feature, increasing the number M of points was considered because the number M of points may not be sufficient to cover the entire region at M = 1,000,000. Figure 7 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD at M = 10,000,000 instead of M = 1,000,000. By increasing the number of points M, the difference between EECD k and LE k for k = 1, 2, was reduced to 0.8 ≤ a ≤ 1.0. For any two-dimensional chaotic map f , the average expansion rate in the stretching of f and the average contraction rate during the folding of f correspond to exp(λ 1 ( f )) and exp(λ 2 ( f )), respectively.

Numerical Computation Results for a Tinkerbell Map
In this section, the computational algorithm of the EECD is applied to a Tinkerbell map f a as a two-dimensional dissipative chaotic map [18]. The Jacobian matrix D f a (x) of the Tinkerbell mapping f a depends on x and parameter a. The same is true for its determinant detD f a (x).
The Tinkerbell map f a is defined as: where x = (x 1 , x 2 ) t ∈ [−1.3, 0.5] × [−1.6, 0.6] for 0.7 ≤ a ≤ 0.9. The Jacobian matrix of the Tinkerbell map f a is calculated as: Thus, D f a (x) depends on x and parameter a. Now, consider the orbit {x n } associated with the Tinkerbell map f a , such that: x n+1 = f a (x n ), n = 0, 1, 2, . . . , x 0 = (0.1, 0.1) t . Figure 8 shows typical orbits of the Tinkerbell map f a . The trajectory of the Tinkerbell map f a draws an unusual attractor at a = 0.9. The origin of the name of the Tinkerbell map f a is based on the shape of a strange attractor that appears similar to the movement of a fairy named Tinker Bell, who appeared in a Disney film.  Figure 9 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and the EECD for the Tinkerbell map f a . Comparisons of the EECD with LE 1 + LE 2 indicate that EECD is approximately the same as LE 1 + LE 2 for the Tinkerbell map f a in 0.7 ≤ a ≤ 0.9, except for several as, where the orbit of f a is periodic. The same is true for the EECD k and LE k for k = 1, 2.  Figure 9. LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD versus a for Tinkerbell map f a .

Numerical Computation Results for an Ikeda Map
In this section, the computational algorithm of the EECD is applied to an Ikeda map f a as a two-dimensional dissipative chaotic map [18]. The Ikeda map f a contains the Jacobian matrix D f a (x) that depends on x and parameter a. However, its determinant detD f a (x) depends only on parameter a.
The modified Ikeda map is expressed as a complex map in [19,20]: The Ikeda map f a is defined as a real two-dimensional example of Equation (50) as: where The Jacobian matrix of the Ikeda map f a is calculated as: where Thus, D f a (x) depends on x and parameter a. Further, the dynamics associated with the Ikeda map f a are dissipative for 0 ≤ a < 1, because |detD f a (x)| = a 2 . Now, consider the orbit {x n } associated with the Ikeda map f a such that: Let f m a be the transformation from dv 0 to dv m on R 2 . By using the chain rule and detD f a (x) = a 2 for the Ikeda map f a , the following equation is obtained: Thus, (54) Figure 10 shows typical orbits of the Ikeda map f a . With an increase in parameter a, the attractor generated by the Ikeda map f a grows in size. Moreover, regarding the f a plots, the Ikeda map might be conjugate to a Hénon map [21].  Figure 11 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and the EECD for the Ikeda map f a . Comparisons of the EECD with the LE 1 + LE 2 indicate that the EECD is approximately the same as LE 1 + LE 2 for the Ikeda map f a , except for several values of a, where the orbit of f a is periodic. However, there is a small difference between EECD k and LE k for k = 1, 2, in 0.7 ≤ a ≤ 0.9. These differences cannot necessarily decrease, even if the number M of points and the number L 2 of all the components of the equipartition of I are increased.  Figure 11. LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD versus a for Ikeda map f a . This problem may be related to the shape of the trajectory generated by the Ikeda map f a . The shape of the minimum region, including all the points in A i of I for the Ikeda map f a , is a partial spiral. However, the region above is regarded as a rectangle C i (Equation (25)), as evident in the computational algorithm of the EECD. This region above the EECD may cause the difference between EECD k and LE k for k = 1, 2.

Numerical Computation Results for a Hénon Map
In this section, the computational algorithm of the EECD is applied to a Hénon map f a,b as a two-dimensional dissipative chaotic map. The Hénon map f a,b has the Jacobian matrix D f a,b (x), which is dependent on x and parameter b. However, its determinant detD f a,b (x) depends only on parameter b.
The Hénon map f a,b is defined as: In the following section, f 1.4,b = f b is rewritten. The Jacobian matrix of the Hénon map f a,b is calculated as follows: Thus, D f a,b (x) depends on x 1 and parameter b. Further, dynamics associated with the Hénon map f a,b are dissipative at 0 ≤ b < 1, because |detD f a,b (x)| = b. Now, consider the orbit {x n } associated with the Hénon map f b such that: x n+1 = f b (x n ), n = 0, 1, 2, . . . , x 0 = (0.1, 0.1) t .
Let f m b be the transformation from dv 0 to dv m on R 2 . By using the chain rule and detD f b (x) = −b for the Hénon map f b , the following is obtained: Thus, (58) Figure 12 shows typical orbits of the Hénon map f b . The trajectory of the Hénon attractor exhibits a fractal structure such that upon expanding the strip region, innumerable parallel curves reappear in the strip.  Figure 13 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD for the Hénon map f b . Comparisons of the EECD 1 and LE 1 indicate that EECD 1 is approximately the same as LE 1 for the Hénon map f b , except for several bs, where the orbit of the Hénon map f b is periodic. The same is true for the EECD 2 and LE 2 , as well as for the EECD and LE 1 + LE 2 in 0.1 ≤ b ≤ 0.3. However, there was a remarkable difference between EECD 2 and LE 2 in 0 ≤ b < 0.1, the EECD attained noticeably different values from LE 1 + LE 2 for 0 ≤ b < 0.1. The orbit of the map f b is not periodic at 0.0 ≤ b < 0.1.  Figure 13. LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD versus b for Hėnon map f b . Now, consider another expression for the smaller eigenvalue (λ 2 ) X among the eigenvalues of the variance-covariance matrix ∑ X such that: where ρ X is the autocorrelation function for all points x on component X. From Equation (59), if the absolute value of ρ X is equal to 1, then The ratio of (λ 2 ) f (A i ) to (λ 2 ) A i is included in the formula: EECD 2 (Equation (39)). Thus, if the absolute value of ρ A i is almost equal to 1, then accurately computing EECD 2 is challenging because (λ 2 ) f (A i ) must be divided by (λ 2 ) A i , close to 0. Let E(|ρ|) be the average of |ρ A i | , such that: Figure 14 shows the numerical computation results for |EECD 2 − LE 2 |, and E(|ρ|) for the Hénon map f b . E(|ρ|) is very close to 1 in 0 ≤ b < 0.1. Therefore, it can be concluded that the remarkable difference between the EECD 2 and LE 2 is caused by |ρ A i | . = 1, for any A i .

Numerical Computation Results for a Standard Map
In this section, the computational algorithm of the EECD is applied to a standard map f K as a two-dimensional conservative chaotic map. The standard map f K has the Jacobian matrix D f K (y), which is dependent on y and parameter K. However, its determinant detD f K (x) remains constant at 1.
The Jacobian matrix of the standard map f K is calculated as follows: Thus, D f K (y) depends on θ and the parameter K. Moreover, the dynamics associated with standard map f K are conservative because |detD f K (y)| = 1. Now, consider orbit {y n } associated with the standard map f K such that: y n+1 = f K (y n ), n = 0, 1, 2, . . . , y 0 = (1.5, 2.0) t .
Let f m K be the transformation from dv 0 to dv m in R 2 . By using the chain rule and detD f K (x) = 1 for the standard map f K , the following is obtained: Thus, As mentioned in [16], the standard map f k is reversible [22]. Thus, LEs λ 1 ( f K ) and λ 2 ( f K ) of f K satisfy the condition such that λ 1 ( f K ) = −λ 2 ( f K ) > 0 according to Theorem 3.2 in [23]. Figure 15 shows typical orbits of the standard map f K with the initial point (θ 0 , p 0 ) = (1.5, 2.0). The standard map is composed of the Poincaré's surface in the kicked rotator section, and f K has a linear structure at approximately K = 0. However, with the increase in K, the map generates a non-linear structure with chaos under appropriate initial conditions.  Figure 16 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD for the standard map f K . Comparisons of EECD 1 and LE 1 indicate that EECD 1 appears larger than the LE 1 in 0 ≤ K ≤ 50 for a certain small value.  Figure 16. LE k , EECD k (k = 1, 2), LE 1 + LE 2 and EECD versus K for standard map f K . Now, consider increasing the number L 2 of all components of the equipartition of I. In principle, downsizing A i by increasing L, is necessary to compute EECD 1 more precisely for any K, because the Jacobian matrix D f K (y) of the standard map f K depends on y as well as K. Figure 17 shows the numerical computation results for LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD for the standard map f K at L = 2000 instead of L = 1000. By increasing L, it is possible to reduce the difference between the EECD 1 and LE 1 such that the EECD may approach LE 1 + LE 2 .  Figure 17. LE k , EECD k (k = 1, 2), LE 1 + LE 2 , and EECD versus K for standard map f K (L = 2000).

Conclusions
In this study, by reviewing the derivation process of the improved calculation formula of the EECD, it is shown that all the LEs for an aperiodic orbit could be estimated when calculating the EECD; furthermore, a computational algorithm for the EECD is proposed. This computational algorithm is applied to typical one and two-dimensional chaotic maps.
First, the computational algorithm of the EECD is applied to typical one-dimensional chaotic maps, such as the generalized Bernoulli shift and logistic maps. The numerical computation results for these one-dimensional chaotic maps indicate that the EECD is approximately the same as the LE in all chaotic cases.
Thereafter, the computational algorithm of the EECD is applied to two-dimensional typical chaotic maps, such as the generalized baker's, Tinkerbell, Ikeda, Hénon, and standard maps. The numerical computation results for these typical two-dimensional chaotic maps show that the EECD is approximately the same as the total sum of the LEs in most chaotic cases; however, the kth item of the EECD is also approximately the kth LE for k = 1, 2, which can be slightly larger or smaller. Therefore, it can be concluded that the EECD may be an alternative to the LE for both one and two-dimensional chaotic dynamics. In future studies, attempts will be made to characterize higher-dimensional chaotic dynamics and non-linear real-time series using the EECD.