Ordinary Differential Equations I

Similar documents
Ordinary Differential Equations I

Ordinary Differential Equations I

Ordinary Differential Equations II

Ordinary Differential Equations II

Ordinary Differential Equations

ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations

Numerical Methods - Initial Value Problems for ODEs

Consistency and Convergence

. For each initial condition y(0) = y 0, there exists a. unique solution. In fact, given any point (x, y), there is a unique curve through this point,

Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems

Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems

APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS

Ordinary Differential Equations: Initial Value problems (IVP)

Solution Manual for: Numerical Computing with MATLAB by Cleve B. Moler

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

Math 23: Differential Equations (Winter 2017) Midterm Exam Solutions

Lecture 5: Single Step Methods

Ordinary Differential Equations

CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations

Ordinary differential equation II

Conjugate Gradients I: Setup

CS520: numerical ODEs (Ch.2)

5.2 - Euler s Method

NUMERICAL SOLUTION OF ODE IVPs. Overview

Final Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University

Math 128A Spring 2003 Week 12 Solutions

The family of Runge Kutta methods with two intermediate evaluations is defined by

Math 266: Ordinary Differential Equations

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9

Research Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations

Initial value problems for ordinary differential equations

Differential Equations

Ordinary Differential Equations

Scientific Computing: An Introductory Survey

Linear Multistep Methods I: Adams and BDF Methods

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.

Chapter 1: Introduction

Mathematical Models. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Spring Department of Mathematics

Part IB Numerical Analysis

Lecture 2. Classification of Differential Equations and Method of Integrating Factors

Mathematical Models. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics

First Order Linear Ordinary Differential Equations

Partial Differential Equations II

Introduction to Initial Value Problems

Initial value problems for ordinary differential equations

8.1 Introduction. Consider the initial value problem (IVP):

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

Numerical solution of ODEs

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of

Homogeneous Equations with Constant Coefficients

DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science

Ordinary differential equations - Initial value problems

A Brief Introduction to Numerical Methods for Differential Equations

Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs

Mathematics for chemical engineers. Numerical solution of ordinary differential equations

(A) Opening Problem Newton s Law of Cooling

MATH 353 LECTURE NOTES: WEEK 1 FIRST ORDER ODES

Optimization II: Unconstrained Multivariable

Solving Ordinary Differential equations

Numerical Solutions to Partial Differential Equations

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

Lecture 20/Lab 21: Systems of Nonlinear ODEs

Fourth Order RK-Method

Chapter 6 - Ordinary Differential Equations

MATH 200 WEEK 5 - WEDNESDAY DIRECTIONAL DERIVATIVE

FINAL EXAM MATH303 Theory of Ordinary Differential Equations. Spring dx dt = x + 3y dy dt = x y.

APPM 2360: Midterm exam 1 February 15, 2017

Lecture 19: Solving linear ODEs + separable techniques for nonlinear ODE s

Old Math 330 Exams. David M. McClendon. Department of Mathematics Ferris State University

Math 225 Differential Equations Notes Chapter 1

First Order Differential Equations Lecture 3

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i

Stability of Mass-Point Systems

Multistep Methods for IVPs. t 0 < t < T

Physics 584 Computational Methods

Ordinary Differential Equations

MecE 390 Final examination, Winter 2014

Problem Score Possible Points Total 150

Lecture 2. Introduction to Differential Equations. Roman Kitsela. October 1, Roman Kitsela Lecture 2 October 1, / 25

Solving Ordinary Differential Equations

DIFFERENTIAL EQUATIONS

Chapter 9b: Numerical Methods for Calculus and Differential Equations. Initial-Value Problems Euler Method Time-Step Independence MATLAB ODE Solvers

multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):

Introduction to standard and non-standard Numerical Methods

Chap. 20: Initial-Value Problems

The integrating factor method (Sect. 1.1)

APPM 2460 CHAOTIC DYNAMICS

MAT 275 Test 1 SOLUTIONS, FORM A

Math 322. Spring 2015 Review Problems for Midterm 2

Backward error analysis

Math Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take

US01CMTH02 UNIT-3. exists, then it is called the partial derivative of f with respect to y at (a, b) and is denoted by f. f(a, b + b) f(a, b) lim

Solutions for homework 1. 1 Introduction to Differential Equations

Math 307 A - Spring 2015 Final Exam June 10, 2015

Math 660 Lecture 4: FDM for evolutionary equations: ODE solvers

Modeling & Simulation 2018 Lecture 12. Simulations

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

CPS 5310: Parameter Estimation. Natasha Sharma, Ph.D.

Euler s Method, cont d

Ordinary Differential Equation Theory

Transcription:

Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 32

Theme of Last Few Weeks The unknown is an entire function f. CS 205A: Mathematical Methods Ordinary Differential Equations I 2 / 32

New Twist So far: f (or its derivative/integral) known at isolated points CS 205A: Mathematical Methods Ordinary Differential Equations I 3 / 32

New Twist So far: f (or its derivative/integral) known at isolated points Instead: Optimize properties of f CS 205A: Mathematical Methods Ordinary Differential Equations I 3 / 32

