Love Dynamics, Love Triangles, & Chaos DONT TRY THIS AT HOME!

Slides:



Advertisements
Similar presentations
Finite Difference Discretization of Hyperbolic Equations: Linear Problems Lectures 8, 9 and 10.
Advertisements

Formal Computational Skills
Mathematical Models of Love & Happiness J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the Chaos and Complex Systems.
3- 1 Chapter 3 Introduction to Numerical Methods Second-order polynomial equation: analytical solution (closed-form solution): For many types of problems,
Differential Equations
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 9 Instructor: Tim Warburton.
H(s) x(t)y(t) 8.b Laplace Transform: Y(s)=X(s) H(s) The Laplace transform can be used in the solution of ordinary linear differential equations. Let’s.
section 6.2 Solving Recurrence Relations
SADNA – Ad Auction lecture #3 Time Series Yishay Mansour Mariano Schain.
Predator-Prey Dynamics for Rabbits, Trees, & Romance J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the Swiss Federal.
7.4 Predator–Prey Equations We will denote by x and y the populations of the prey and predator, respectively, at time t. In constructing a model of the.
Bifurcations & XPPAUT. Outline Why to study the phase space? Bifurcations / AUTO Morris-Lecar.
Ordinary Differential Equations
Lecture 17 Introduction to Eigenvalue Problems
1cs542g-term Notes. 2 Solving Nonlinear Systems  Most thoroughly explored in the context of optimization  For systems arising in implicit time.
Initial-Value Problems
Linearisation about point equilibrium n-dimensional autonomous a constant / point equilibrium solution of the dynamics a ‘neighbouring’ solution first-order.
Modern Control Systems1 Lecture 07 Analysis (III) -- Stability 7.1 Bounded-Input Bounded-Output (BIBO) Stability 7.2 Asymptotic Stability 7.3 Lyapunov.
Chapter 16 Integration of Ordinary Differential Equations.
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Explicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Continous system: differential equations Deterministic models derivatives instead of n(t+1)-n(t)
Autumn 2008 EEE8013 Revision lecture 1 Ordinary Differential Equations.
Romantic Relationships Background –Life would be very dull without the excitement (and sometimes pain) of romance! –Love affairs can be modelled by differential.
1 In this lecture we will compare two linearizing controller for a single-link robot: Linearization via Taylor Series Expansion Feedback Linearization.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
An Over View of Runge-Kutta Fehlberg and Dormand and Prince Methods. Numerical Methods To Solve Initial Value Problems William Mize.
Integration of 3-body encounter. Figure taken from
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo Performance & Stability Analysis.
Solving an elliptic PDE using finite differences Numerical Methods for PDEs Spring 2007 Jim E. Jones.
Lecture 16 - Approximation Methods CVEN 302 July 15, 2002.
ARO309 - Astronautics and Spacecraft Design
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Mathematical Models of Love & Happiness J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the UW-Madison Math Club in Madison,
Complex Zeros and the Fundamental Theorem of Algebra.
Mathematical Models of Love & Happiness J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the Kiwanis Club of Downtown.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 4 Chapter 15 General Least Squares and Non- Linear.
Introduction to Integration Methods. Types of Methods causal method employs values at prior computation instants. non-causal method if in addition to.
Chapter 5. Ordinary Differential Equation
Lecture 40 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Ordinary Differential Equations
Rational Zero Theorem Used to factor a cubic or quartic polynomial function with a leading coefficient not equal to 1.
Sec 232: The coefficient tableau 2ed order RK method Expand all f around (x,y) using Taylor expansion in 2d and then choose constants such that the equation.
Runge Kutta schemes Taylor series method Numeric solutions of ordinary differential equations.
Stability and instability in nonlinear dynamical systems
Chaotic systems and Chua’s Circuit
Ordinary Differential Equations
Mechanical Engineering at Virginia Tech
525602:Advanced Numerical Methods for ME
Predator-Prey Dynamics for Rabbits, Trees, & Romance
SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM (Term 101) Section 04 Read , 26-2, 27-1 CISE301_Topic8L4&5.
Class Notes 19: Numerical Methods (2/2)
CSE 245: Computer Aided Circuit Simulation and Verification
Chapter 27.
Sec:25.3 RUNGE-KUTTA METHODS.
Scientific Computing Partial Differential Equations Implicit Solution of Heat Equation.
Sec:5.4 RUNGE-KUTTA METHODS.
Numerical Analysis Lecture 37.
5.3 Higher-Order Taylor Methods
Numerical Analysis Lecture 38.
Numerical solution of first-order ordinary differential equations
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Overview Class #2 (Jan 16) Brief introduction to time-stepping ODEs
MATH 175: Numerical Analysis II
Ch5 Initial-Value Problems for ODE
Numerical Computation and Optimization
Implicit and Explicit Runge-Kutta methods
6th Lecture : Numerical Methods
Chapter 2 A Survey of Simple Methods and Tools
Numerical solution of first-order ordinary differential equations 1. First order Runge-Kutta method (Euler’s method) Let’s start with the Taylor series.
Presentation transcript:

Love Dynamics, Love Triangles, & Chaos DONT TRY THIS AT HOME!

