Lösningsförslag till tenta i ODE och matematisk modellering, MMG511, MVE162 (MVE161)

Size: px
Start display at page:

Download "Lösningsförslag till tenta i ODE och matematisk modellering, MMG511, MVE162 (MVE161)"

Transcription

1 MATEMATIK Datum: Tid: GU, Chalmers Hjälpmedel: - Inga A.Heintz Teleonvakt: Jonatan Kallus Tel.: 55 Lösningsörslag till tenta i ODE och matematisk modellering, MMG5, MVE6 (MVE6). Formulate and prove the theorem about properties o solutions to linear systems o ODEs with periodic coe cients: = A(t); A(t + p) = A(t), when t!. (p) Theorem on boundedness and zero limits o solutions to periodic linear systems. ) Every solution to a periodic linear system is bounded on R + i and only i the absolute value o each Floquet multiplier is not greater than and any Floquet multiplier with absolute value is semisimple. ) Every solution to a periodic linear system tends to zero at t! i and only i the absolute value o each Floquet multiplier is strictly less than. Floquet multipliers are eigenvalues to the monodromy matri ( p; ) o the system. By Floquet theorem any solution (t) to system satisying initial conditions () =, is represented as (t) = A(t)(t); A(t + p) = A(t), 8t R () (t) = ( t; ) = (t) ep(tf )( ; ) = (t) ep(tf ) where F = plog(( p; )); ( ; ) =. (t) is a p - periodic continuous or piecewise continuous matri valued unction. (t) is invertible or all t as a product o invertible matrices. We de ne y(t) = ep(tf ) as a solution to the equation y (t) = F y; y() = () y(t) = (t)(t), and (t) = (t)y(t). The mapping (t) determines a one to one correspondence between solutions to the periodic system () and the autonomous system ().The periodicity and continuity properties o (t) and (t) imply that there is a constant M > such that k(t)k M and (t) M or all t R. It implies that k(t)k M ky(t)k and ky(t)k M k(t)k. Thereore )k(t)k is bounded on R + i and only i corresponding ky(t)k = kep(tf )k is bounded on R + : ) k(t)k! when t! i and only i corresponding ky(t)k! when t! : Since Log (( p; )) = G = pf, it ollows that (( p; )) = ep(p) : (F )g (F ) = Log() : (( p; )) p and that algebraic and geometric multiplicities o each (F ) coincide with those o ep(p) (( p; )) :We use now that Log(z) = ln(jzj) + i arg(z) ep(z) = ep(re z)(cos(im z) + i sin(im z) Here we choose the argument arg(z) [:) to make Log an invertible unction that is called the principle logarithm. The ollowing connections between properties o Floquet multipliers and properties o corresponding eigenvalues to the matri F = plog(( p; )) are a direct consequence: a) The Floquet multiplier (( p; ));hasjj < i and only i Re Log() < that is i the corresponding eigenvalue = plog() to F has Re Log() < : b) The Floquet multiplier (( p; ));has jj i and only i Re Log() that is i the corresponding eigenvalue = plog() to F has Re Log() : c) The Floquet multiplier (( p; )); with jj = is semisimple i and only i the corresponding eigenvalue = plog() to F has Re Log() = is semisimple. Known relations between properties o solutions to an autonomous system and the spectrum o corresponding matri applied to the system y (t) = F y and to the spectrum (F ) o the matri F together with statements ),), a),b),c) in the present proo imply the statement o the theorem.

2 . Formulate and give a proo to Lyapunov s theorem on stability o equilibrium points. (p) Lyapunov s theorem on stability Let be an equilibrium point or the system = () with : G! R n ; Lipschitz, () =. Suppose there is a positive de nite continuously di erentiable, C (U) unction V : U! R ; such that U G; open; U and V (z) = rv (z) 8z U. Then is a stable equilibrium point. Remark. A unction V with these properties is usually called the Lyapunov unction o the system. Proo. Take an arbitrary " > such that B("; ) U. Let = min zs(";) V (z) be a minimum o the continuous unction V on the boundary o B("; ); that is the sphere S("; ) = z : kzk = "g and is a compact set (closed and bounded). Then > because V (z) > outside the equilibrium point. By continuity o the unction V and the act that V () = one can nd a < < " such that 8z B(; ) we have V (z) < =. On the other hand or any part o the trajectory (t) = '(t; ), inside U the unction V ('(t; )) is nonincreasing because d dtv ('(t; )) = (rv ) ((t)). Thereore all trajectories '(t; ) with initial points B(; ) satisy V () < =. Thereore V ('(t; )) < = and '(t; ) cannot reach the sphere S("; ) where V (z) = min zs(";) V (z). Thereore any such trajectory stays within the ball B("; ) and by the de nition, the origin is stable. It implies also that R + I, where I is the maimal interval or initial point, because the trajectory stays inside a compact set.. Consider the ollowing system o ODE: d! r (t) = A! r (t), with a constant matri A having eigenvalues dt and : A = 5. Find a general solution to the system and a canonical Jordan orm o the matri A. Find all initial conditions such that solutions to I.V.P. will be bounded. (p) Solution. We nd eigenvectors corresponding eigenvalues. =. an eigenvector can be taken as v = corresponding to the eigenvalue =. = A I = 5 :There are no other linearly independent eigenvectors an eigenvector can be taken as v = 5 We check i =, has an generalized eigenvector, namely i Av () eigenvector can be chosen as v () = The canonical Jordan orm or the matri A is J = 5 5, = v has a solution. 5, reduced row echelon orm is: 5 : Vectors v, v (), and v build a basis in R. General solution to the system with initial data = C v + C v () + C v is 5 : (t) = C v + tc v + C v () + e t C v 5 :Generalized Solutions are bounded i and only i = C v. Find maimal eistence time interval or solution o the I.V.P. = t with arbitrary initial data () =. (p) d = t, is the equation with separable variables.

