Global attractivity for discrete models of nonautonomous logistic equations (Q2458711): Difference between revisions

The following discrete model of a nonautonomous logistic equation \[ N(n+1) = N(n) \text{exp }\left[c(n) - \sum_{j=0}^m b_j(n)N(n-j)\right] \quad (n \geq 0) \] \[ N(0) = N_0 > 0, \quad N(-j) = N_{-j} \geq 0 \quad (1 \leq j \leq m) \] is considered. In this model, the \(c(n)\) and \(b_j(n)\) are bouded, \(c(n) > 0, b_0(n) > 0, b_j(n) \geq 0\) \((1 \leq j \leq m).\) Assuming that there exists at least one known positive solution \((N^*(n))_{n \geq 1}\) of the system, a monotone iterative method is used to show that, for any other solution \((N(n))_{n \geq 1}\), one has \(\lim_{n \to \infty}(N(n) - N^*(n)) = 0.\) The result extends earlier work of \textit{K. Uesugi, Y. Muroya}, and \textit{E. Ishiwata} [J. Math. Anal. Appl. 294, No.~2, 560--580 (2004; Zbl 1050.34116)].