Sign in
Back
Boundedness character of the recursive sequence x(n) = alpha + Pi(k)(j=1) x(n-j)(aj)
Journal article   Open access  Peer reviewed

Boundedness character of the recursive sequence x(n) = alpha + Pi(k)(j=1) x(n-j)(aj)

Stevo Stevic, Mohammed A. Alghamdi and Abdullah Alotaibi
Applied mathematics letters, Vol.50, pp.83-90
01/12/2015
DOI: https://doi.org/10.1016/j.aml.2015.06.006

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
The boundedness character of positive solutions of the difference equation in the title, where alpha > 0 and a(j) is an element of R, j = (1, k) over bar, a(k) not equal 0, is studied here in terms of the roots of the following associated polynomial P-k(t) = t(k) - a(1)t(k-1) - a(2)t(k-2) - ... - a(k). (C) 2015 Elsevier Ltd. All rights reserved.
url
https://doi.org/10.1016/j.aml.2015.06.006View
Published (Version of record) Open

Metrics

1 Record Views

Details