On the rational recursive sequence xn+1 = α0xn + α1xn−l + α2xn−k ⁄ β0xn + β1xn−l + β2xn−k

Title:

On the rational recursive sequence xn+1 = α0xn + α1xn−l + α2xn−k ⁄ β0xn + β1xn−l + β2xn−k

Creator:

Zayed, E. M. E. and El-Moneam, M. A.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:0adf9de4-17b4-46c6-bced-7f8b05677dfa
uuid:0adf9de4-17b4-46c6-bced-7f8b05677dfa
doi:10.21136/MB.2010.140707

Subject:

difference equation, boundedness, period two solution, convergence, and global stability

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The main objective of this paper is to study the boundedness character, the periodicity character, the convergence and the global stability oThe main objective of this paper is to study the boundedness character, the periodicity character, the convergence and the global stability of positive solutions of the difference equation xn+1 = α0xn + α1xn−l + α2xn−k ⁄ β0xn + β1xn−l + β2xn−k , n = 0, 1, 2, . . . where the coefficients αi , βi ∈ (0,∞) for i = 0, 1, 2, and l, k are positive integers. The initial conditions x−k, . . . , x−l , . . . , x−1, x0 are arbitrary positive real numbers such that l < k. Some numerical experiments are presented.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

319-336

Source:

Mathematica bohemica | 2010 Volume:135 | Number:3

Harvested from:

CDK

Metadata only:

false