3 R d = R tdt ; = t + C ; general solution is: (t) = C t : To satisy the initial condition we put t = and nd () = = C, thereore C = = gives a constant solution (t) = or all t R. I ma () = R and (t) = t. For < we observe that the solution (t) = t is de ned or all t R. Thereore I ma () = R: For > we observe that the solution (t) = is de ned only or t ( t up in the points p. Thereore in this case I ma () = ( p ; p ): p ; p ). The solution blows 5. Consider the ollowing system o ODEs representing a one-dimensional mechanical system with velocity y and coordinate. Find all equilibrium points, investigate their stability properties, and nd their possible domains o attraction. = y y = y (p) Equilibrium points are (; ) and ( ; ): Jacobi matri is A(; y) = Jacobi matri at the origin is, characteristic polynomial is p() = + +, eigenvalues are ip ; ip. Real parts o eigenvalues are negative and thereore the origin isstable ocus, asymptotically stable equilibrium. Jacobi matri at the point ( ; ) is, characteristic polynomial is p() = p + ;eigenvalues are 5 ; p 5. One is negative, another is positive, the equilibrium point is a saddle point and is unstable. We try to nd the domain o attraction or the asymptotically stable point in the origin. R The system represents the one dimensional Newton equation with potential orce with potential G() = z + z dz = + : A natural Lyapunov unction to such a system is the sum o kinetic and potential energy: V (; y) = y + + Calculating derivative o V along trajectories we arrive to V (; y) = rv = + (y) + y y = y We can apply LaSalle s invariance principle to nd domain o attraction o the equilibrium in the origin. The set V () denotes the set where V (; y) = : I a trajectory '(t; ) has the closure o the positive semi orbit O + () compact and contained in the open set U where V (; y), then '(t; ) approaches the union o invariant sets (orbits) in V () as t!. I this union o invariant sets consists o one point, then the trajectory '(t; ) tends to this point as t!. This condition on the trajectory '(t; ) is easy to check by nding a compact positively invariant set K or the system where the condition V (; y) is satis ed.then all trajectories starting in K will have the closure o the positive semi- orbit O + () compact and contained in K. I this positively invariant set includes only one equilibrium as an invariant set in V (), then this equilibrium is an attractor or all trajectories starting in K that is it s domain o attraction. Positively invariant sets o our system can be ound as sets bounded by level sets o the Lyapunov unction V (; y) = y + + (with not very large values to have them as closed curves). We need to nd one such positively invariant set that does not contain the equilibrium point ( ; ): The largest such set would be one with boundary going eactly through the point ( ; ). Taking the level set o V going through this point we get corresponding value or V : V ( ; ) = = 6. The level set V (; y) = 6 can be epressed by the implicit equation y + + = 6 and is evidently symmetric with respect to ais. We need to investigate it s shape. Considering the derivative d d + 6 = o the unction g() = + 6 we observe that g() is rising between and, g( ) = ; g() = 6, and g() is decreasing or < : In the point = :5 it is equal to zero. Thereore or [ ; :5] the unction g() is non-negative. It implies that or [ ; :5] the level set V (; y) = 6 consists o two curves symmetric with respect to q ais: y = + : It gives the boundary o the bounded domain U symmetric with respect to the ais. The part o the level set V (; y) = 6 in the hal plane < does not bound a compact set and is o no interest or consideration o the equilibrium in the origin.

