Dynamical Systems 3 Nonlinear systems Ing Jaroslav Jra

  • Slides: 37
Download presentation
Dynamical Systems 3 Nonlinear systems Ing. Jaroslav Jíra, CSc.

Dynamical Systems 3 Nonlinear systems Ing. Jaroslav Jíra, CSc.

Stability of Nonlinear Systems First Lyapunov method – linearization To examine stability of nonlinear

Stability of Nonlinear Systems First Lyapunov method – linearization To examine stability of nonlinear systems we have to use more complicated tools than for linear ones. The first step, which frequently works, is the method of linearization, sometimes called first Lyapunov method. The principle is expanding of the righthand side function in the equation of motion around the fixed point into the Taylor series with neglecting of higher order members. Taylor series Neglecting the higher order terms we obtain Being at an equilibrium point, we know, that f(x~)= dx~/dt = 0 , so

Since the derivative of a constant is zero, then and consequently The original system

Since the derivative of a constant is zero, then and consequently The original system Linearized system

Now we have to distinguish between the Jacobian matrix of the original system and

Now we have to distinguish between the Jacobian matrix of the original system and the matrix for the linearized system at the specific fixed point, let’s say Df and Df(x~). While the Jacobian matrix of the original nonlinear system Df contains variables and constants, the Jacobian matrix of the linearized system at the fixed point Df(x~) contains just constants.

Example of the system linearization The system is defined by the set of equations

Example of the system linearization The system is defined by the set of equations To find fixed points of the system, we have to solve equations We find two fixed points: Then we can do necessary calculations for the Jacobian matrix

Before examining stability of particular fixed points we can make a preview of the

Before examining stability of particular fixed points we can make a preview of the dynamical flow by the Mathematica program:

More detailed previews of areas around fixed points The area around the x. A~

More detailed previews of areas around fixed points The area around the x. A~ looks like a saddle point, i. e. the fixed point should be unstable The area around the x. B~ looks like a spiral sink, i. e. the fixed point should be stable

Jacobian matrix of the original system is: For the first fixed point we have

Jacobian matrix of the original system is: For the first fixed point we have Eigenvalues of this matrix are approx. λ 1=1. 9016 and λ 2= -1. 4874 Conclusion: near x. A~ the system behaves like a linear system with one positive and one negative eigenvalue, i. e. the system is unstable here. For the second fixed point we have Eigenvalues of this matrix are approx. λ 12= -1. 2071 +/- 1. 171 i Conclusion: near x. B~ the system behaves like a linear system with complex eigenvalues with negative real part, i. e. the system is stable here.

What can we do if linearization method cannot decide? Example 2 – unusually damped

What can we do if linearization method cannot decide? Example 2 – unusually damped harmonic oscillator We have a harmonic oscillator, where the mass m moves in very viscous medium, where the damping force is proportional to the cube of the velocity. Set of differential equations describing the system After setting vector variable y we can write Fixed point result from equations There is only one fixed point

The Jacobian matrix for linearized system at the fixed point Eigenvalues for this system

The Jacobian matrix for linearized system at the fixed point Eigenvalues for this system are λ 12= +/- i, so they have zero real part and the method of linearization cannot decide about the stability. The graph shows phase diagram for μ=0. 25, x 0=2 and v 0=0. Even from the graph it is not clear if the trajectory will converge to (0, 0) point or if it will remain at certain non-zero distance from it. We will have to use another tool – Lyapunov functions

Second Lyapunov method – Lyapunov functions If we look on the damped harmonic oscillator

Second Lyapunov method – Lyapunov functions If we look on the damped harmonic oscillator from the point of view of energy, there is clear, that the system is still losing energy and sooner or later it must stop at the equilibrium point (0, 0). The principle of the second Lyapunov method is to find a function V(x) that represents energy or generalized energy and satisfies the following conditions. 1. the function V(x) is continuously differentiable around the fixed point 2. positive definite V 3. negative definite d. V/dt Additional condition to 3: at any state where condition is considered satisfied if the system immediately moves to a state, where If we succeed in finding such function, then the fixed point x~ is stable. the 3 rd

Application of the second Lyapunov method on our Example 2 The total energy of

Application of the second Lyapunov method on our Example 2 The total energy of a harmonic oscillator We simplify by taking m=1 and k=1 This function is continuously differentiable around zero and is positive for all states except for the fixed point (0, 0), i. e. the first and secondition are satisfied. This means that we have a Lyapunov candidate function. The formula for the derivative of E

The final result for the time derivation is We can notice that d. E/dt

The final result for the time derivation is We can notice that d. E/dt is always negative except for the v=0, where d. E/dt=0. The velocity is zero in three situations: 1. At the fixed point, which is in conformity with the third condition 2. At the instant, where the spring is maximally compressed 3. At the instant, where the spring is maximally extended Situations 2 and 3 satisfy the additional condition, because the system immediately moves from here to the state where d. E/dt<0. Also the third condition is satisfied. Conclusion: our Lyapunov candidate function satisfies all conditions for the Lyapunov function, so examined fixed point (0, 0) is stable.

