×

On the recursive sequence \(x_{n+1}=\alpha + x_{n-1}/x_n\). (English) Zbl 1105.39008

A nonlinear difference equation having a ratio of two successive past values on the right hand side and with a negative coefficient and negative initial conditions is considered. Stability and periodic characteristics of the solutions are discussed.

MSC:

39A11 Stability of difference equations (MSC2000)
39A20 Multiplicative and other generalized difference equations
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Amleh, A.M.; Grove, E.A.; Ladas, G., On the recursive sequence \(x_{n + 1} = \alpha +(x_{n - 1} / x_n)\), J. math. anal. appl., 233, 790-798, (1999) · Zbl 0962.39004
[2] Camouzis, E.; DeVault, R.; Ladas, G., On the recursive sequence \(x_{n + 1} = p +(x_{n - 1} / x_n)\), J. difference equations appl., 7, 477-482, (2001) · Zbl 1081.39503
[3] E. Camouzis, R. DeVault, Asymptotic behavior of solutions of \(x_{n + 1} = p + \frac{x_{n - 1}}{x_n}\), in press · Zbl 1065.39007
[4] E. Camouzis, R. DeVault, The forbidden set of \(x_{n + 1} = p + \frac{x_{n - 1}}{x_n}\), in press · Zbl 1049.39024
[5] Kocic, V.L.; Ladas, G., Global behavior of nonlinear difference equations of higher order with applications, (1993), Kluwer Academic Dordrecht · Zbl 0787.39001
[6] Kulenovic, M.R.S.; Ladas, G., Dynamics of second order rational difference equations, (2002), Chapman & Hall/CRC · Zbl 0981.39011
[7] Kelley, W.G.; Peterson, A.C., Difference equations, (1991), Academic Press New York
[8] Elaydi, S.N., An introduction to difference equations, (1996), Springer-Verlag New York · Zbl 0840.39002
[9] A.M. Youssef, A.E. Hamza, A.M. Ahmed, H.M. El-Owaidy, On the recursive sequence \(x_{n + 1} = (a + b x_{n - 1}) /(A + B x_n^k)\), submitted for publication
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.