4 y This domain is positively invariant because V (; y) or all (; y). The same is valid also or any smaller set bounded by level sets V (; y) = C < =6: Points (; y) U where V (; y) = are on the - ais. Ecept the origin, they all have velocities (; y) pointed across the - ais and cannot belong to an invariant set in V ().The second equilibrium point ( ; ) o the system was ecluded beore by the choice o the level set o V (; y) = =6. Thereore the origin is the only invariant set in V () \ U. It implies that all trajectories starting in U tend to the origin as t!, and thereore U is the domain o attraction or the asymptotically equilibrium point in the origin. 6. Show that the ollowing system o ODEs has a periodic solution. = y y = y ln + y (p) We will consider a simple test unction V (; y) = ( + y ). V (; y) = y y y ln + y = y ln + y. The ellipse + y = (red in the picture) is the boundary between the domains where V (; y) has negative and positive values. For + y we get V (; y) For + y > we get V (; y) < Thereore a circle with radius r so small that + y or + y < r will have the property that no one trajectory enters it: Thereore a circle with radius R so large that + y > or + y R will have the property that no one trajectory escapes it: The largest circle inside the ellipse + y = is + y =, or + y = The smallest circle outside the ellipse + y = is + y =. + y = y Thereore choosing r = and R = we observe that these two circles bound an annulus shaped set K = (; y) : r + y R that is positively invariant and compact. The system has no equilibrium in this set. Thereore according to the Poincare-Bendison theorem K must contain at least one periodic orbit. Ma. points; Threshold or marks: or GU: VG: 9 points; G: points. For Chalmers: 5: points; : 7 points; : points; One must pass both the home assignments and the eam to pass the course. Total points or the course are calculated as: T otal = :6 Assignment + :6 Assignment + :68 Eam - that is the average o the points or the home assignments (%) and or this eam (68%). The same threshold is valid or the eam, or the home assignments, and or the total points or the course.

5 Points that you have got or the assignments and or the eam are valid and are kept up to the moment when you will collect all necessary points.

(4p) See Theorem on pages in the course book. 3. Consider the following system of ODE: z 2. n j 1

(4p) See Theorem on pages in the course book. 3. Consider the following system of ODE: z 2. n j 1 MATEMATIK Datum -8- Tid eftermiddag GU, Chalmers Hjälpmedel inga A.Heintz Telefonvakt Aleei Heintz Tel. 76-786. Tenta i ODE och matematisk modellering, MMG, MVE6 Answer rst those questions that look simpler,

More information

MATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:

MATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.: MATEMATIK Datum: 20-08-25 Tid: eftermiddag GU, Chalmer Hjälpmedel: inga A.Heintz Telefonvakt: Ander Martinon Tel.: 073-07926. Löningar till tenta i ODE och matematik modellering, MMG5, MVE6. Define what

More information

8 Periodic Linear Di erential Equations - Floquet Theory

8 Periodic Linear Di erential Equations - Floquet Theory 8 Periodic Linear Di erential Equations - Floquet Theory The general theory of time varying linear di erential equations _x(t) = A(t)x(t) is still amazingly incomplete. Only for certain classes of functions

More information

1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal

1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal . Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal 3 9 matrix D such that A = P DP, for A =. 3 4 3 (a) P = 4, D =. 3 (b) P = 4, D =. (c) P = 4 8 4, D =. 3 (d) P

More information

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

Half of Final Exam Name: Practice Problems October 28, 2014 Math 54. Treibergs Half of Final Exam Name: Practice Problems October 28, 24 Half of the final will be over material since the last midterm exam, such as the practice problems given here. The other half

More information

Math Ordinary Differential Equations

Math Ordinary Differential Equations Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x

More information

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation. 1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear

More information

1.7. Stability and attractors. Consider the autonomous differential equation. (7.1) ẋ = f(x),

1.7. Stability and attractors. Consider the autonomous differential equation. (7.1) ẋ = f(x), 1.7. Stability and attractors. Consider the autonomous differential equation (7.1) ẋ = f(x), where f C r (lr d, lr d ), r 1. For notation, for any x lr d, c lr, we let B(x, c) = { ξ lr d : ξ x < c }. Suppose

More information

Math 1553, Introduction to Linear Algebra

Math 1553, Introduction to Linear Algebra Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level

More information

1 Relative degree and local normal forms

1 Relative degree and local normal forms THE ZERO DYNAMICS OF A NONLINEAR SYSTEM 1 Relative degree and local normal orms The purpose o this Section is to show how single-input single-output nonlinear systems can be locally given, by means o a

More information

Linearized methods for ordinary di erential equations

Linearized methods for ordinary di erential equations Applied Mathematics and Computation 104 (1999) 109±19 www.elsevier.nl/locate/amc Linearized methods for ordinary di erential equations J.I. Ramos 1 Departamento de Lenguajes y Ciencias de la Computacion,

More information

THE ROSENZWEIG-MACARTHUR PREDATOR-PREY MODEL

THE ROSENZWEIG-MACARTHUR PREDATOR-PREY MODEL THE ROSENZWEIG-MACARTHUR PREDATOR-PREY MODEL HAL L. SMITH* SCHOOL OF MATHEMATICAL AND STATISTICAL SCIENCES ARIZONA STATE UNIVERSITY TEMPE, AZ, USA 8587 Abstract. This is intended as lecture notes for nd

More information

Stability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5

