Results 1 to 10 of about 277,197 (278)
Identification and quantification of irreversibility in stochastic systems.
Phys Chem Chem PhysGhosal A, Bisker G.
europepmc +1 more source
Some of the next articles are maybe not open access.
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
1998
A discrete dynamical system is a system which is discrete in time so we observe its dynamics not continuously but at the given moments of time like in the case of Poincare maps introduced in the previous chapter. The dynamics of discrete dynamical systems is usually simple enough to be explained in details.
Yushu Chen, Andrew Y. T. Leung
openaire +2 more sources
A discrete dynamical system is a system which is discrete in time so we observe its dynamics not continuously but at the given moments of time like in the case of Poincare maps introduced in the previous chapter. The dynamics of discrete dynamical systems is usually simple enough to be explained in details.
Yushu Chen, Andrew Y. T. Leung
openaire +2 more sources
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
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
2009
Suppose we wish to describe some physical system. The dynamical systems approach considers the space X of all possible states of the system—think of a point x in X as representing physical data. We will assume that X is a subset of some normed vector space, often \({\mathbb{R}}\).
Kenneth R. Davidson, Allan P. Donsig
openaire +1 more source
Suppose we wish to describe some physical system. The dynamical systems approach considers the space X of all possible states of the system—think of a point x in X as representing physical data. We will assume that X is a subset of some normed vector space, often \({\mathbb{R}}\).
Kenneth R. Davidson, Allan P. Donsig
openaire +1 more source
2015
So far we have discussed the dynamics of continuous systems. An evolutionary process may also be expressed mathematically as discrete steps in time. Discrete systems are described by maps (difference equations). The composition of map generates the dynamics or flow of a discrete system.
openaire +2 more sources
So far we have discussed the dynamics of continuous systems. An evolutionary process may also be expressed mathematically as discrete steps in time. Discrete systems are described by maps (difference equations). The composition of map generates the dynamics or flow of a discrete system.
openaire +2 more sources
2016
This chapter introduces discrete dynamic systems by first looking at models for dynamic and static aspects of systems, before covering continuous and discrete systems.
Matthias Kunze, Mathias Weske
openaire +1 more source
This chapter introduces discrete dynamic systems by first looking at models for dynamic and static aspects of systems, before covering continuous and discrete systems.
Matthias Kunze, Mathias Weske
openaire +1 more source