CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

Similar documents
CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

7 Two-dimensional bifurcations

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for COMPUTATIONAL BIOLOGY A. COURSE CODES: FFR 110, FIM740GU, PhD

2 Discrete growth models, logistic map (Murray, Chapter 2)

B5.6 Nonlinear Systems

TWO DIMENSIONAL FLOWS. Lecture 5: Limit Cycles and Bifurcations

Stability of Dynamical systems

1. < 0: the eigenvalues are real and have opposite signs; the fixed point is a saddle point

Calculus and Differential Equations II

PHY411 Lecture notes Part 5

Lesson 4: Non-fading Memory Nonlinearities

B5.6 Nonlinear Systems

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations

Math 331 Homework Assignment Chapter 7 Page 1 of 9

PHY411 Lecture notes Part 4

STABILITY. Phase portraits and local stability

Nonlinear dynamics & chaos BECS

Math 3301 Homework Set Points ( ) ( ) I ll leave it to you to verify that the eigenvalues and eigenvectors for this matrix are, ( ) ( ) ( ) ( )

Bifurcation of Fixed Points

EE222 - Spring 16 - Lecture 2 Notes 1

Practice Problems for Final Exam

Nonlinear Dynamics and Chaos

Part II. Dynamical Systems. Year

MATH 415, WEEK 11: Bifurcations in Multiple Dimensions, Hopf Bifurcation

Lecture 6. Lorenz equations and Malkus' waterwheel Some properties of the Lorenz Eq.'s Lorenz Map Towards definitions of:

APPPHYS217 Tuesday 25 May 2010

Edward Lorenz. Professor of Meteorology at the Massachusetts Institute of Technology

7 Planar systems of linear ODE

11 Chaos in Continuous Dynamical Systems.

One Dimensional Dynamical Systems

Problem Set Number 5, j/2.036j MIT (Fall 2014)

2.10 Saddles, Nodes, Foci and Centers

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325

Chapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems

Lecture 38. Almost Linear Systems

MA 527 first midterm review problems Hopefully final version as of October 2nd

DIFFERENTIAL GEOMETRY APPLIED TO DYNAMICAL SYSTEMS

MCE693/793: Analysis and Control of Nonlinear Systems

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II.

Chapter 7. Nonlinear Systems. 7.1 Introduction

Lecture 5. Outline: Limit Cycles. Definition and examples How to rule out limit cycles. Poincare-Bendixson theorem Hopf bifurcations Poincare maps

NBA Lecture 1. Simplest bifurcations in n-dimensional ODEs. Yu.A. Kuznetsov (Utrecht University, NL) March 14, 2011

APPM 2360: Final Exam 10:30am 1:00pm, May 6, 2015.

Introduction to Applied Nonlinear Dynamical Systems and Chaos

DYNAMICAL SYSTEMS. I Clark: Robinson. Stability, Symbolic Dynamics, and Chaos. CRC Press Boca Raton Ann Arbor London Tokyo

= F ( x; µ) (1) where x is a 2-dimensional vector, µ is a parameter, and F :

Chaos. Lendert Gelens. KU Leuven - Vrije Universiteit Brussel Nonlinear dynamics course - VUB

Entrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4.

8.1 Bifurcations of Equilibria

Chapter 3. Gumowski-Mira Map. 3.1 Introduction

Dynamical systems tutorial. Gregor Schöner, INI, RUB

Homework 2 Modeling complex systems, Stability analysis, Discrete-time dynamical systems, Deterministic chaos

Solutions to Dynamical Systems 2010 exam. Each question is worth 25 marks.

Chapter 1 Bifurcations and Chaos in Dynamical Systems

6.2 Brief review of fundamental concepts about chaotic systems

Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients. Takayuki Yamaguchi

MATH 614 Dynamical Systems and Chaos Lecture 24: Bifurcation theory in higher dimensions. The Hopf bifurcation.

April 13, We now extend the structure of the horseshoe to more general kinds of invariant. x (v) λ n v.

+ i. cos(t) + 2 sin(t) + c 2.

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD

Solution to Homework #4 Roy Malka

Mathematical Modeling I

Models Involving Interactions between Predator and Prey Populations

BIFURCATION PHENOMENA Lecture 1: Qualitative theory of planar ODEs

MATH 215/255 Solutions to Additional Practice Problems April dy dt

MIXED-MODE OSCILLATIONS WITH MULTIPLE TIME SCALES

Problem set 6 Math 207A, Fall 2011 Solutions. 1. A two-dimensional gradient system has the form

154 Chapter 9 Hints, Answers, and Solutions The particular trajectories are highlighted in the phase portraits below.

Problem set 7 Math 207A, Fall 2011 Solutions

Journal of Differential Equations

DYNAMICS OF THREE COUPLED VAN DER POL OSCILLATORS WITH APPLICATION TO CIRCADIAN RHYTHMS