Stability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5 EECE 571M/491M, Spring 2008 Lecture 5 Stability of Continuous Systems http://courses.ece.ubc.ca/491m moishi@ece.ubc.ca Dr. Meeko Oishi Electrical and Computer Engineering University of British Columbia,

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a

More information

MTH 2530: Linear Algebra. Sec Systems of Linear Equations

MTH 2530: Linear Algebra. Sec Systems of Linear Equations MTH 0 Linear Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Week # Section.,. Sec... Systems of Linear Equations... D examples Example Consider a system of

More information

systems of linear di erential If the homogeneous linear di erential system is diagonalizable,

systems of linear di erential If the homogeneous linear di erential system is diagonalizable, G. NAGY ODE October, 8.. Homogeneous Linear Differential Systems Section Objective(s): Linear Di erential Systems. Diagonalizable Systems. Real Distinct Eigenvalues. Complex Eigenvalues. Repeated Eigenvalues.

More information

3. Fundamentals of Lyapunov Theory

3. Fundamentals of Lyapunov Theory Applied Nonlinear Control Nguyen an ien -.. Fundamentals of Lyapunov heory he objective of this chapter is to present Lyapunov stability theorem and illustrate its use in the analysis and the design of

More information

1 Lyapunov theory of stability

1 Lyapunov theory of stability M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability

More information

Given the vectors u, v, w and real numbers α, β, γ. Calculate vector a, which is equal to the linear combination α u + β v + γ w.

Given the vectors u, v, w and real numbers α, β, γ. Calculate vector a, which is equal to the linear combination α u + β v + γ w. Selected problems from the tetbook J. Neustupa, S. Kračmar: Sbírka příkladů z Matematiky I Problems in Mathematics I I. LINEAR ALGEBRA I.. Vectors, vector spaces Given the vectors u, v, w and real numbers

More information

Department of Mathematics IIT Guwahati

Department of Mathematics IIT Guwahati Stability of Linear Systems in R 2 Department of Mathematics IIT Guwahati A system of first order differential equations is called autonomous if the system can be written in the form dx 1 dt = g 1(x 1,

More information

Introduction to Applied Nonlinear Dynamical Systems and Chaos

Introduction to Applied Nonlinear Dynamical Systems and Chaos Stephen Wiggins Introduction to Applied Nonlinear Dynamical Systems and Chaos Second Edition With 250 Figures 4jj Springer I Series Preface v L I Preface to the Second Edition vii Introduction 1 1 Equilibrium

More information

8.1 Bifurcations of Equilibria

8.1 Bifurcations of Equilibria 1 81 Bifurcations of Equilibria Bifurcation theory studies qualitative changes in solutions as a parameter varies In general one could study the bifurcation theory of ODEs PDEs integro-differential equations

More information

Definition (T -invariant subspace) Example. Example

Definition (T -invariant subspace) Example. Example Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Main topics and some repetition exercises for the course MMG511/MVE161 ODE and mathematical modeling in year Main topics in the course:

Main topics and some repetition exercises for the course MMG511/MVE161 ODE and mathematical modeling in year Main topics in the course: Main topics and some repetition exercises for the course MMG5/MVE6 ODE and mathematical modeling in year 04. Main topics in the course:. Banach fixed point principle. Picard- Lindelöf theorem. Lipschitz

More information

Lecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.

Lecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University. Lecture 4 Chapter 4: Lyapunov Stability Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 4 p. 1/86 Autonomous Systems Consider the autonomous system ẋ

More information

Achieve asymptotic stability using Lyapunov's second method

Achieve asymptotic stability using Lyapunov's second method IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X Volume 3, Issue Ver I (Jan - Feb 07), PP 7-77 wwwiosrjournalsorg Achieve asymptotic stability using Lyapunov's second method Runak

More information

33A Linear Algebra and Applications: Practice Final Exam - Solutions

33A Linear Algebra and Applications: Practice Final Exam - Solutions 33A Linear Algebra and Applications: Practice Final Eam - Solutions Question Consider a plane V in R 3 with a basis given by v = and v =. Suppose, y are both in V. (a) [3 points] If [ ] B =, find. (b)

More information

On linear and non-linear equations.(sect. 2.4).

On linear and non-linear equations.(sect. 2.4). On linear and non-linear equations.sect. 2.4). Review: Linear differential equations. Non-linear differential equations. Properties of solutions to non-linear ODE. The Bernoulli equation. Review: Linear

More information

Lecture 11: Eigenvalues and Eigenvectors

Lecture 11: Eigenvalues and Eigenvectors Lecture : Eigenvalues and Eigenvectors De nition.. Let A be a square matrix (or linear transformation). A number λ is called an eigenvalue of A if there exists a non-zero vector u such that A u λ u. ()

More information

Section 5.5. Complex Eigenvalues

