DC Field | Value | Language |
---|---|---|
dc.contributor.author | Berenhaut, Kenneth | en |
dc.contributor.author | Foley, John | en |
dc.contributor.author | Stević, Stevo | en |
dc.date.accessioned | 2020-05-01T20:13:44Z | - |
dc.date.available | 2020-05-01T20:13:44Z | - |
dc.date.issued | 2006-09-01 | en |
dc.identifier.issn | 0893-9659 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1674 | - |
dc.description.abstract | This note provides new quantitative bounds for the recursive equation yn + 1 = A + frac(yn, yn - k), n = 0, 1, ..., where y- k, y- k + 1, ..., y- 1, y0, A ∈ (0, ∞) and 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) for which global asymptotic stability was proven in [R.M. Abu-Saris, R. DeVault, Global stability of yn + 1 = A + frac(yn, yn - k), Appl. Math. Lett. 16 (2) (2003) 173-178]. | en |
dc.publisher | Elsevier | - |
dc.relation.ispartof | Applied Mathematics Letters | en |
dc.subject | Difference equation | Explicit bounds | Exponential convergence | Stability | en |
dc.title | Quantitative bounds for the recursive sequence yn + 1 = A + frac(yn, yn - k) | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.aml.2005.09.009 | en |
dc.identifier.scopus | 2-s2.0-33746918702 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 983 | en |
dc.relation.lastpage | 989 | en |
dc.relation.issue | 9 | en |
dc.relation.volume | 19 | en |
dc.description.rank | M23 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.orcid | 0000-0002-7202-9764 | - |
SCOPUSTM
Citations
23
checked on Nov 24, 2024
Page view(s)
20
checked on Nov 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.