2008
DOI: 10.1007/s11253-008-0043-6
|View full text |Cite
|
Sign up to set email alerts
|

On sharp conditions for the global stability of a difference equation satisfying the Yorke condition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The following theorem is a corollary of Lemma 3.2 and the results of Nenya and Nenya et al [25,26,27] for more general, non-autonomous difference equations with Yorke and generalized Yorke condition.…”
mentioning
confidence: 66%
See 1 more Smart Citation
“…The following theorem is a corollary of Lemma 3.2 and the results of Nenya and Nenya et al [25,26,27] for more general, non-autonomous difference equations with Yorke and generalized Yorke condition.…”
mentioning
confidence: 66%
“…Besides of that from a mathematical point of view, global stability of a unique equilibrium point is always a fundamental topic, in neural networks it is also important in solving optimization and signal processing problems. There is a vast number of papers giving sufficient conditions for global stability of more complicated models of neural networks (see in [4,10,21,34,35] and the references therein) and of more general difference equations (see in [13,25,26,27,19]), without attempting to be comprehensive; but to the best of our knowledge, none of those are claimed to be necessary.…”
Section: Introduction Consider the Difference Equation Given Bymentioning
confidence: 99%
“…Upper restrictions like q ≤ q k on q are intrinsic to (1) and cannot be omitted for k > 1 since (4) does not guarantee even the local stability for q close to 1. However, as we show below, the values of q k are not optimal.Indeed, it is natural to conjecture (see [2], [3], [6]) that interval (0, q k ] in Theorem 2 can be improved till (0, q * k ], where q * k is the unique positive root of the equation (q * k ) k+1 (q * k + ... + (q * k ) k ) = 1. For comparison, let us show values of q * k : q * 1 = 1, q * 2 = 0.855, q * 3 = 0.831, q * 4 = 0.828, q * 5 = 0.833, q * 6 = 0.839, q * 7 = 0.846, q * 8 = 0.853, q * 9 = 0.859, q * 10 = 0.865, q * 100 = 0.967, q *…”
mentioning
confidence: 99%