Section 5.5. Complex Eigenvalues Section 5.5 Complex Eigenvalues Motivation: Describe rotations Among transformations, rotations are very simple to describe geometrically. Where are the eigenvectors? A no nonzero vector x is collinear

More information

ME 680- Spring Representation and Stability Concepts

ME 680- Spring Representation and Stability Concepts ME 680- Spring 014 Representation and Stability Concepts 1 3. Representation and stability concepts 3.1 Continuous time systems: Consider systems of the form x F(x), x n (1) where F : U Vis a mapping U,V

More information

Dynamical Systems & Lyapunov Stability

Dynamical Systems & Lyapunov Stability Dynamical Systems & Lyapunov Stability Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University Outline Ordinary Differential Equations Existence & uniqueness Continuous dependence

More information

Solutions to Math 53 Math 53 Practice Final

Solutions to Math 53 Math 53 Practice Final Solutions to Math 5 Math 5 Practice Final 20 points Consider the initial value problem y t 4yt = te t with y 0 = and y0 = 0 a 8 points Find the Laplace transform of the solution of this IVP b 8 points

More information

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

Chapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems Chapter #4 Robust and Adaptive Control Systems Nonlinear Dynamics.... Linear Combination.... Equilibrium points... 3 3. Linearisation... 5 4. Limit cycles... 3 5. Bifurcations... 4 6. Stability... 6 7.

More information

Complex Dynamic Systems: Qualitative vs Quantitative analysis

Complex Dynamic Systems: Qualitative vs Quantitative analysis Complex Dynamic Systems: Qualitative vs Quantitative analysis Complex Dynamic Systems Chiara Mocenni Department of Information Engineering and Mathematics University of Siena (mocenni@diism.unisi.it) Dynamic

More information

Notation. 0,1,2,, 1 with addition and multiplication modulo

Notation. 0,1,2,, 1 with addition and multiplication modulo Notation Q,, The set of all natural numbers 1,2,3, The set of all integers The set of all rational numbers The set of all real numbers The group of permutations of distinct symbols 0,1,2,,1 with addition

More information

Chapter 9 Global Nonlinear Techniques

Chapter 9 Global Nonlinear Techniques Chapter 9 Global Nonlinear Techniques Consider nonlinear dynamical system 0 Nullcline X 0 = F (X) = B @ f 1 (X) f 2 (X). f n (X) x j nullcline = fx : f j (X) = 0g equilibrium solutions = intersection of

More information

There is a more global concept that is related to this circle of ideas that we discuss somewhat informally. Namely, a region R R n with a (smooth)

There is a more global concept that is related to this circle of ideas that we discuss somewhat informally. Namely, a region R R n with a (smooth) 82 Introduction Liapunov Functions Besides the Liapunov spectral theorem, there is another basic method of proving stability that is a generalization of the energy method we have seen in the introductory

More information

1. Find the solution of the following uncontrolled linear system. 2 α 1 1

1. Find the solution of the following uncontrolled linear system. 2 α 1 1 Appendix B Revision Problems 1. Find the solution of the following uncontrolled linear system 0 1 1 ẋ = x, x(0) =. 2 3 1 Class test, August 1998 2. Given the linear system described by 2 α 1 1 ẋ = x +

More information

a11 a A = : a 21 a 22

a11 a A = : a 21 a 22 Matrices The study of linear systems is facilitated by introducing matrices. Matrix theory provides a convenient language and notation to express many of the ideas concisely, and complicated formulas are

More information

Convergence Rate of Nonlinear Switched Systems

Convergence Rate of Nonlinear Switched Systems Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the

More information

The stability of limit cycles in nonlinear systems

The stability of limit cycles in nonlinear systems Nonlinear Dyn 009) 56: 69 75 DOI 10.1007/s11071-008-9398-3 O R I G I NA L PA P E R The stability of limit cycles in nonlinear systems Ali Ghaffari Masayoshi Tomizuka Reza A. Soltan Received: 1 March 007

More information

4 Second-Order Systems

4 Second-Order Systems 4 Second-Order Systems Second-order autonomous systems occupy an important place in the study of nonlinear systems because solution trajectories can be represented in the plane. This allows for easy visualization

More information

Linear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems

Linear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems Linear ODEs p. 1 Linear ODEs Existence of solutions to linear IVPs Resolvent matrix Autonomous linear systems Linear ODEs Definition (Linear ODE) A linear ODE is a differential equation taking the form

More information

Numerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective

Numerical Solution of Ordinary Differential Equations in Fluctuationlessness Theorem Perspective Numerical Solution o Ordinary Dierential Equations in Fluctuationlessness Theorem Perspective NEJLA ALTAY Bahçeşehir University Faculty o Arts and Sciences Beşiktaş, İstanbul TÜRKİYE TURKEY METİN DEMİRALP

More information

EE363 homework 7 solutions