Example Problems Approximate f 0 with f but make it smoother (or sharper!) CS 205A: Mathematical Methods Ordinary Differential Equations I 4 / 32

Example Problems Approximate f 0 with f but make it smoother (or sharper!) Simulate some dynamical or physical relationship as f(t) where t is time CS 205A: Mathematical Methods Ordinary Differential Equations I 4 / 32

Example Problems Approximate f 0 with f but make it smoother (or sharper!) Simulate some dynamical or physical relationship as f(t) where t is time Approximate f 0 with f but transfer properties of g 0 CS 205A: Mathematical Methods Ordinary Differential Equations I 4 / 32

Today: Initial Value Problems Find f(t) : R R n Satisfying F [t, f(t), f (t), f (t),..., f (k) (t)] = 0 Given f(0), f (0), f (0),..., f (k 1) (0) CS 205A: Mathematical Methods Ordinary Differential Equations I 5 / 32

Today: Initial Value Problems Find f(t) : R R n Satisfying F [t, f(t), f (t), f (t),..., f (k) (t)] = 0 Given f(0), f (0), f (0),..., f (k 1) (0) Example of canonical form (on board): y = ty cos y CS 205A: Mathematical Methods Ordinary Differential Equations I 5 / 32

Most Famous Example F = m a Newton s second law CS 205A: Mathematical Methods Ordinary Differential Equations I 6 / 32

Most Famous Example F = m a Newton s second law F (t, x, x ) usual expression of force CS 205A: Mathematical Methods Ordinary Differential Equations I 6 / 32

Most Famous Example F = m a Newton s second law F (t, x, x ) usual expression of force n particles = simulation in R 3n CS 205A: Mathematical Methods Ordinary Differential Equations I 6 / 32

Protein Folding http://www.sciencedaily.com/releases/2012/11/121122152910.htm CS 205A: Mathematical Methods Ordinary Differential Equations I 7 / 32

Gradient Descent min x E( x) CS 205A: Mathematical Methods Ordinary Differential Equations I 8 / 32

Gradient Descent min x E( x) = x i+1 = x i h E( x i ) CS 205A: Mathematical Methods Ordinary Differential Equations I 8 / 32

Gradient Descent min x E( x) = x i+1 = x i h E( x i ) = h 0 d x dt = E( x) CS 205A: Mathematical Methods Ordinary Differential Equations I 8 / 32

Crowd Simulation http://video.wired.com/watch/building-a-better-zombie-wwz-exclusive http://gamma.cs.unc.edu/densecrowds/ CS 205A: Mathematical Methods Ordinary Differential Equations I 9 / 32

Examples of ODEs y = 1 + cos t: solved by integrating both sides CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 32

Examples of ODEs y = 1 + cos t: solved by integrating both sides y = ay: linear in y, no dependence on t CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 32

Examples of ODEs y = 1 + cos t: solved by integrating both sides y = ay: linear in y, no dependence on t y = ay + e t : time and value-dependent CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 32

Examples of ODEs y = 1 + cos t: solved by integrating both sides y = ay: linear in y, no dependence on t y = ay + e t : time and value-dependent y + 3y y = t: multiple derivatives of y CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 32

Examples of ODEs y = 1 + cos t: solved by integrating both sides y = ay: linear in y, no dependence on t y = ay + e t : time and value-dependent y + 3y y = t: multiple derivatives of y y sin y = e ty : nonlinear in y and t CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 32

Reasonable Assumption Explicit ODE An ODE is explicit if can be written in the form f (k) (t) = F [t, f(t), f (t), f (t),..., f (k 1) (t)]. CS 205A: Mathematical Methods Ordinary Differential Equations I 11 / 32

Reasonable Assumption Explicit ODE An ODE is explicit if can be written in the form f (k) (t) = F [t, f(t), f (t), f (t),..., f (k 1) (t)]. Otherwise need to do root-finding! CS 205A: Mathematical Methods Ordinary Differential Equations I 11 / 32

Reduction to First Order f (k) (t) = F [t, f(t), f (t), f (t),..., f (k 1) (t)] CS 205A: Mathematical Methods Ordinary Differential Equations I 12 / 32

Reduction to First Order f (k) (t) = F [t, f(t), f (t), f (t),..., f (k 1) (t)] d dt f 0 (t) f 1 (t). f k 2 (t) f k 1 (t) = f 1 (t) f 2 (t). f k 1 (t) F [t, f 0 (t), f 1 (t),..., f k 1 (t)] CS 205A: Mathematical Methods Ordinary Differential Equations I 12 / 32

Example y = 3y 2y + y CS 205A: Mathematical Methods Ordinary Differential Equations I 13 / 32

Example y = 3y 2y + y d dt y z w = 0 1 0 0 0 1 1 2 3 y z w CS 205A: Mathematical Methods Ordinary Differential Equations I 13 / 32

Time Dependence CS 205A: Mathematical Methods Ordinary Differential Equations I 14 / 32

Time Dependence Visualization: Slope field CS 205A: Mathematical Methods Ordinary Differential Equations I 14 / 32

