Results 211 to 220 of about 20,624 (255)
Some of the next articles are maybe not open access.
ON THE LOGIC OF DISCRETE SYSTEMS DYNAMICS
Kybernetes, 1980This paper deals with the area of problems concerning the discrete systems dynamics and is also related to Wonham's principle of internal model. The authors consider the case of systems with an invariant subsystem and use the improved modelling tool of the theory of topoi.
Negoita, C. V., Roman, R.
openaire +1 more source
CHAOTIFICATION OF NONAUTONOMOUS DISCRETE DYNAMICAL SYSTEMS
International Journal of Bifurcation and Chaos, 2011This paper focuses on the chaotification of nonautonomous discrete dynamical systems in finite-dimensional and general Banach spaces by feedback control techniques. Several chaotification schemes with general controllers and sawtooth function are established, respectively, where the controllers are time-invariant.
Qiuling Huang, Yuming Shi, Lijuan Zhang
openaire +1 more source
The discrete dynamics of developmental systems
2009 IEEE Congress on Evolutionary Computation, 2009Operation of developmental systems is in many ways similar to that of discrete dynamic networks. Applying such network analysis to developmental system enables investigation of the dynamic properties of development at different levels. In this work the basins of attraction of a developmental system is explored in order to gain information about the ...
openaire +1 more source
Invertibility of Discrete-Event Dynamic Systems
Mathematics of Control, Signals, and Systems, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cüneyt M. Özveren, Alan S. Willsky
openaire +2 more sources
MEMORY EFFECTS IN DISCRETE DYNAMICAL SYSTEMS
International Journal of Bifurcation and Chaos, 1992Let fµ(s)=µs(1−s) be the family of logistic maps with parameter µ, 1≤µ≤4. We present a study of the second-order difference equation xn+1=fµ([1−∈]xn+∈xn−1), 0≤∈≤1, which reduces to the well-known logistic equation as ∈=0.
INVERNIZZI, SERGIO, Aicardi F.
openaire +3 more sources
Discrete Linear Dynamical Systems
2013The theory of dynamical systems is concerned with describing and studying the evolution of systems over time, where a ‘system’ is represented as a vector of variables, and there is a fixed rule governing how the system evolves. Dynamical systems originate in the development of Newtonian mechanics, and have widespread applications in many areas of ...
openaire +1 more source
2000
In this chapter we will study sequences defined by recurrence relations of the form x n+1 = f (x n ). This is a topic which has an interesting history and which has seen rapid development in recent years. Its study requires little in the way of mathematical preparation, and there are even interesting applications.
George C. D, Jean Michel F, Henri L
openaire +1 more source
In this chapter we will study sequences defined by recurrence relations of the form x n+1 = f (x n ). This is a topic which has an interesting history and which has seen rapid development in recent years. Its study requires little in the way of mathematical preparation, and there are even interesting applications.
George C. D, Jean Michel F, Henri L
openaire +1 more source
2013
This short chapter presents the mathematics of matrix population models. The first section examines discrete linear systems using scalar notation and computer simulations. The simulations lead to the discovery of an asymptotic growth rate and stage structure, which we can determine by ad hoc methods for systems of only two or three components.
Morris W. Hirsch +2 more
openaire +2 more sources
This short chapter presents the mathematics of matrix population models. The first section examines discrete linear systems using scalar notation and computer simulations. The simulations lead to the discovery of an asymptotic growth rate and stage structure, which we can determine by ad hoc methods for systems of only two or three components.
Morris W. Hirsch +2 more
openaire +2 more sources
Computability and Discrete Dynamical Systems
2005Church's and Turing's theses dogmatically assert that an informal notion of computability is captured by a particular mathematical concept. I present an analysis of computability that leads to precise concepts, but dispenses with theses.
openaire +1 more source