EE363 homework 7 solutions EE363 Prof. S. Boyd EE363 homework 7 solutions 1. Gain margin for a linear quadratic regulator. Let K be the optimal state feedback gain for the LQR problem with system ẋ = Ax + Bu, state cost matrix Q,

More information

( x) f = where P and Q are polynomials.

( x) f = where P and Q are polynomials. 9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational

More information

Flip-Flop Functions KEY

Flip-Flop Functions KEY For each rational unction, list the zeros o the polynomials in the numerator and denominator. Then, using a calculator, sketch the graph in a window o [-5.75, 6] by [-5, 5], and provide an end behavior

More information

B5.6 Nonlinear Systems

B5.6 Nonlinear Systems B5.6 Nonlinear Systems 5. Global Bifurcations, Homoclinic chaos, Melnikov s method Alain Goriely 2018 Mathematical Institute, University of Oxford Table of contents 1. Motivation 1.1 The problem 1.2 A

More information

Differential Equations Grinshpan Two-Dimensional Homogeneous Linear Systems with Constant Coefficients. Purely Imaginary Eigenvalues. Recall the equation mẍ+k = of a simple harmonic oscillator with frequency

More information

RATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions

RATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.

More information

Review sheet Final Exam Math 140 Calculus I Fall 2015 UMass Boston

Review sheet Final Exam Math 140 Calculus I Fall 2015 UMass Boston Review sheet Final Eam Math Calculus I Fall 5 UMass Boston The eam is closed tetbook NO CALCULATORS OR ELECTRONIC DEVICES ARE ALLOWED DURING THE EXAM The final eam will contain problems of types similar

More information

MCE693/793: Analysis and Control of Nonlinear Systems

MCE693/793: Analysis and Control of Nonlinear Systems MCE693/793: Analysis and Control of Nonlinear Systems Systems of Differential Equations Phase Plane Analysis Hanz Richter Mechanical Engineering Department Cleveland State University Systems of Nonlinear

More information

City Suburbs. : population distribution after m years

City Suburbs. : population distribution after m years Section 5.3 Diagonalization of Matrices Definition Example: stochastic matrix To City Suburbs From City Suburbs.85.03 = A.15.97 City.15.85 Suburbs.97.03 probability matrix of a sample person s residence

More information

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

Solutions to Dynamical Systems 2010 exam. Each question is worth 25 marks. Solutions to Dynamical Systems exam Each question is worth marks [Unseen] Consider the following st order differential equation: dy dt Xy yy 4 a Find and classify all the fixed points of Hence draw the

More information

1 y 2 dy = (2 + t)dt 1 y. = 2t + t2 2 + C 1 2t + t 2 /2 + C. 1 t 2 /2 + 2t 1. e y y = 2t 2. e y dy = 2t 2 dt. e y = 2 3 t3 + C. y = ln( 2 3 t3 + C).

1 y 2 dy = (2 + t)dt 1 y. = 2t + t2 2 + C 1 2t + t 2 /2 + C. 1 t 2 /2 + 2t 1. e y y = 2t 2. e y dy = 2t 2 dt. e y = 2 3 t3 + C. y = ln( 2 3 t3 + C). Math 53 First Midterm Page. Solve each of the following initial value problems. (a) y = y + ty, y() = 3. The equation is separable : y = y ( + t). Thus y = y dy = ( + t)dt y = t + t + C t + t / + C. For

More information

June 2011 PURDUE UNIVERSITY Study Guide for the Credit Exam in (MA 262) Linear Algebra and Differential Equations

June 2011 PURDUE UNIVERSITY Study Guide for the Credit Exam in (MA 262) Linear Algebra and Differential Equations June 20 PURDUE UNIVERSITY Study Guide for the Credit Exam in (MA 262) Linear Algebra and Differential Equations The topics covered in this exam can be found in An introduction to differential equations

More information

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Lecture No. #07 Jordan Canonical Form Cayley Hamilton Theorem (Refer Slide Time:

More information

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

NBA Lecture 1. Simplest bifurcations in n-dimensional ODEs. Yu.A. Kuznetsov (Utrecht University, NL) March 14, 2011 NBA Lecture 1 Simplest bifurcations in n-dimensional ODEs Yu.A. Kuznetsov (Utrecht University, NL) March 14, 2011 Contents 1. Solutions and orbits: equilibria cycles connecting orbits other invariant sets

More information

= 2e t e 2t + ( e 2t )e 3t = 2e t e t = e t. Math 20D Final Review

= 2e t e 2t + ( e 2t )e 3t = 2e t e t = e t. Math 20D Final Review Math D Final Review. Solve the differential equation in two ways, first using variation of parameters and then using undetermined coefficients: Corresponding homogenous equation: with characteristic equation

More information

Chapter III. Stability of Linear Systems

Chapter III. Stability of Linear Systems 1 Chapter III Stability of Linear Systems 1. Stability and state transition matrix 2. Time-varying (non-autonomous) systems 3. Time-invariant systems 1 STABILITY AND STATE TRANSITION MATRIX 2 In this chapter,

