Title of article
Quantitative bounds for the recursive sequence View the MathML source
Author/Authors
Kenneth S. Berenhaut، نويسنده , , John D. Foley، نويسنده , , Stevo Stevi?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
7
From page
983
To page
989
Abstract
This note provides new quantitative bounds for the recursive equation
View the MathML sourceyn+1=A+ynyn−k,n=0,1,…,
Turn MathJax on
where y−k,y−k+1,…,y−1,y0,A∈(0,∞)y−k,y−k+1,…,y−1,y0,A∈(0,∞) and k∈{2,3,4,…}k∈{2,3,4,…}. Issues regarding exponential convergence of solutions are also considered. In particular, it is shown that exponential convergence holds for all (A,k)(A,k) for which global asymptotic stability was proven in [R.M. Abu-Saris, R. DeVault, Global stability of View the MathML sourceyn+1=A+ynyn−k, Appl. Math. Lett. 16 (2) (2003) 173–178].
Keywords
Stability , exponential convergence , Explicit bounds , Difference equation
Journal title
Applied Mathematics Letters
Serial Year
2006
Journal title
Applied Mathematics Letters
Record number
898225
Link To Document