Autonomous ODE y = F [ y] No dependence of F on t CS 205A: Mathematical Methods Ordinary Differential Equations I 15 / 32

Autonomous ODE y = F [ y] No dependence of F on t g (t) = ( f (t) ḡ (t) ) = ( F [f(t), ḡ(t)] 1 ) CS 205A: Mathematical Methods Ordinary Differential Equations I 15 / 32

Visualization: Phase Space θ = sin θ CS 205A: Mathematical Methods Ordinary Differential Equations I 16 / 32

Visualization: Traces x = σ(y x), y = x(ρ z) y, z = xy βz CS 205A: Mathematical Methods Ordinary Differential Equations I 17 / 32

Existence and Uniqueness dy dt = 2y t Two cases: y(0) = 0, y(0) 0 CS 205A: Mathematical Methods Ordinary Differential Equations I 18 / 32

Existence and Uniqueness Theorem: Local existence and uniqueness Suppose F is continuous and Lipschitz, that is, F [ y] F [ x] 2 L y x 2 for some fixed L 0. Then, the ODE f (t) = F [f(t)] admits exactly one solution for all t 0 regardless of initial conditions. CS 205A: Mathematical Methods Ordinary Differential Equations I 19 / 32

Linearization of 1D ODEs y = F [y] CS 205A: Mathematical Methods Ordinary Differential Equations I 20 / 32

Linearization of 1D ODEs y = F [y] y = ay + b CS 205A: Mathematical Methods Ordinary Differential Equations I 20 / 32

Linearization of 1D ODEs y = F [y] y = ay + b ȳ = aȳ CS 205A: Mathematical Methods Ordinary Differential Equations I 20 / 32

Model Equation y = ay CS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 32

Model Equation y = ay = y(t) = Ce at CS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 32

Stability: Visualization y = ay CS 205A: Mathematical Methods Ordinary Differential Equations I 22 / 32

Three Cases y = ay, y(t) = Ce at 1. a = 0: Stable CS 205A: Mathematical Methods Ordinary Differential Equations I 23 / 32

Three Cases y = ay, y(t) = Ce at 1. a = 0: Stable 2. a < 0: Stable; solutions get closer CS 205A: Mathematical Methods Ordinary Differential Equations I 23 / 32

Three Cases y = ay, y(t) = Ce at 1. a = 0: Stable 2. a < 0: Stable; solutions get closer 3. a > 0: Unstable; mistakes in initial data amplified CS 205A: Mathematical Methods Ordinary Differential Equations I 23 / 32

Intuition for Stability An unstable ODE magnifies mistakes in the initial conditions y(0). CS 205A: Mathematical Methods Ordinary Differential Equations I 24 / 32

Multidimensional Case y = A y, A y i = λ i y i y(0) = i c i y i CS 205A: Mathematical Methods Ordinary Differential Equations I 25 / 32

Multidimensional Case y = A y, A y i = λ i y i y(0) = i c i y i = y(t) = i c i e λ it y i CS 205A: Mathematical Methods Ordinary Differential Equations I 25 / 32

Multidimensional Case y = A y, A y i = λ i y i y(0) = i c i y i = y(t) = i c i e λ it y i Stability depends on max i λ i. CS 205A: Mathematical Methods Ordinary Differential Equations I 25 / 32

Integration Strategies Given y k at time t k, generate y k+1 assuming y = F [ y]. CS 205A: Mathematical Methods Ordinary Differential Equations I 26 / 32

Forward Euler y k+1 = y k + hf [ y k ] Explicit method O(h 2 ) localized truncation error O(h) global truncation error; first order accurate CS 205A: Mathematical Methods Ordinary Differential Equations I 27 / 32

Forward Euler: Stability CS 205A: Mathematical Methods Ordinary Differential Equations I 28 / 32

Model Equation y = ay y k+1 = (1 + ah)y k For a < 0, stable when h < 2 a. CS 205A: Mathematical Methods Ordinary Differential Equations I 29 / 32

Backward Euler y k+1 = y k + hf [ y k+1 ] Implicit method O(h 2 ) localized truncation error O(h) global truncation error; first order accurate CS 205A: Mathematical Methods Ordinary Differential Equations I 30 / 32

Forward Euler: Stability CS 205A: Mathematical Methods Ordinary Differential Equations I 31 / 32

Model Equation y = ay y k+1 = 1 1 ah y k Unconditionally stable! CS 205A: Mathematical Methods Ordinary Differential Equations I 32 / 32

Model Equation y = ay y k+1 = 1 1 ah y k Unconditionally stable! But this has nothing to do with accuracy. CS 205A: Mathematical Methods Ordinary Differential Equations I 32 / 32

Model Equation y = ay y k+1 = 1 1 ah y k Unconditionally stable! But this has nothing to do with accuracy. Good for stiff equations. CS 205A: Mathematical Methods Ordinary Differential Equations I 32 / 32

Forward and Backward Euler on Linear ODE y = A y Forward Euler: y k+1 = (I + ha) y k Backward Euler: y k+1 = (I ha) 1 y k Next CS 205A: Mathematical Methods Ordinary Differential Equations I 33 / 32