Overview The Numerical Method: Runge-Kutta-Fehlberg Modeling Stability Simulations Special Solutions

Runge-Kutta-Fehlberg Assumption: f(t, y) is smooth enough IVP: y = f(t, y)a t b y(a) = y 0 Taylor Polynomial about t i y(t i+1 ) = y(t i ) + h y(t i ) +…+ h n /n! y (n) (t i ) + O(h n+i ) y = f(t, y), y = f(t, y),…, y (k) = f (k-1) (t, y)

Runge-Kutta-Fehlberg Then, y(t i+1 ) = y(t i ) + h f(t i, y(t i )) +… + h n /n! f (n-1) (t i, y(t i )) + O(h n+i ) OR y i+1 = y i + h f(t i, y i ) +… + h n /n! f (n-1) (t i, y i ) + O(h n+i )

Runge-Kutta-Fehlberg Taylors Method, Order 2 w 0 = y 0 w i+1 = w i + h f(t i, w i ) + h 2 /2 f(t i, w i ) Good: Truncation Error is O(h n ) Bad: Computation of Derivatives (complicated and time consuming)

Runge-Kutta-Fehlberg Runge Kutta Methods: Truncation Error is O(h n ) No Computation of Derivatives

Runge-Kutta-Fehlberg Illustration: Taylors Order 2 Needs (1) f(t, y) + h/2 f(t, y) = f(t, y) + h/2 [ f t (t, y) + f y (t, y) y] = f(t, y) + h/2 f t (t, y) + h/2 f y (t, y) f(t, y) Taylors (again!) c f(t+a, y+b) = c f(t,y) + a c f t (t,y) + b c f y (t,y) + c R(*)

Runge-Kutta-Fehlberg Matching Coefficients: c = 1 c a = h/2 c b = h/2 which gives c = 1 a = h/2 b = h/2 f(t, y)

Runge-Kutta-Fehlberg Then (1) can be written: f( t + h/2, y + h/2 f(t, y) ) RK Order 2: w 0 = y 0 k 1 = h f(t i, w i ) k 2 = h f(t i + h/2, w i + k 1 /2) w i+1 = w i + k 2

Runge-Kutta-Fehlberg RK Order 4: w 0 = y 0 k 1 = h f(t i, w i ) k 2 = h f(t i + h/2, w i + k 1 /2) k 3 = h f(t i + h/2, w i + k 2 /2) k 4 = h f(t i+1, w i + k 3 ) w i+1 = w i + 1/6 ( k k k 3 + k 4 )

Runge-Kutta-Fehlberg Further Improvement: Control the Error (predefined tolerance) Minimize the Number of Mesh Points

Runge-Kutta-Fehlberg Compute RK Order 4 approximation, w i+1 Compute RK Order 5 approximation, ŵ i+1 τ i+1 (q h) = q 4 /h (ŵ i+1 - w i+1 ) TOL Take q ( h TOL / | ŵ i+1 - w i+1 |) ¼ Result: ODE45 Command in MATLAB

Modeling Linear Systems: ů = A*u Solution: u(t) = u(0)exp(At) Predetermined No Chaos Well Documented Non-Linear Systems: ů = f(u, λ)

Stability Linear Re(λ) < 0 implies Asymptotic Stability Non-Linear Linearize Local Stability

Some Models R = aR + bJ J = cR + dJ Romantic Styles Eager Beaver: a > 0, b > 0 Narcissistic Nerd: a > 0, b < 0 Cautious Lover: a 0 Hermit: a < 0, b < 0

Some Models R = aR + bJ J = cR + dJ Simple Linear Model Out of Touch with Ones Own Feelings: a = d = 0 Fire and Ice: c = -b, d = -a Peas in a Pod: c = b, a = d

Some Models: Love Triangles R j = aR j + b(J-G) J = cR j + dJ R g = aR g + b(G-J) G = eR g + fG

Some Models: Nonlinear R = aR + bJ(1-|J|) J = cR(1-|R|) + dJ Simple Nonlinear Model Eager Beaver: c = d = 1 Hermit: a = b = -2

Some Models: Nonlinear Love Triangles R j = aR j + b(J - G)(1 - |J – G|) J = cR j (1 - |R j |)+ dJ R g = aR g + b(G - J )(1 - |G – J|) G = eR g (1 - |R g |)+ fG Love Triangle Nonlinear Model Cautious Lovers: a = -3, b = 4; e = 2, f = -1 Narcissistic Nerd: c = -7, d = 2

Special Solutions Chaos Nonlinear Unpredictable Non-stable Periodic Orbits Out of Touch: Nerd plus Lover Fire and Ice: Nerd plus Lover (|a| < |b|)

Special Solutions Strange Attractors – Nonlinear Love Triangle: Romeo: Lover Juliet: Nerd Guinevere: Lover

Stability (cont.) Hyperbolic Equilibrium Point: An equilibrium point is hyperbolic if the Jacobian has no eigenvalues with the real part equal to zero (stability is based on the real part)

Stability (cont.) Hartman-Grobman Theorem Let ů=A*u be the linearization of ů=f(u). If A is hyperbolic, then both systems are equivalent around the equilibrium point.