2021
DOI: 10.1016/j.cnsns.2020.105589
|View full text |Cite
|
Sign up to set email alerts
|

Clocking divergence of iterative maps of matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(17 citation statements)
references
References 9 publications
0
17
0
Order By: Relevance
“…It can be noted that a scalar variable in Eq. 1 can be also replaced by the nth order square matrix [4]. However, it appears that the dynamics of n-dimensional discrete chaotic maps becomes much more complicated compared to the dynamics of 2-dimensional discrete chaotic maps [4].…”
Section: N-dimensional Discrete Chaotic Mapsmentioning
confidence: 99%
See 4 more Smart Citations
“…It can be noted that a scalar variable in Eq. 1 can be also replaced by the nth order square matrix [4]. However, it appears that the dynamics of n-dimensional discrete chaotic maps becomes much more complicated compared to the dynamics of 2-dimensional discrete chaotic maps [4].…”
Section: N-dimensional Discrete Chaotic Mapsmentioning
confidence: 99%
“…A multidimensional discrete chaotic map may become explosive if at least two eigenvalues of the matrix of initial conditions do coincide (even though all eigenvalues of the matrix are located in the convergence domain of the corresponding scalar discrete map). The multiplicity indexes of eigenvalues are directly related to the packing codes due to the classical bin packing problem [4]. Therefore, the study of packing codes becomes a topic of primary importance in the analysis of the divergence of multidimensional discrete chaotic maps [4].…”
Section: Packing and Divergence Codesmentioning
confidence: 99%
See 3 more Smart Citations