Limit Cycles II. Prof. Ned Wingreen MOL 410/510. How to prove a closed orbit exists?

Solutions for B8b (Nonlinear Systems) Fake Past Exam (TT 10)

Section 5.4 (Systems of Linear Differential Equation); 9.5 Eigenvalues and Eigenvectors, cont d

Complex Dynamic Systems: Qualitative vs Quantitative analysis

Clearly the passage of an eigenvalue through to the positive real half plane leads to a qualitative change in the phase portrait, i.e.

However, in actual topology a distance function is not used to define open sets.

1. (i) Determine how many periodic orbits and equilibria can be born at the bifurcations of the zero equilibrium of the following system:

A plane autonomous system is a pair of simultaneous first-order differential equations,

Math 273 (51) - Final

Math 216 First Midterm 18 October, 2018

CHAPTER 6 HOPF-BIFURCATION IN A TWO DIMENSIONAL NONLINEAR DIFFERENTIAL EQUATION

4 Second-Order Systems

On dynamical properties of multidimensional diffeomorphisms from Newhouse regions: I

Math 232, Final Test, 20 March 2007

Mathematical Model of Forced Van Der Pol s Equation

Half of Final Exam Name: Practice Problems October 28, 2014

BIFURCATION PHENOMENA Lecture 4: Bifurcations in n-dimensional ODEs

arxiv: v3 [math.ds] 12 Jun 2013

Examples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling

Systems of Linear ODEs

dynamical zeta functions: what, why and what are the good for?

8 Example 1: The van der Pol oscillator (Strogatz Chapter 7)

ENGI Linear Approximation (2) Page Linear Approximation to a System of Non-Linear ODEs (2)

TWELVE LIMIT CYCLES IN A CUBIC ORDER PLANAR SYSTEM WITH Z 2 -SYMMETRY. P. Yu 1,2 and M. Han 1

Math 216 Final Exam 24 April, 2017

The Big, Big Picture (Bifurcations II)

DIFFERENTIAL EQUATIONS, DYNAMICAL SYSTEMS, AND AN INTRODUCTION TO CHAOS

Transcription:

CHALMERS, GÖTEBORGS UNIVERSITET EXAM for DYNAMICAL SYSTEMS COURSE CODES: TIF 155, FIM770GU, PhD Time: Place: Teachers: Allowed material: Not allowed: January 08, 2018, at 08 30 12 30 Johanneberg Kristian Gustafsson, 070-050 2211 (mobile), visits once at 09 30 Mathematics Handbook for Science and Engineering any other written material, calculator Maximum score on this exam: 12 points (need 5 points to pass). Maximum score for homework problems: 24 points (need 10 points to pass). CTH 18 passed; 26 grade 4; 31 grade 5, GU 18 grade G; 28 grade VG. 1. Multiple choice questions [2 points] For each of the following questions identify all the correct alternatives A E. Answer with letters among A E. Some questions may have more than one correct alternative. In these cases answer with all appropriate letters among A E. a) Classify the fixed point of the two-dimensional dynamical system: ( ) 3 4 ẋ = Ax, where A =. 4 2 A. It is a saddle point. B. It is a stable spiral. C. It is an unstable spiral. D. It is a stable node. E. It is an unstable node. b) Which of the following statements are true in general for smooth onedimensional dynamical systems (flows on the line)? A. They can be solved using separation of variables. B. They can have periodic solutions. C. They can be chaotic. D. Around any non-infinite initial position a unique solution exists within a non-empty time interval. E. The only possible non-infinite attractors are fixed points. 1

c) Which of the following kinds of fixed points do you typically encounter in conservative dynamical systems A. Nodes B. Saddles C. Spirals D. Centers E. Conservative systems do not have fixed points. d) A three-dimensional dynamical system has the following Lyapunov exponents: λ 1 = 1, λ 2 = 0, λ 3 = 1. Which of the following statements are true? A. The system may be chaotic. B. The system may be volume preserving. C. The system may be Hamiltonian. D. The system may have a globally attracting limit cycle. E. The system may be time reversible. e) The existence and uniqueness theorem implies that trajectories cannot intersect if the flow is smooth enough. But in many phase portraits of smooth systems different trajectories appear to intersect at fixed points, for example close to saddle points. Is this a contradiction? Answer with one of the following alternatives. A. No, this is an artefact of projecting higher-dimensional trajectories onto two dimensions. B. No, since no trajectory can pass the fixed point, trajectories do not intersect. C. No, since flows are non-smooth at fixed points. D. No, near the fixed point the density of trajectories become too high for the resolution of the phase portrait. Therefore trajectories appear to intersect even though they do not. E. No, it just appears that way due to numerical errors when plotting the phase portrait. 2

