RUS  ENG
Full version
JOURNALS // Modelirovanie i Analiz Informatsionnykh Sistem // Archive

Model. Anal. Inform. Sist., 2020 Volume 27, Number 3, Pages 344–355 (Mi mais720)

Computer system organization

Features of the algorithmic implementation of difference analogues of the logistic equation with delay

S. D. Glyzin, S. A. Kaschenko, A. O. Tolbey

Centre of Integrable Systems, P. G. Demidov Yaroslavl State University, Sovetskaya str., 14, Yaroslavl, 150003, Russia

Abstract: The logistic equation with delay or Hutchinson's equation is one of the fundamental equations of population dynamics and is widely used in problems of mathematical ecology. We consider a family of mappings built for this equation based on central separated differences. Such difference schemes are usually used in the numerical simulation of this problem. The presented mappings themselves can serve as models of population dynamics; therefore, their study is of considerable interest. We compare the properties of the trajectories of these mappings and the original equation with delay. It is shown that the behavior of the solutions of the mappings constructed on the basis of the central separated differences does not preserve, even with a sufficiently small value of the time step, the basic dynamic properties of the logistic equation with delay. In particular, this map does not have a stable invariant curve bifurcating under the oscillatory loss of stability of a nonzero equilibrium state. This curve corresponds in such mappings to the stable limit cycle of the original continuous equation. Thus, it is shown that such a difference scheme cannot be used for numerical modeling of the logistic equation with delay.

Keywords: logistic equation with delay, mapping, bifurcation.

UDC: 517.962.24

MSC: 39A11, 34K18

Received: 11.08.2020
Revised: 07.09.2020
Accepted: 09.09.2020

DOI: 10.18255/1818-1015-2020-3-344-355



© Steklov Math. Inst. of RAS, 2025