More information

Lyapunov Stability Theory

Lyapunov Stability Theory Lyapunov Stability Theory Peter Al Hokayem and Eduardo Gallestey March 16, 2015 1 Introduction In this lecture we consider the stability of equilibrium points of autonomous nonlinear systems, both in continuous

More information

Solution of Linear State-space Systems

Solution of Linear State-space Systems Solution of Linear State-space Systems Homogeneous (u=0) LTV systems first Theorem (Peano-Baker series) The unique solution to x(t) = (t, )x 0 where The matrix function is given by is called the state

More information

7 Planar systems of linear ODE

7 Planar systems of linear ODE 7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

More information

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues

More information

. This is the Basic Chain Rule. x dt y dt z dt Chain Rule in this context.

. This is the Basic Chain Rule. x dt y dt z dt Chain Rule in this context. Math 18.0A Gradients, Chain Rule, Implicit Dierentiation, igher Order Derivatives These notes ocus on our things: (a) the application o gradients to ind normal vectors to curves suraces; (b) the generaliation

More information

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems.

Understand the existence and uniqueness theorems and what they tell you about solutions to initial value problems. Review Outline To review for the final, look over the following outline and look at problems from the book and on the old exam s and exam reviews to find problems about each of the following topics.. Basics

More information

MTH 464: Computational Linear Algebra

MTH 464: Computational Linear Algebra MTH 464: Computational Linear Algebra Lecture Outlines Exam 4 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University April 15, 2018 Linear Algebra (MTH 464)

More information

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:

More information

EC744 Lecture Notes: Economic Dynamics. Prof. Jianjun Miao

EC744 Lecture Notes: Economic Dynamics. Prof. Jianjun Miao EC744 Lecture Notes: Economic Dynamics Prof. Jianjun Miao 1 Deterministic Dynamic System State vector x t 2 R n State transition function x t = g x 0 ; t; ; x 0 = x 0 ; parameter 2 R p A parametrized dynamic

More information

Matrix Solutions to Linear Systems of ODEs

Matrix Solutions to Linear Systems of ODEs Matrix Solutions to Linear Systems of ODEs James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 3, 216 Outline 1 Symmetric Systems of

More information

Linear Algebra. James Je Heon Kim

Linear Algebra. James Je Heon Kim Linear lgebra James Je Heon Kim (jjk9columbia.edu) If you are unfamiliar with linear or matrix algebra, you will nd that it is very di erent from basic algebra or calculus. For the duration of this session,

More information

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

Section 5.4 (Systems of Linear Differential Equation); 9.5 Eigenvalues and Eigenvectors, cont d Section 5.4 (Systems of Linear Differential Equation); 9.5 Eigenvalues and Eigenvectors, cont d July 6, 2009 Today s Session Today s Session A Summary of This Session: Today s Session A Summary of This

More information

INDEX. Bolzano-Weierstrass theorem, for sequences, boundary points, bounded functions, 142 bounded sets, 42 43

INDEX. Bolzano-Weierstrass theorem, for sequences, boundary points, bounded functions, 142 bounded sets, 42 43 INDEX Abel s identity, 131 Abel s test, 131 132 Abel s theorem, 463 464 absolute convergence, 113 114 implication of conditional convergence, 114 absolute value, 7 reverse triangle inequality, 9 triangle

More information

Def. (a, b) is a critical point of the autonomous system. 1 Proper node (stable or unstable) 2 Improper node (stable or unstable)

Def. (a, b) is a critical point of the autonomous system. 1 Proper node (stable or unstable) 2 Improper node (stable or unstable) Types of critical points Def. (a, b) is a critical point of the autonomous system Math 216 Differential Equations Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan November

More information

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann June 7, 04 The eigenvalues for a triangular

More information

Linear Algebra. Preliminary Lecture Notes

Linear Algebra. Preliminary Lecture Notes Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........

More information

Is the Hénon map chaotic

Is the Hénon map chaotic Is the Hénon map chaotic Zbigniew Galias Department of Electrical Engineering AGH University of Science and Technology, Poland, galias@agh.edu.pl International Workshop on Complex Networks and Applications

More information

ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 3 : SEMI-ITERATIVE METHODS

ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 3 : SEMI-ITERATIVE METHODS ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 3 : SEMI-ITERATIVE METHODS Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation

More information

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there

More information

Lyapunov-based control of quantum systems

Lyapunov-based control of quantum systems Lyapunov-based control of quantum systems Symeon Grivopoulos Bassam Bamieh Department of Mechanical and Environmental Engineering University of California, Santa Barbara, CA 936-57 symeon,bamieh@engineering.ucsb.edu

More information

ẋ = f(x, y), ẏ = g(x, y), (x, y) D, can only have periodic solutions if (f,g) changes sign in D or if (f,g)=0in D.