How to estimate Lyapunov candidate functions? If we examine a physical system, we should

How to estimate Lyapunov candidate functions? If we examine a physical system, we should calculate the energy. If the state vector is x and the fixed point is 0, we could try If the fixed point is not at the origin of coordinate system, we have to modify If we are not successful, then we can try If it still does not work, we can use a general quadratic form

Classification of Stability of Nonlinear Systems 1. Lyapunov stability: fixed point x~ is a

Classification of Stability of Nonlinear Systems 1. Lyapunov stability: fixed point x~ is a stable equilibrium if for every neighborhood U of x~ there is a neighborhood such that every solution x(t) starting in V remains in U for all times Lyapunov stability of an equilibrium means that solutions starting "close enough" to the equilibrium remain "close enough" forever. Such fixed point is considered Lyapunov stable or neutrally stable. In this case third condition for Lyapunov function is satisfied, when d. V/dt <=0. The time derivative must be negative semidefinite.

2. Asymptotic stability: fixed point x~ is asymptotically stable if it is Lyapunov stable

2. Asymptotic stability: fixed point x~ is asymptotically stable if it is Lyapunov stable and additionally V can be chosen so that for all Asymptotic stability means that solutions that start close enough not only remain close enough but also eventually converge to the equilibrium Such fixed point is considered asymptotically stable. In this case third condition for Lyapunov function is satisfied, when d. V/dt < 0. The time derivative must be negative definite.

3. Exponential stability: fixed point x~ is exponentially stable if there is a neighborhood

3. Exponential stability: fixed point x~ is exponentially stable if there is a neighborhood V of x~ and a constant a>0 such that Exponential stability means that solutions not only converge, but in fact converge faster than or at least as fast as the exponential function Exp(-at). Exponentially stable equilibria are also asymptotically stable, and hence Lyapunov stable.

Bifurcations Bifurcation is a qualitative change of phase portrait in the area of attraction

Bifurcations Bifurcation is a qualitative change of phase portrait in the area of attraction which can be achieved by change of driving parameter when passing through the critical value. We distinguish two principal types of bifurcations: Global bifurcation – its effects are not limited by the neighbourhood of a point or cycle in the phase space. It can not be detected by analysis of fixed point stability. Local bifurcation – its effects are limited by the neighbourhood of a point or cycle in the phase space. Fixed points may appear or disappear due to the parameter change, they change their stability, or even break apart into periodic points. Such bifurcation can be analysed entirely through changes in the local stability properties of equilibria, periodic orbits or other invariant sets.

The Logistic Equation The logistic equation, also known as Verhulst equation, is a formula

The Logistic Equation The logistic equation, also known as Verhulst equation, is a formula for approximating the evolution of an animal population over time. Contrary to the bacteria model, living conditions for animals significantly vary during the year. Some species are fertile just for particular season of year, not every existing animal reproduce etc. For this reason, the system might be better described by a discrete difference equation than a continuous differential equation. where xn is an actual population in the current year, xn+1 is population in the next year and r is combined rate for reproduction and for starvation. Zero value for the x means dead population and x=1 means population on its limit. Now we will examine what happens with stability and fixed points, if we try to change r. The only sure thing without any computations is, that for x(0)=0 we have a stable fixed point meaning dead population for any r.

Development of the population for various values of r.

Development of the population for various values of r.

Bifurcation diagram for the logistic equation The graph is an output of the Mathematica

Bifurcation diagram for the logistic equation The graph is an output of the Mathematica program. The initial value was x(0)=0. 1 and 300 iterations were calculated for every r. For the value r=3 we can observe the first bifurcation (doubling of the functional dependence). Another bifurcations follow for r=3. 449, r=3. 544 etc.

The bifurcation diagram can be divided into 4 parts 1. Extinction (r<1): if the

The bifurcation diagram can be divided into 4 parts 1. Extinction (r<1): if the growth rate is less than 1 the system "dies„ 2. Fixed point area (1<r<3): the series tends to a single value for any initial x 0 3. Oscillation area (3<r<3. 57): The series jumps between two or more discrete states. 4. Chaos area (3. 57<r<4): the system can evaluate to any position at all with no apparent order For higher values of r (r>4) all solutions zoom to infinity and the modeling aspects of this function become useless.

Stability analysis of the logistic equation To find a fixed point for the discrete

Stability analysis of the logistic equation To find a fixed point for the discrete system, we must solve: After accepting x 1~=0, we can find the second fixed point by: Stability condition for a discrete system: The first fixed point is stable for r<1 and unstable for r>1 The second fixed point is stable for 1<r<3, otherwise unstable

Basic types of local bifurcations 1. Saddle node (fold) bifurcation 2. Period doubling (flip)

Basic types of local bifurcations 1. Saddle node (fold) bifurcation 2. Period doubling (flip) bifurcation 3. Pitchfork bifurcation 4. Transcritical bifurcation 5. Hopf bifurcation