The following sequence of images shows the phase portraits for the system ẋ = r + x 2 ẏ = xy (1) for three values of r: r = 1 r = 0 r = 1 f) What is the sum of the indices of the two fixed points in the leftmost panel with r = 1? A. -2 B. -1 C. 0 D. 1 E. 2 2. Short questions [2 points] For each of the following questions give a concise answer within a few lines per question. a) Consider once again the system in Eq. (1) above. Is the index preserved in the bifurcation as r passes 0? Explain. No, the index is not preserved. For r < 0 the index is 2, after the bifurcation the index is 0. At the bifurcation point r = 0 the line x = 0 consists of non-isolated fixed points. Therefore index theorem does not apply when r = 0 and the index does not need to be conserved. b) What is meant by a ghost or slow passage in the context of fixed points? Close to for example a saddle-node bifurcation of a one-dimensional dynamical system the magnitude of the flow is small where the fixed points used to be. This creates a bottleneck in the dynamics with slow passing time (typically of the order 1/ µ where µ is the bifurcation parameter of a bifurcation on normal form). c) Explain what a limit cycle is. Give an example of a system with a limit cycle. A limit cycle is a closed orbit that is isolated (at least from one side). It can be stable, unstable or half-stable. An example of a system with a limit cycle is the van der Pol oscillator. 3

d) What is meant by structural stability? Structural stability means that the topology of the flow does not change as the vector field is weakly perturbed. For example, linear centers are nt structurally stable since the flow surrounding them may become either attracting or repelling under a small non-linear perturbation. e) In the problem sets you calculated the Lyapunov exponents for a continuous dynamical system (the Lorenz equations) and for a discrete dynamical system (the Hénon map). Contrast any similarities or differences in the two approaches. For the continuous system a discretisation of the dynamics was used to calculate the Lyapunov matrix M as a product of discrete matrices for short time intervals. Therefore the calculation of the Lyapunov exponents was basically identical to that of a discrete system, with the difference that the discrete matrix in the continuous case was given by I + Jδt, while it for the discrete system was given simply by J. f) The generalized fractal dimension D q is defined by D q 1 1 q lim ln I(q, ɛ) ɛ 0 ln(1/ɛ) (2) with I(q, ɛ) = N box k=1 p q k (ɛ). Here p k is the probability to be in the k:th occupied box and N box is the total number of occupied boxes. Briefly explain an appropriate method to calculate D q from numerical or experimental data. A suitable method is to plot ln I(q, ɛ) against ln ɛ to see in which range we have a power-law scaling I(q, ɛ) A q ɛ (q 1)Dq. In this range the slope of the curve gives D q independent from A q : D q = 1 ln I(q, ɛ). q 1 ln ɛ 3. Bifurcations [2 points] a) Sketch the bifurcation diagram for the dynamical system ẋ = x + rx(x 1). Determine all values r c where bifurcations occur and determine the kind(s) of bifurcation(s). 4

Fixed points where x + rx(x 1) = 0, i.e. at x = 0 and x = 1 1/r. Linear stability analysis f (x) = 1 r + 2rx shows that x = 0 is stable if r > 1 and unstable otherwise and that x = 1 1/r is stable if r < 1 and unstable otherwise. We have a transcritical bifurcation at r c = 1. b) Sketch the bifurcation diagram for the dynamical system ẋ = x 3 + r 2 x rx Determine all values r c where bifurcations occur and determine the kind(s) of bifurcation(s). Fixed points where x 3 + r(r 1)x = 0, i.e. at x = 0 and x = ± r(1 r) (these exists if 0 r 1). We have f (x) = 3x 2 + r 2 r, i.e. x = 0 is stable if 0 < r < 1 and unstable otherwise, while x = ± r(1 r) are unstable when they exist. The system has two subcritical pitchfork bifurcations at r c = 0 and r c = 1. 4. Construction of degenerate fixed points [2 points] Both stars and degenerate nodes are fixed points of linear systems whose Jacobian evaluated at the fixed point has two equal eigenvalues. For a star all vectors are eigenvectors, while a degenerate node only has a single eigenvector. a) Construct an example of linear dynamical system for x and y that has a stable star at the point (x, y ) = (1, 2). The condition that any vector ξ is an eigenvector, Jξ = λξ, implies 5

