Clocking divergence of iterative maps of matrices

• Published in: Communications in nonlinear science & numerical simulation Vol. 95; p. 105589
• Main Authors: Smidtaite, Rasa, Navickas, Zenonas, Ragulskis, Minvydas
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.04.2021; Elsevier Science Ltd
• Subjects: Chaos; Divergence; Eigenvalues; Initial conditions; Iterative map; Iterative methods; Liapunov exponents; Nilpotent matrix; Nonlinear dynamics; Nilpotent matrix; Chaos; Iterative map; Divergence
• ISSN: 1007-5704; 1878-7274
• DOI: 10.1016/j.cnsns.2020.105589

•Iterative maps are generalized by replacing the scalar variable by a square matrix.•Packing codes and divergence codes are introduced to characterize the divergence.•Analytical and computational simulations are used to evaluate the divergence rate. A theoretical framework describing the dynamics of nonlinear iterative maps of matrices is derived in this paper. It is shown that an iterative map of matrices does exhibit the effect of exponential divergence if the following two conditions are satisfied simultaneously. The first condition is that at least one of the multiplicity indexes of the eigenvalues of the matrix of initial conditions must be greater than one. The second condition is that the Lyapunov exponent of the corresponding scalar iterative map is greater than zero. The concept of packing and divergence codes is introduced to characterize the rate of the divergence of nonlinear iterative maps of matrices. Theoretical derivations and computational simulations yield counterintuitive results that the divergence rate of the logistic map of matrices is the same as of the circle map of matrices – even though the higher-order derivatives of the circle mapping function do not vanish.