ẋ = f(x, y), ẏ = g(x, y), (x, y) D, can only have periodic solutions if (f,g) changes sign in D or if (f,g)=0in D. 4 Periodic Solutions We have shown that in the case of an autonomous equation the periodic solutions correspond with closed orbits in phase-space. Autonomous two-dimensional systems with phase-space R

More information

EC5555 Economics Masters Refresher Course in Mathematics September 2013

EC5555 Economics Masters Refresher Course in Mathematics September 2013 EC5555 Economics Masters Reresher Course in Mathematics September 3 Lecture 5 Unconstraine Optimization an Quaratic Forms Francesco Feri We consier the unconstraine optimization or the case o unctions

More information

Course 216: Ordinary Differential Equations

Course 216: Ordinary Differential Equations Course 16: Ordinary Differential Equations Notes by Chris Blair These notes cover the ODEs course given in 7-8 by Dr. John Stalker. Contents I Solving Linear ODEs 1 Reduction of Order Computing Matrix

More information

EE222: Solutions to Homework 2

EE222: Solutions to Homework 2 Spring 7 EE: Solutions to Homework 1. Draw the phase portrait of a reaction-diffusion sstem ẋ 1 = ( 1 )+ 1 (1 1 ) ẋ = ( 1 )+ (1 ). List the equilibria and their tpes. Does the sstem have limit ccles? (Hint:

More information

Congurations of periodic orbits for equations with delayed positive feedback

Congurations of periodic orbits for equations with delayed positive feedback Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics

More information

and let s calculate the image of some vectors under the transformation T.

and let s calculate the image of some vectors under the transformation T. Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =

More information

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II.

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II. Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II. Filip Piękniewski Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland Winter 2009/2010 Filip

More information

Math 256: Applied Differential Equations: Final Review

Math 256: Applied Differential Equations: Final Review Math 256: Applied Differential Equations: Final Review Chapter 1: Introduction, Sec 1.1, 1.2, 1.3 (a) Differential Equation, Mathematical Model (b) Direction (Slope) Field, Equilibrium Solution (c) Rate

More information

EN Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015

EN Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015 EN530.678 Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015 Prof: Marin Kobilarov 0.1 Model prerequisites Consider ẋ = f(t, x). We will make the following basic assumptions

More information

B5.6 Nonlinear Systems

B5.6 Nonlinear Systems B5.6 Nonlinear Systems 1. Linear systems Alain Goriely 2018 Mathematical Institute, University of Oxford Table of contents 1. Linear systems 1.1 Differential Equations 1.2 Linear flows 1.3 Linear maps

More information

Lyapunov stability ORDINARY DIFFERENTIAL EQUATIONS

Lyapunov stability ORDINARY DIFFERENTIAL EQUATIONS Lyapunov stability ORDINARY DIFFERENTIAL EQUATIONS An ordinary differential equation is a mathematical model of a continuous state continuous time system: X = < n state space f: < n! < n vector field (assigns

More information

Poincaré Map, Floquet Theory, and Stability of Periodic Orbits

Poincaré Map, Floquet Theory, and Stability of Periodic Orbits Poincaré Map, Floquet Theory, and Stability of Periodic Orbits CDS140A Lecturer: W.S. Koon Fall, 2006 1 Poincaré Maps Definition (Poincaré Map): Consider ẋ = f(x) with periodic solution x(t). Construct

More information

Ordinary Differential Equations (ODE)

Ordinary Differential Equations (ODE) ++++++++++ Ordinary Differential Equations (ODE) Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6 6 /

More information

Intermediate Differential Equations. Stability and Bifurcation II. John A. Burns

Intermediate Differential Equations. Stability and Bifurcation II. John A. Burns Intermediate Differential Equations Stability and Bifurcation II John A. Burns Center for Optimal Design And Control Interdisciplinary Center for Applied Mathematics Virginia Polytechnic Institute and

More information

State space transformations

State space transformations Capitolo 0. INTRODUCTION. State space transformations Let us consider the following linear time-invariant system: { ẋ(t) = A(t)+Bu(t) y(t) = C(t)+Du(t) () A state space transformation can be obtained using

More information

Modeling and Analysis of Dynamic Systems

Modeling and Analysis of Dynamic Systems Modeling and Analysis of Dynamic Systems Dr. Guillaume Ducard Fall 2017 Institute for Dynamic Systems and Control ETH Zurich, Switzerland G. Ducard c 1 / 54 Outline 1 G. Ducard c 2 / 54 Outline 1 G. Ducard

More information

Feedback Linearization

Feedback Linearization Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)

More information

Now I switch to nonlinear systems. In this chapter the main object of study will be

Now I switch to nonlinear systems. In this chapter the main object of study will be Chapter 4 Stability 4.1 Autonomous systems Now I switch to nonlinear systems. In this chapter the main object of study will be ẋ = f(x), x(t) X R k, f : X R k, (4.1) where f is supposed to be locally Lipschitz

More information