1. Saddle node (fold) bifurcation In this bifurcation two fixed points collide and annihilate

1. Saddle node (fold) bifurcation In this bifurcation two fixed points collide and annihilate each other. For r<0 there are two fixed points: a stable at and unstable at For r>0 there are no fixed points Differential equation of the system

Example for two-dimensional system, where r= -2 Differential equations Fixed points The Jacobian matrix

Example for two-dimensional system, where r= -2 Differential equations Fixed points The Jacobian matrix Linearized Jacobian matrix for x. A~ Eigenvalues for this Jacobian matrix Conclusion: the fixed point x. A~ is a saddle point since there are real eigenvalues of various signs.

Linearized Jacobian matrix for x. B~ Eigenvalues for this Jacobian matrix Conclusion: the fixed

Linearized Jacobian matrix for x. B~ Eigenvalues for this Jacobian matrix Conclusion: the fixed point x. B~ is an attracting node since there are real eigenvalues, both of negative signs. The name of this bifurcation is derived from the pair of these two types of fixed points – saddle and node. _________________________________________________ An example of the saddle-node bifurcation for Fixed points are given by unstable

2. Period doubling (flip) bifurcation This type of bifurcation can be observed at the

2. Period doubling (flip) bifurcation This type of bifurcation can be observed at the logistic equation. If we accept also negative values, we observe period halving in the left part of the graph and period doubling in the right part.

3 a. Pitchfork bifurcation Supercritical case In this bifurcation one fixed point splits into

3 a. Pitchfork bifurcation Supercritical case In this bifurcation one fixed point splits into three various ones. For r<0 there is just one stable fixed point at x=0 For r>0 there is one unstable fixed point at x=0 and two stable fixed points Differential equation of the system

3 b. Pitchfork bifurcation Subcritical case In this bifurcation three various fixed points annihilate

3 b. Pitchfork bifurcation Subcritical case In this bifurcation three various fixed points annihilate into one fixed point. For r>0 there is just one unstable fixed point at x=0 For r<0 there is one stable fixed point at x=0 and two unstable fixed points at Differential equation of the system

4. Transcritical bifurcation In this bifurcation there is one stable and one unstable fixed

4. Transcritical bifurcation In this bifurcation there is one stable and one unstable fixed point and they exchange their stability when they collide. For r<0 there is one stable fixed point at x=0 and one unstable fixed point for x=r For r>0 there is one unstable fixed point at x=0 and one stable fixed point for x=r Differential equation of the system

5. Hopf bifurcation This bifurcation is a two-dimensional one. In this bifurcation a single

5. Hopf bifurcation This bifurcation is a two-dimensional one. In this bifurcation a single fixed point changes into a limit cycle or vice versa. Differential equations of the system There is only one fixed point Jacobian matrix linearized Jacobian matrix

Eigenvalues determination Characteristic equation yields two complex conjugated roots According to our previous experience

Eigenvalues determination Characteristic equation yields two complex conjugated roots According to our previous experience we can say, that for r<0 there is a stable fixed point and for r>0 there is an unstable fixed point. To be able to decide about r=0 we have to use a Lyapunov function, choosing candidate function We can clearly see, that for r=0 the d. V/dt is outside the fixed point always negative, hence we have a Lyapunov function. This also tells us, that for r=0 the fixed point is Lyapunov stable and also asymptotically stable.

Phase diagram for r=-0. 1, x 10=1 and x 20=0 Phase diagram for r=+0.

Phase diagram for r=-0. 1, x 10=1 and x 20=0 Phase diagram for r=+0. 1, x 10=1 and x 20=0 Phase diagram for r=0, x 10=1 and x 20=0 Phase diagram for r=+0. 1, x 10=0. 2 and x 20=0

3 D interpretation of the Hopf Bifurcation. For negative values of r the system

3 D interpretation of the Hopf Bifurcation. For negative values of r the system converges to the fixed point (0, 0), for r=0 the system still converges to the fixed point, but very slowly. For positive values of r the attractor is not an unstable fixed point (0, 0) but a limit cycle regardless the starting point, i. e. it does not matter whether we start inside or outside the cycle. Diameter of the limit cycle raises with raising parameter r.

A program in Mathematica, which calculates the Hopf bifurcation

A program in Mathematica, which calculates the Hopf bifurcation

General rules concerning bifurcations. Continuous systems: a local bifurcation appears, when an eigenvalue has

General rules concerning bifurcations. Continuous systems: a local bifurcation appears, when an eigenvalue has zero real part. If the eigenvalue is zero, then there is a saddle-node, pitchfork or transcritical bifurcation. If eigenvalues have zero real part, but they are complex conjugated, then there is a Hopf bifurcation. Discrete systems: a local bifurcation appears, when the modulus of eigenvalue is equal to one. If the eigenvalue is +1, then there is a saddle-node, pitchfork or transcritical bifurcation. If the eigenvalue is -1, then there is a period doubling bifurcation. If there are two complex conjugated eigenvalues with modulus equal to one, then there is a Hopf bifurcation.