Ordinary Differential Equations I
|
|
|
- Osborn Nash
- 5 years ago
- Views:
Transcription
1 Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 35
2 Announcements Last Homework (HW7): Due Tuesday 6/6 (before midnight) NOTE: No late HW7 submissions accepted. Final Exam: Sat June 3:30-6:30pm in (Room: NVIDIA Auditorium) Covers all material emphasis on 2 nd half Two cheatsheets can reuse one from midterm Similar format to midterm OAE: Tentatively: 2:00pm start (pls confirm time) SCPD: Arrange similar time (or slightly later date) CS 205A: Mathematical Methods Ordinary Differential Equations I 2 / 35
3 Theme of Last Few Weeks The unknown is an entire function f. CS 205A: Mathematical Methods Ordinary Differential Equations I 3 / 35
4 New Twist So far: f (or its derivative/integral) known at isolated points CS 205A: Mathematical Methods Ordinary Differential Equations I 4 / 35
5 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 4 / 35
6 Example Problems Approximate f 0 with f but make it smoother (or sharper!) CS 205A: Mathematical Methods Ordinary Differential Equations I 5 / 35
7 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 5 / 35
8 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 5 / 35
9 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 6 / 35
10 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 6 / 35
11 Most Famous Example F = m a Newton s second law CS 205A: Mathematical Methods Ordinary Differential Equations I 7 / 35
12 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 7 / 35
13 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 7 / 35
14 Protein Folding CS 205A: Mathematical Methods Ordinary Differential Equations I 8 / 35
15 Gradient Descent min x E( x) CS 205A: Mathematical Methods Ordinary Differential Equations I 9 / 35
16 Gradient Descent min x E( x) = x i+1 = x i h E( x i ) CS 205A: Mathematical Methods Ordinary Differential Equations I 9 / 35
17 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 9 / 35
18 Crowd Simulation CS 205A: Mathematical Methods Ordinary Differential Equations I 10 / 35
19 Examples of ODEs y = 1 + cos t: solved by integrating both sides CS 205A: Mathematical Methods Ordinary Differential Equations I 11 / 35
20 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 11 / 35
21 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 11 / 35
22 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 11 / 35
23 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 11 / 35
24 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 12 / 35
25 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 12 / 35
26 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 13 / 35
27 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 13 / 35
28 Example y = 3y 2y + y CS 205A: Mathematical Methods Ordinary Differential Equations I 14 / 35
29 Example y = 3y 2y + y d dt y z w = y z w CS 205A: Mathematical Methods Ordinary Differential Equations I 14 / 35
30 Time Dependence CS 205A: Mathematical Methods Ordinary Differential Equations I 15 / 35
31 Time Dependence Visualization: Slope field CS 205A: Mathematical Methods Ordinary Differential Equations I 15 / 35
32 Autonomous ODE y = F [ y] No dependence of F on t CS 205A: Mathematical Methods Ordinary Differential Equations I 16 / 35
33 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 16 / 35
34 Visualization: Phase Space θ = sin θ CS 205A: Mathematical Methods Ordinary Differential Equations I 17 / 35
35 Visualization: Traces x = σ(y x), y = x(ρ z) y, z = xy βz CS 205A: Mathematical Methods Ordinary Differential Equations I 18 / 35
36 Existence and Uniqueness dy dt = 2y t Two cases: y(0) = 0, y(0) 0 CS 205A: Mathematical Methods Ordinary Differential Equations I 19 / 35
37 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 20 / 35
38 Linearization of 1D ODEs y = F [y] CS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 35
39 Linearization of 1D ODEs y = F [y] y = ay + b CS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 35
40 Linearization of 1D ODEs y = F [y] y = ay + b ȳ = aȳ CS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 35
41 Model Equation y = ay CS 205A: Mathematical Methods Ordinary Differential Equations I 22 / 35
42 Model Equation y = ay = y(t) = Ce at CS 205A: Mathematical Methods Ordinary Differential Equations I 22 / 35
43 Stability: Visualization y = ay CS 205A: Mathematical Methods Ordinary Differential Equations I 23 / 35
44 Three Cases y = ay, y(t) = Ce at 1. a = 0: Stable CS 205A: Mathematical Methods Ordinary Differential Equations I 24 / 35
45 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 24 / 35
46 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 24 / 35
47 Intuition for Stability An unstable ODE magnifies mistakes in the initial conditions y(0). CS 205A: Mathematical Methods Ordinary Differential Equations I 25 / 35
48 Multidimensional Case y = A y, A y i = λ i y i (where A = A ) y(0) = i c i y i CS 205A: Mathematical Methods Ordinary Differential Equations I 26 / 35
49 Multidimensional Case y = A y, A y i = λ i y i (where A = A ) y(0) = i c i y i = y(t) = i c i e λ it y i CS 205A: Mathematical Methods Ordinary Differential Equations I 26 / 35
50 Multidimensional Case y = A y, A y i = λ i y i (where A = A ) 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 26 / 35
51 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 27 / 35
52 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 28 / 35
53 Forward Euler: Stability CS 205A: Mathematical Methods Ordinary Differential Equations I 29 / 35
54 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 30 / 35
55 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 31 / 35
56 Backward Euler: Stability CS 205A: Mathematical Methods Ordinary Differential Equations I 32 / 35
57 Model Equation y = ay y k+1 = 1 1 ah y k Unconditionally stable! CS 205A: Mathematical Methods Ordinary Differential Equations I 33 / 35
58 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 33 / 35
59 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 33 / 35
60 Numerical Stiffness for IVP ODEs An IVP is said to be numerically stiff if stability requirements dictate a much smaller time step size than is needed to satisfy the approximation requirements alone. [Ascher & Petzold 1998] CS 205A: Mathematical Methods Ordinary Differential Equations I 34 / 35
61 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 35 / 35
Ordinary Differential Equations I
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
Ordinary Differential Equations I
Ordinary Differential Equations I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 27 Theme of Last Three
Ordinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 29 Almost Done! No
Ordinary Differential Equations II
Ordinary Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Ordinary Differential Equations II 1 / 33 Almost Done! Last
Ordinary Differential Equations
Chapter 13 Ordinary Differential Equations We motivated the problem of interpolation in Chapter 11 by transitioning from analzying to finding functions. That is, in problems like interpolation and regression,
ECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
Numerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
Linear Algebra Review
Linear Algebra Review CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Linear Algebra Review 1 / 16 Midterm Exam Tuesday Feb
Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Nonlinear Systems 1 / 27 Part III: Nonlinear Problems Not
Partial Differential Equations II
Partial Differential Equations II CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Partial Differential Equations II 1 / 28 Almost Done! Homework
Math 23: Differential Equations (Winter 2017) Midterm Exam Solutions
Math 3: Differential Equations (Winter 017) Midterm Exam Solutions 1. [0 points] or FALSE? You do not need to justify your answer. (a) [3 points] Critical points or equilibrium points for a first order
APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified
Nonlinearity Root-finding Bisection Fixed Point Iteration Newton s Method Secant Method Conclusion. Nonlinear Systems
Nonlinear Systems CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Nonlinear Systems 1 / 24 Part III: Nonlinear Problems Not all numerical problems
Homogeneous Equations with Constant Coefficients
Homogeneous Equations with Constant Coefficients MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 General Second Order ODE Second order ODEs have the form
Mathematical Models. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Spring Department of Mathematics
Mathematical Models MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 Ordinary Differential Equations The topic of ordinary differential equations (ODEs)
Mathematical Models. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics
Mathematical Models MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Ordinary Differential Equations The topic of ordinary differential equations (ODEs) is
2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
Optimization II: Unconstrained Multivariable
Optimization II: Unconstrained Multivariable CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Optimization II: Unconstrained
Consistency and Convergence
Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained
. 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,
1.2. Direction Fields: Graphical Representation of the ODE and its Solution Section Objective(s): Constructing Direction Fields. Interpreting Direction Fields. Definition 1.2.1. A first order ODE of the
Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs
Chapter 2: First Order DE 2.4 Linear vs. Nonlinear DEs First Order DE 2.4 Linear vs. Nonlinear DE We recall the general form of the First Oreder DEs (FODE): dy = f(t, y) (1) dt where f(t, y) is a function
Lecture 5: Single Step Methods
Lecture 5: Single Step Methods J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 1 October 2012 () Single Step Methods 1 October 2012 1 / 44 Outline 1
Norms, Sensitivity and Conditioning
Norms, Sensitivity and Conditioning CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Norms, Sensitivity and Conditioning 1
NUMERICAL SOLUTION OF ODE IVPs. Overview
NUMERICAL SOLUTION OF ODE IVPs 1 Quick review of direction fields Overview 2 A reminder about and 3 Important test: Is the ODE initial value problem? 4 Fundamental concepts: Euler s Method 5 Fundamental
Ordinary Differential Equations: Initial Value problems (IVP)
Chapter Ordinary Differential Equations: Initial Value problems (IVP) Many engineering applications can be modeled as differential equations (DE) In this book, our emphasis is about how to use computer
The family of Runge Kutta methods with two intermediate evaluations is defined by
AM 205: lecture 13 Last time: Numerical solution of ordinary differential equations Today: Additional ODE methods, boundary value problems Thursday s lecture will be given by Thomas Fai Assignment 3 will
Linear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
Ordinary Differential Equations
Ordinary Differential Equations Introduction: first order ODE We are given a function f(t,y) which describes a direction field in the (t,y) plane an initial point (t 0,y 0 ) We want to find a function
CS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
Lecture 2. Classification of Differential Equations and Method of Integrating Factors
Math 245 - Mathematics of Physics and Engineering I Lecture 2. Classification of Differential Equations and Method of Integrating Factors January 11, 2012 Konstantin Zuev (USC) Math 245, Lecture 2 January
Ordinary differential equation II
Ordinary Differential Equations ISC-5315 1 Ordinary differential equation II 1 Some Basic Methods 1.1 Backward Euler method (implicit method) The algorithm looks like this: y n = y n 1 + hf n (1) In contrast
Scientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
APPM 2360: Midterm exam 1 February 15, 2017
APPM 36: Midterm exam 1 February 15, 17 On the front of your Bluebook write: (1) your name, () your instructor s name, (3) your recitation section number and () a grading table. Text books, class notes,
Linear Systems and LU
Linear Systems and LU CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Linear Systems and LU 1 / 48 Homework 1. Homework 0:
Final Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University
Final Examination CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University The exam runs for 3 hours. The exam contains eight problems. You must complete the first
Solution Manual for: Numerical Computing with MATLAB by Cleve B. Moler
Solution Manual for: Numerical Computing with MATLAB by Cleve B. Moler John L. Weatherwax July 5, 007 Chapter 7 (Ordinary Differential Equations) Problem 7.1 Defining the vector y as y Then we have for
CS520: numerical ODEs (Ch.2)
.. CS520: numerical ODEs (Ch.2) Uri Ascher Department of Computer Science University of British Columbia ascher@cs.ubc.ca people.cs.ubc.ca/ ascher/520.html Uri Ascher (UBC) CPSC 520: ODEs (Ch. 2) Fall
Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
You may not use your books, notes; calculators are highly recommended.
Math 301 Winter 2013-14 Midterm 1 02/06/2014 Time Limit: 60 Minutes Name (Print): Instructor This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages are missing.
Practice Midterm 1 Solutions Written by Victoria Kala July 10, 2017
Practice Midterm 1 Solutions Written by Victoria Kala July 10, 2017 1. Use the slope field plotter link in Gauchospace to check your solution. 2. (a) Not linear because of the y 2 sin x term (b) Not linear
Math 128A Spring 2003 Week 12 Solutions
Math 128A Spring 2003 Week 12 Solutions Burden & Faires 5.9: 1b, 2b, 3, 5, 6, 7 Burden & Faires 5.10: 4, 5, 8 Burden & Faires 5.11: 1c, 2, 5, 6, 8 Burden & Faires 5.9. Higher-Order Equations and Systems
Lecture 2. Introduction to Differential Equations. Roman Kitsela. October 1, Roman Kitsela Lecture 2 October 1, / 25
Lecture 2 Introduction to Differential Equations Roman Kitsela October 1, 2018 Roman Kitsela Lecture 2 October 1, 2018 1 / 25 Quick announcements URL for the class website: http://www.math.ucsd.edu/~rkitsela/20d/
Initial value problems for ordinary differential equations
Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP
Solutions for homework 1. 1 Introduction to Differential Equations
Solutions for homework 1 1 Introduction to Differential Equations 1.1 Differential Equation Models The phrase y is proportional to x implies that y is related to x via the equation y = kx, where k is a
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
Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.
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.
Entrance Exam, Differential Equations April, 7 (Solve exactly 6 out of the 8 problems). Consider the following initial value problem: { y + y + y cos(x y) =, y() = y. Find all the values y such that the
Initial value problems for ordinary differential equations
AMSC/CMSC 660 Scientific Computing I Fall 2008 UNIT 5: Numerical Solution of Ordinary Differential Equations Part 1 Dianne P. O Leary c 2008 The Plan Initial value problems (ivps) for ordinary differential
First Order Linear Ordinary Differential Equations
First Order Linear Ordinary Differential Equations The most general first order linear ODE is an equation of the form p t dy dt q t y t f t. 1 Herepqarecalledcoefficients f is referred to as the forcing
Numerical solution of ODEs
Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation
Part IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
Chapter 6 - Ordinary Differential Equations
Chapter 6 - Ordinary Differential Equations 7.1 Solving Initial-Value Problems In this chapter, we will be interested in the solution of ordinary differential equations. Ordinary differential equations
Math 307 A - Spring 2015 Final Exam June 10, 2015
Name: Math 307 A - Spring 2015 Final Exam June 10, 2015 Student ID Number: There are 8 pages of questions. In addition, the last page is the basic Laplace transform table. Make sure your exam contains
Conjugate Gradients I: Setup
Conjugate Gradients I: Setup CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Justin Solomon CS 205A: Mathematical Methods Conjugate Gradients I: Setup 1 / 22 Time for Gaussian Elimination
Announce Statistical Motivation Properties Spectral Theorem Other ODE Theory Spectral Embedding. Eigenproblems I
Eigenproblems I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Eigenproblems I 1 / 33 Announcements Homework 1: Due tonight
Math 225 Differential Equations Notes Chapter 1
Math 225 Differential Equations Notes Chapter 1 Michael Muscedere September 9, 2004 1 Introduction 1.1 Background In science and engineering models are used to describe physical phenomena. Often these
Introduction to Initial Value Problems
Chapter 2 Introduction to Initial Value Problems The purpose of this chapter is to study the simplest numerical methods for approximating the solution to a first order initial value problem (IVP). Because
dy dt = 1 y t 1 +t 2 y dy = 1 +t 2 dt 1 2 y2 = 1 2 ln(1 +t2 ) +C, y = ln(1 +t 2 ) + 9.
Math 307A, Winter 2014 Midterm 1 Solutions Page 1 of 8 1. (10 points Solve the following initial value problem explicitly. Your answer should be a function in the form y = g(t, where there is no undetermined
Announce Statistical Motivation ODE Theory Spectral Embedding Properties Spectral Theorem Other. Eigenproblems I
Eigenproblems I CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James (and Justin Solomon) CS 205A: Mathematical Methods Eigenproblems I 1 / 33 Announcements Homework 1: Due tonight
multistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):
MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem
Course Information Course Overview Study Skills Background Material. Introduction. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics
Introduction CS 205A: Mathematical Methods for Robotics, Vision, and Graphics Doug James CS 205A: Mathematical Methods Introduction 1 / 16 Instructor Prof. Doug James Office: Gates 363 Telephone: (650)
5.2 - Euler s Method
5. - Euler s Method Consider solving the initial-value problem for ordinary differential equation: (*) y t f t, y, a t b, y a. Let y t be the unique solution of the initial-value problem. In the previous
8.1 Introduction. Consider the initial value problem (IVP):
8.1 Introduction Consider the initial value problem (IVP): y dy dt = f(t, y), y(t 0)=y 0, t 0 t T. Geometrically: solutions are a one parameter family of curves y = y(t) in(t, y)-plane. Assume solution
Lecture 19: Solving linear ODEs + separable techniques for nonlinear ODE s
Lecture 19: Solving linear ODEs + separable techniques for nonlinear ODE s Geoffrey Cowles Department of Fisheries Oceanography School for Marine Science and Technology University of Massachusetts-Dartmouth
Section 2.2 Solutions to Separable Equations
Section. Solutions to Separable Equations Key Terms: Separable DE Eponential Equation General Solution Half-life Newton s Law of Cooling Implicit Solution (The epression has independent and dependent variables
The integrating factor method (Sect. 1.1)
The integrating factor method (Sect. 1.1) Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Overview
Linear Independence and the Wronskian
Linear Independence and the Wronskian MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 Operator Notation Let functions p(t) and q(t) be continuous functions
APPM 2460 CHAOTIC DYNAMICS
APPM 2460 CHAOTIC DYNAMICS 1. Introduction Today we ll continue our exploration of dynamical systems, focusing in particular upon systems who exhibit a type of strange behavior known as chaos. We will
Agenda Sections 2.4, 2.5
Agenda Sections 2.4, 2.5 Reminders Read 3.1, 3.2 Do problems for 2.4, 2.5 Homework 1 due Friday Midterm Exam I on 1/23 Lab on Friday (Shapiro 2054) Office hours Tues, Thurs 3-4:30 pm (5852 East Hall) Theorem:
Math 266: Ordinary Differential Equations
Math 266: Ordinary Differential Equations Long Jin Purdue University, Spring 2018 Basic information Lectures: MWF 8:30-9:20(111)/9:30-10:20(121), UNIV 103 Instructor: Long Jin (long249@purdue.edu) Office
We begin exploring Euler s method by looking at direction fields. Consider the direction field below.
Emma Reid- MA 66, Lesson 9 (SU 17) Euler s Method (.7) So far in this course, we have seen some very special types of first order ODEs. We ve seen methods to solve linear, separable, homogeneous, Bernoulli,
Research Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations
Research Computing with Python, Lecture 7, Numerical Integration and Solving Ordinary Differential Equations Ramses van Zon SciNet HPC Consortium November 25, 2014 Ramses van Zon (SciNet HPC Consortium)Research
Differential Equations
Differential Equations Overview of differential equation! Initial value problem! Explicit numeric methods! Implicit numeric methods! Modular implementation Physics-based simulation An algorithm that
Ordinary Differential Equations
Chapter 7 Ordinary Differential Equations Differential equations are an extremely important tool in various science and engineering disciplines. Laws of nature are most often expressed as different equations.
Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit V Solution of
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 1 Dianne P. O Leary c 2008 1 The
Multistep Methods for IVPs. t 0 < t < T
Multistep Methods for IVPs We are still considering the IVP dy dt = f(t,y) t 0 < t < T y(t 0 ) = y 0 So far we have looked at Euler s method, which was a first order method and Runge Kutta (RK) methods
A Brief Introduction to Numerical Methods for Differential Equations
A Brief Introduction to Numerical Methods for Differential Equations January 10, 2011 This tutorial introduces some basic numerical computation techniques that are useful for the simulation and analysis
µ = e R p(t)dt where C is an arbitrary constant. In the presence of an initial value condition
MATH 3860 REVIEW FOR FINAL EXAM The final exam will be comprehensive. It will cover materials from the following sections: 1.1-1.3; 2.1-2.2;2.4-2.6;3.1-3.7; 4.1-4.3;6.1-6.6; 7.1; 7.4-7.6; 7.8. The following
DON T PANIC! If you get stuck, take a deep breath and go on to the next question. Come back to the question you left if you have time at the end.
Math 307A, Midterm 1 Spring 2013 Name: Instructions. DON T PANIC! If you get stuck, take a deep breath and go on to the next question. Come back to the question you left if you have time at the end. There
MecE 390 Final examination, Winter 2014
MecE 390 Final examination, Winter 2014 Directions: (i) a double-sided 8.5 11 formula sheet is permitted, (ii) no calculators are permitted, (iii) the exam is 80 minutes in duration; please turn your paper
Old Math 330 Exams. David M. McClendon. Department of Mathematics Ferris State University
Old Math 330 Exams David M. McClendon Department of Mathematics Ferris State University Last updated to include exams from Fall 07 Contents Contents General information about these exams 3 Exams from Fall
Physics 584 Computational Methods
Physics 584 Computational Methods Introduction to Matlab and Numerical Solutions to Ordinary Differential Equations Ryan Ogliore April 18 th, 2016 Lecture Outline Introduction to Matlab Numerical Solutions
Ordinary Differential Equations
Ordinary Differential Equations (MA102 Mathematics II) Shyamashree Upadhyay IIT Guwahati Shyamashree Upadhyay ( IIT Guwahati ) Ordinary Differential Equations 1 / 1 Books Shyamashree Upadhyay ( IIT Guwahati
Chapter 1: Introduction
Chapter 1: Introduction Definition: A differential equation is an equation involving the derivative of a function. If the function depends on a single variable, then only ordinary derivatives appear and
Math Week 1 notes
Math 2250-004 Week 1 notes We will not necessarily finish the material from a given day's notes on that day. Or on an amazing day we may get farther than I've predicted. We may also add or subtract some
MATH 353 LECTURE NOTES: WEEK 1 FIRST ORDER ODES
MATH 353 LECTURE NOTES: WEEK 1 FIRST ORDER ODES J. WONG (FALL 2017) What did we cover this week? Basic definitions: DEs, linear operators, homogeneous (linear) ODEs. Solution techniques for some classes
2.1 Differential Equations and Solutions. Blerina Xhabli
2.1 Math 3331 Differential Equations 2.1 Differential Equations and Solutions Blerina Xhabli Department of Mathematics, University of Houston blerina@math.uh.edu math.uh.edu/ blerina/teaching.html Blerina
LECTURE 4-1 INTRODUCTION TO ORDINARY DIFFERENTIAL EQUATIONS
130 LECTURE 4-1 INTRODUCTION TO ORDINARY DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS: A differential equation (DE) is an equation involving an unknown function and one or more of its derivatives. A differential
Ordinary Differential Equations
Ordinary Differential Equations We call Ordinary Differential Equation (ODE) of nth order in the variable x, a relation of the kind: where L is an operator. If it is a linear operator, we call the equation
Ordinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
1 Linear Regression and Correlation
Math 10B with Professor Stankova Worksheet, Discussion #27; Tuesday, 5/1/2018 GSI name: Roy Zhao 1 Linear Regression and Correlation 1.1 Concepts 1. Often when given data points, we want to find the line
Math 322. Spring 2015 Review Problems for Midterm 2
Linear Algebra: Topic: Linear Independence of vectors. Question. Math 3. Spring Review Problems for Midterm Explain why if A is not square, then either the row vectors or the column vectors of A are linearly
Fourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
The Plan. Initial value problems (ivps) for ordinary differential equations (odes) Review of basic methods You are here: Hamiltonian systems
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 2 Dianne P. O Leary c 2008 The Plan
Review for the First Midterm Exam
Review for the First Midterm Exam Thomas Morrell 5 pm, Sunday, 4 April 9 B9 Van Vleck Hall For the purpose of creating questions for this review session, I did not make an effort to make any of the numbers
FINAL EXAM MATH303 Theory of Ordinary Differential Equations. Spring dx dt = x + 3y dy dt = x y.
FINAL EXAM MATH0 Theory of Ordinary Differential Equations There are 5 problems on 2 pages. Spring 2009. 25 points Consider the linear plane autonomous system x + y x y. Find a fundamental matrix of the
Butcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients
AM 205: lecture 13 Last time: ODE convergence and stability, Runge Kutta methods Today: the Butcher tableau, multi-step methods, boundary value problems Butcher tableau Can summarize an s + 1 stage Runge
Numerical methods for solving ODEs
Chapter 2 Numerical methods for solving ODEs We will study two methods for finding approximate solutions of ODEs. Such methods may be used for (at least) two reasons the ODE does not have an exact solution
Introduction to standard and non-standard Numerical Methods
Introduction to standard and non-standard Numerical Methods Dr. Mountaga LAM AMS : African Mathematic School 2018 May 23, 2018 One-step methods Runge-Kutta Methods Nonstandard Finite Difference Scheme
Math 308 Exam I Practice Problems
Math 308 Exam I Practice Problems This review should not be used as your sole source of preparation for the exam. You should also re-work all examples given in lecture and all suggested homework problems..
MIDTERM REVIEW AND SAMPLE EXAM. Contents
MIDTERM REVIEW AND SAMPLE EXAM Abstract These notes outline the material for the upcoming exam Note that the review is divided into the two main topics we have covered thus far, namely, ordinary differential