that J is λi, where I is the identity matrix and λ is the eigenvalue. As an example, the system ẋ = 1 x ẏ = 2 y has a fixed point at (x, y ) = (1, 2) that is a stable star (eigenvalue λ = 1). b) Construct an example of linear dynamical system for x and y that has a stable degenerate node at the origin. The eigenvalues are equal with negative value λ = tr J/2 if tr J = 2 det J: J 11 + J 22 = 2 J 11 J 22 J 12 J 21. As an example, choose J 21 = 0, J 12 = 1, J 11 = J 22 = 1: ( ) 1 1 J = 0 1 with eigenvalue λ = 1. Since this choice of J is not a multiple of the unit matrix, we can only have one eigenvector corresponding to the single eigenvalue λ = 1, as required. c) Determine the stable and unstable manifolds for your example system in subtask b). The stable manifold is given by the eigendirection v, such that Jv = v: ( ) ( ) ( ) 1 1 vx + v v = y vx = 0 1 v y v y We can take as eigenvector v = (1, 0) and the stable manifold is the x-axis. The unstable manifold is simply the fixed point (x, y ) = (0, 0) (also does not exist is an acceptable answer). d) Construct a nonlinear system with a single fixed point at (x, y ) = (0, 0). The system should be such that linear stability analysis predicts a line of fixed points, but the contribution from non-linear terms results in a single fixed point that is a stable node. One example of such a system is ẋ = x ẏ = y 2 6

We have a single fixed point attracting from all directions without swirl (stable node) and linear stability analysis predicts a line of fixed points because one eigenvalue of the Jacobian J(0, 0) is zero: ( ) 1 0 J =. 0 0 5. Biased van der Pol oscillator [2 points] Consider the van der Pol oscillator biased with a constant force F : Here µ and F are real parameters. ẍ = µ(x 2 1)ẋ x + F. (3) a) Introduce y = ẋ and write Eq. (3) as a dynamical system and determine all of its fixed points. Let y = ẋ and write ẋ = y ẏ = µ(x 2 1)y x + F A single fixed point at (x, y ) = (F, 0). b) Analytically find the values of µ and F for which bifurcations occur in the system. The kind of bifurcations you should look for are bifurcations where the real part of an eigenvalue of the Jacobian at an isolated fixed point passes zero. Identify the types of found bifurcations. The Jacobian of the fixed point (x, y ) = (F, 0) is ( ) ( ) J(x, y 0 1 0 1 ) = 2µx y 1 µ((x ) 2 = 1) 1 µ(f 2 1) tr J(x, y ) = µ(f 2 1) det J(x, y ) = 1 with eigenvalues λ 1,2 = µ(f 2 1) ± µ 2 (F 2 1) 2 4 2 A bifurcation occurs if the real part of its eigenvalue passes zero. Assuming that the square root is positive, the condition to have a zero eigenvalue is: 0 = tr J ± (tr J) 2 4 det J 2 tr J = ± (tr J) 2 4 det J (tr J) 2 = (tr J) 2 4 det J 0 = 4 det J.. 7

That is, this condition can only be satisfied if det J = 0, which is not the case here (det J = 1). The only possibility is to have a Hopf bifurcation, i.e. if the real part of the eigenvalue crosses zero with a non-zero imaginary part. The imaginary part of the eigenvalue can only come from the square root. The real part crosses zero when either µ = 0 or when F = ±1. For both these cases, the eigenvalues are purely imaginary, i.e. we have Hopf bifurcations. In conclusion, we have Hopf bifurcations along the curves µ = 0, F = 1, or F = 1. c) Plot the curves in (µ, F ) space where bifurcations occur and label them with their types. Label the regions between the bifurcation curves with the number of stable fixed points and the number of unstable fixed points. We have one fixed point everywhere. It is stable when µ(f 2 1) < 0 6. Middle Cantor sets [2 points] The two figures below show the first few generations in the construction of two fractals. The fractal set is obtained by iterating to generation S n with n. a) Analytically find the box-counting dimension D 0 for the Middle third s Cantor set, obtained by at each generation removing the central 1/3 of each interval. Using boxes of side length ɛ = 3 n it takes N n = 2 n boxes to cover the fractal. Thus ln(2 n ) D 0 = lim n ln(3 n ) = ln 2 ln 3. b) Analytically find the box-counting dimension D 0 for the Middle fourth s Cantor set, obtained by at each generation removing the central 1/4 8

of each interval. At generation n we have N n = 2 n connected intervals of equal length: l n = l n 1 (1 1/4)/2 = l n 1 3/8. This recursion equation is solved by (using Beta or by inspection) l n = l 0 (3/8) n. Using ɛ n = l n the boxcounting dimension becomes D 0 = lim n ln(2 n ) ln(l 0 (3/8) n ) = ln 2 ln(3/8). c) Analytically find the box-counting dimension D 0 for the generalized Cantor set obtained by at each generation removing the central fraction q of each interval. To check your result, make sure that D 0 equals your results in a) for q = 1/3 and in b) for q = 1/4. You can also check that D 0 1 as q 0 and D 0 0 as q 1. Similar to subtask b), at generation n we have N n = 2 n connected intervals of equal length: l n = l n 1 (1 q)/2. This gives l n = l 0 ((1 q)/2) 2 and the fractal dimension becomes D 0 = lim n ln(2 n ) ln(l 0 ((1 q)/2) n ) = ln 2 ln(2/(1 q)). 9