2014
DOI: 10.1007/s11071-014-1546-3
|View full text |Cite
|
Sign up to set email alerts
|

A pseudo-stable structure in a completely invertible bouncer system

Abstract: It is shown that a pseudo-stable structure of non-asymptotic convergence may exist in a completely invertible bouncing ball model. Visualization of the pattern of H-ranks helps to identify this structure. It appears that this structure is similar to the stable manifold of non-invertible nonlinear maps which govern the non-asymptotic convergence to unstable periodic orbits. But this convergence to the unstable repeller of the bouncing ball problem is only temporary since non-asymptotic convergence cannot exist … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 31 publications
0
3
0
Order By: Relevance
“…H-ranks provide a straightforward but effective way to measure the algebraic complexity of a sequence. This measure has been successfully employed to analyze complexity in a number of different maps such as the invertible logistic map [30], the bouncer map [31], the Gauss map [32], as well as the fractional logistic map [33].…”
Section: H-ranks and Algebraic Complexitymentioning
confidence: 99%
“…H-ranks provide a straightforward but effective way to measure the algebraic complexity of a sequence. This measure has been successfully employed to analyze complexity in a number of different maps such as the invertible logistic map [30], the bouncer map [31], the Gauss map [32], as well as the fractional logistic map [33].…”
Section: H-ranks and Algebraic Complexitymentioning
confidence: 99%
“…Thus, for real-world applications it is recommended to choose ε > 0 and investigate the pseudo-order. A number of algorithms that use the concept of 1-LRS have successfully applied this approach [15][16][17]. It is clear that an alternative approach is also required for the computation of 2-LRS orders.…”
Section: Pseudo-order Of a 1-sequencementioning
confidence: 99%
“…The shorter average period results into a smaller LRS pseudo-order. 2-LRS pseudo-order for the image of bricks (without noise) is equal to (22,17) corresponding to ( 1 22 , 1 17 ) in Fig. 2 at λ = 1.…”
Section: Lrs Pseudo Order and Shanon Entropymentioning
confidence: 99%