In our first example we present a simple recursive sequence graphically, with the aim to argue what the ultimate value (the limit) should be.

We present a geometric (graphical) method, as shown below in Figure 1, for students to develop a better understanding of the limit of the recursive sequence.

Global attractivity in a rational

recursive sequence.

Li, Global attractivity in the recursive sequence [x.

In this paper, our aim is to study the asymptotic stability and global attractivity of the rational recursive sequences

Elabbasy et al [5] investigated the global stability, periodicity character and gave the solution of a special case of the recursive sequence

Stability of solutions for the recursive sequence [x.

In this paper we give some criteria to decide whether we can bound the tail of a recursive sequence as in (1) by a polynomial term.

Polynomial bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees, or in recursive algorithms.

Abstract In this paper we investigate the boundedness, the periodic character and the global attractivity of the recursive sequence

Our goal in this paper is to investigate the boundedness, periodic character and global attractivity of all positive solutions of the rational recursive sequence

Considering in turn discrete-time modeling, continuous-time modeling, and spatial modeling, they cover stochastic

recursive sequences, Markov chains, stationary queues, the M/GI/1 queue, the Poisson process, the Markov process, systems with delay, loss systems, and spatial point processes.