Numerical Methods for Partial Differential Equations. CAAM 452 Spring 2005 Lecture 2 Instructor: Tim Warburton
|
|
- Margaret Lambert
- 6 years ago
- Views:
Transcription
1 Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 2 Instructor: Tim Warburton
2 Note on textbook for finite difference methods Due to the difficulty some students have experienced in obtaining Gustafasson-Kreiss-Oliger I will try to find appropriate and equivalent sections in the online finitedifference book by Trefethen:
3 Recall Last Lecture We considered the model advection PDE: u t u c = x defined on the periodic interval [0,2pi) We recalled that any 2pi periodic, C 1 function could be represented as a uniformly convergent Fourier series, so we considered the evolution of the PDE with a single Fourier mode as initial condition. This converted the above PDE into a simpler ODE for the time-dependent coefficient (i.e. amplitude) of a Fourier mode: duˆ 0 i ω cu ˆ = 0
4 Recall: the Advection Equation We wills start with a specific Fourier mode as the initial condition: [ π ) [ ] 1) Find 2π -periodic u x, t such that x 0,2, t 0, T u u c = t x given 0 1 u( x,0) = f x = e fˆ x 0,2 2π iω x ( ω) [ π ) where f is a smooth 2π -periodic function of one frequency ω We try to find a solution of the same type: 1 u x t e u t 2π iω x (, ) = ˆ ( ω, )
5 cont Substituting in this type of solution the PDE: u u c = 0 t x Becomes an ODE: u u 1 ˆ (, ) 1 iω x iω x du c = c e u ω t e ˆ iωcu = ˆ t x t x 2π 2π duˆ i ω cu ˆ = 0 With initial condition û ˆ ( ω,0) = f ( ω)
6 cont We have Fourier transformed the PDE into an ODE. We can solve the ODE: duˆ i ω cu ˆ = 0 uˆ t = e u = e fˆ uˆ ( ω,0) = fˆ ( ω) And it follows that the PDE solution is: iωct iωct ( ω, ) ˆ ( ω,0) ( ω) 1 iω x ansatz : u( x, t) = e uˆ ( ω, t) 2π iωct 1 solution : ˆ (, ) ˆ iω x+ ct u ω t = e f ( ω) u( x, t) = e fˆ ω = f x + ct 2π 1 iω x initial condition: f ( x) = e fˆ ( ω) 2π
7 Note on Fourier Modes Note that since the function should be 2pi periodic we are able to deduce: ω We can also use the superposition principle for the more general case when the initial condition contains multiple Fourier modes: ω= 1 f x e fˆ 2π iω x = ( ω) (, ) ω= ω= 1 iω( x+ ct ) ˆ ( ω) u x t = e f = f x + t 2π ω=
8 cont Let s back up a minute the crucial part was when we reduced the PDE to an ODE: u u duˆ c = 0 i ω cu ˆ = 0 t x The advantage is: we know how to solve ODE s both analytically and numerically (more about this later on).
9 Add Diffusion Back In So we have a good handle on the advection equation, let s reintroduce the diffusion term: c = d t x x 2 u u u Again, let s assume 2-pi periodicity and assume the same ansatz: 2 This time: 1 iω x u = e uˆ t 2π ( ω, ) c = d t x x 2 u u u 2 du ˆ i cu d 2 u duˆ ω ˆ = ω ˆ ( 2 = icω dω ) uˆ
10 cont Again, we can solve this trivial ODE: duˆ ( 2 ω ω ) = i c d uˆ ( 2 ω,0 ) ic d t uˆ = uˆ e ω ω ( ω,0) 2 ( + ) ω ω u = uˆ e e i ct x d t
11 cont The solution tells a story: 2 ( + ) ω ω u = uˆ ω,0 e e i ct x d t d t u = f ct + x e ω The original profile travels in the direction of decreasing x (first term) 2 As the profile travels it decreases in amplitude (second exponential term)
12 What Did Diffusion Do?? Advection: u t u c = x 0 duˆ i ω cu ˆ = 0 Diffusion: c = d t x x 2 u u u 2 duˆ ( 2 ω ω ) = i c d uˆ Adding the diffusion term shifted the multiplier on the right hand side of the Fourier transformed PDE (i.e. the ODE) into the left half plane. We summarize the role of the multiplier
13 Categorizing a Linear ODE duˆ ( 0) = µ uˆ uˆ = uˆ e µ t Exponential decay Increasingly oscillatory Im ( µ ) Exponential growth Re ( µ ) Increasingly oscillatory Here we plot the dependence of the solution to the top left ODE on mu s position in the complex plane
14 Categorizing a Linear ODE Im ( µ ) Re ( µ ) Here we plot the behavior of the solution for 5 different choices of mu
15 Summary duˆ µ t Re( µ ) t = µ uˆ uˆ = uˆ ( 0) e = uˆ ( 0) e ( cos( Im( µ ) t) + isin ( Im( µ ) t) ) When the real part of mu is negative the solution decays exponentially fast in time (rate determined by the magnitude of the real part of mu). When the real part of mu is positive the solution grows exponentially fast in time (rate determined by the magnitude of the real part of mu). If the imaginary part of mu is non-zero the solution oscillates in time. The larger the imaginary part of mu is, the faster the solution oscillates in time.
16 Solving the Scalar ODE Numerically We know the solution to the scalar ODE duˆ = µ uˆ However, it is also reasonable to ask if we can solve it approximately. We have now simplified as far as possible. Once we can solve this model problem numerically, we will apply this technique using the method of lines to approximate the solution of the PDE.
17 Stage 1: Discretizing the Time Axis du = f u It is natural to divide the time interval [0,T] into shorted subintervals, with wih often referred to as:, t or k We start with the initial value of the solution u(0) (and possibly u(-),u(-2),..) and build a recurrence relation which approximates u() in terms of u(0) and early values of u.
18 Example Using the following approximation to the time derivative: du u t + u t We write down an approximation to the ODE: du = f u u u 0 f u 0 ( )
19 Example cont Rearranging: u u 0 f ( u( 0) ) We introduce notation for the approximate solution after the n th time step: Our intention is to compute u u 0 + f u 0 We convert the above equation into a scheme to compute an approximate solution: u 0 = u u n 0 un u = u + f u u n
20 Example cont We can repeat the following step from t= to t=2 and so on: u 0 = u 0 u = u + f u u = u + f u u = u + f u n+ 1 n n This is commonly known as the: Euler-forward time-stepping method or Euler s method
21 Euler-Forward Time Stepping It is natural to ask the following questions about this time-stepping method: u 0 n+ 1 n n Does the answer get better if is reduced? (i.e. we take more timesteps between t=0 and t=t) Does the numerical solution behave in the same way as the exact solution for general f? (for the case of f(u) = mu*u does the numerical solution decay and/or oscillate as the exact solution) How close to the exact solution is the numerical solution? = u As we decrease does the end iterate converge to the solution at t=t 0 u = u + f u
22 Experiments Before we try this analytically, we can code it up and see what happens. This is some matlab code for Euler forward applied to: u 0 = u 0 u = u + µ u n+ 1 n n
23 What can we use? With =0.1, T=3, uo=1, mu=-1-2*i Matlab The error is quite small.
24 Larger =0.5 With =0.5, T=3, uo=1, mu=-1-2*i The error is visible but the trend is not wildly wrong.
25 Even Larger =1 With =1, T=3, uo=1, mu=-1-2*i The solution is not remotely correct but is at least bounded.
26 =2 With T=30, =2, uo=1, mu=-1-i Boom the approximate solution grows exponentially fast, while the true solution decays!
27 Observations When is small enough we are able to nicely approximate the solution with this simple scheme. As grew the solution became less accurate When =1 we saw that the approximate solution did not resemble the true solution, but was at least bounded. When =2 we saw the approximate solution grew exponentially fast in time.
28 cont Our observations indicate two qualities of time stepping we should be interested in: stability: i.e. is the solution bounded in a similar way to the actual solution? accuracy: can we choose small enough for the error to be below some threshold?
29 Geometric Interpretation: u 0 = u ( 0) u = u + f u n+ 1 n n We can interpret Euler-forward as a shooting method. We suppose that u n is the actual solution, compute the actual slope f ( u n ) and shift the approximate solution by f u n Note: u n t n u n + 1 t n + 1 f ( u n ) the blue line is not the exact solution, but rather the same ODE started from the last approximate value of u computed. in this case we badly estimated the behavior of even the approximately started solution in the interval two kinds of error can accumulate!.
30 Interpolation Interpretation: u 0 = u ( 0) u = u + f u n+ 1 n n We start with the ODE: du = f u Integrate both sides from over a interval: tn+ 1 tn+ 1 du = f ( u ) tn tn Use the fundamental theorem of calculus: t n+ 1 t n du [ ] t u n+ 1 = = t u n+ 1 u n Finally, replace f with a constant which interpolates f at the beginning of the interval n
31 cont t n+ 1 t n du = u = t u t n+ 1 u t n tn+ 1 [ ] t t t n+ 1 n+ 1 n+ 1 ( ) ( ) ( ) n n n t t t n n n n+ 1 n n n f u t f u t = f u t = f u t u t u t f u t Again, we have recovered Euler s method.
32 Stability Let s choose f(u) = mu*u u = u 0 0 u = u + µ u = 1+ µ u We can solve this immediately: u = u 0 0 n+ 1 n+ 1 n n n n u = 1+ µ u = 1+ µ + u 0 n Next suppose Re(mu)<=0 then we expect the actual solution to be bounded in time by u(0). For this to be true of the approximate solution we require: 1+ µ 1 1
33 Stability Condition for Euler Forward Since mu is fixed we are left with a condition which must be met by 1+ µ 1 which is true if and only if: 1+ Re µ 2 + Im µ 2 1 ( ) The region of the complex plane which satisfies this condition is the interior of the unit circle centered at Im -1+0*i x Re
34 cont i.e. µ will not blow up if it is located inside the unit disk: Im x -1+0i Re Notice: the exact solutions corresponding to Re(mu)<0 all decay. However, only the numerical solutions corresponding to the interior of the yellow circle decay.
35 Disaster for Advection!!! Now we should be worried. The stability region: Im x -1+0i Re only includes one point on the imaginary axis (the origin) but our advection equation for the periodic interval has mu which are purely imaginary!!!. du ˆ i ω cu ˆ = 0 µ = i ω c Conclusion the Euler-Forward scheme applied to the Fourier transform of the advection equation will generate exponentially growing solutions.
36 Nearly a Disaster for Advection-Diffusion!!! duˆ ( 2 ω ω ) = i c d uˆ This time the stability region must contain: ( 2 ) µ = iωc ω d Im x -1+0i Re Because the eigenvalues are shifted into the left half part of the complex plane, we will be able to choose small enough to force the mu* into the stability region. We can estimate how small has to be in this case
37 cont (estimate of for advection-diffusion) For stability we require: µ ( 2 iωc ω ) d ( 2 ω d ) ( ωc ) ( ω ) d d c 0 d + c 2d ω + ω + ω = 0 or ω = 0 or
38 cont The only interesting condition for stability is: 2d ω d + c What does this mean?, volunteer? ω, d, c i.e. how do influence the maximum stable? Hint: consider i) d small, c large ii) d large, c small
39 Multistep Scheme (AB2) Given the failure of Euler-Forward for our goal equation, we will consider using the solution from 2 previous time steps. i.e. we consider u = u + af u + bf u n+ 1 n n n 1 Recall the integral based interpretation of Euler- Forward: tn+ 1 u( t ) ( ) ( ) n+ 1 u tn = f u t f u tn t n
40 cont We interpolate through f(u n-1 )and f(u n ) then integrate between t n and t n+1 f Linear interpolant of the f values f(u n ) If n+1 f(u n-1 ) t n-1 t n t n+1 Approximate integral
41 cont This time we choose to integrate under the interpolant of f which agrees with f at t n and t n-1 The unique linear interpolant in this case is: t t t t I f = f u + f u n n 1 1 n n 1 tn t n 1 tn 1 t n We need to compute the following integral of the interpolant..: t n I f 1 t n
42 t n+ 1 n+ 1 t n t cont t t t t I f = f u + f u n n 1 1 n n 1 tn t t n 1 tn 1 t n n n tn+ 1 tn+ 1 f un f un 1 = ( t tn 1) ( t tn ) t t tn t f ( u ) f un t = t t tnt n 1 n 1 t 3 1 = f un f u 2 2 Last step: homework exercise n + 1 n+ 1 n 1 n t t n
43 Adams-Bashford 2 The resulting AB2 scheme requires the solution at two levels to compute the update: n+ 1 u = u + If n+ 1 n 1 t t n 3 1 = u + f u f u 2 2 n n n 1
44 Next Time Stability region for AB2 Generalization to AB3, AB4 (use more historical data to compute update) Accuracy/consistency of Euler-Forward, AB2,AB3,AB4 Convergence. Runge-Kutta schemes (if time permits) READING: p10-p55 (do not do exercises)
Numerical Methods for Partial Differential Equations. CAAM 452 Spring 2005 Lecture 3 AB2,AB3, Stability, Accuracy Instructor: Tim Warburton
Numerical Methods for Partial Differential Equations CAAM 452 Spring 25 Lecture 3 AB2,AB3, Stability, Accuracy Instructor: Tim Warburton Recall: Euler-Forward Time Stepping By several different approximations
More informationNumerical Methods for Partial Differential Equations CAAM 452. Spring 2005
Numerical Methods for Partial Differential Equations Instructor: Tim Warburton Class Location: Duncan Hall 1046 Class Time: 9:5am to 10:40am Office Hours: 10:45am to noon in DH 301 CAAM 45 Spring 005 Homeworks
More informationNumerical Methods for Partial Differential Equations
Numerical Methods for Partial Differential Equations CAAM 45 Spring 005 Lecture 15 Instructor: Tim Warburton Two-Dimensional Advection Recall in one-dimensions we chose an arbitrary section of a pipe.
More information25 Self-Assessment. 26 Eigenvalue Stability for a Linear ODE. Chapter 7 Eigenvalue Stability
Chapter 7 Eigenvalue Stability As we have seen, while numerical methods can be convergent, they can still exhibit instabilities as the number of timesteps n increases for finite t. For example, when applying
More informationEuler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability.
Euler s Method, Taylor Series Method, Runge Kutta Methods, Multi-Step Methods and Stability. REVIEW: We start with the differential equation dy(t) dt = f (t, y(t)) (1.1) y(0) = y 0 This equation can be
More informationWhat we ll do: Lecture 21. Ordinary Differential Equations (ODEs) Differential Equations. Ordinary Differential Equations
What we ll do: Lecture Ordinary Differential Equations J. Chaudhry Department of Mathematics and Statistics University of New Mexico Review ODEs Single Step Methods Euler s method (st order accurate) Runge-Kutta
More informationClass Meeting # 2: The Diffusion (aka Heat) Equation
MATH 8.52 COURSE NOTES - CLASS MEETING # 2 8.52 Introduction to PDEs, Fall 20 Professor: Jared Speck Class Meeting # 2: The Diffusion (aka Heat) Equation The heat equation for a function u(, x (.0.). Introduction
More informationLecture 21: Numerical Solution of Differential Equations
cs41: introduction to numerical analysis 11/30/10 Lecture 1: Numerical Solution of Differential Equations Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Introduction
More informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More informationMath 312 Lecture Notes Linear Two-dimensional Systems of Differential Equations
Math 2 Lecture Notes Linear Two-dimensional Systems of Differential Equations Warren Weckesser Department of Mathematics Colgate University February 2005 In these notes, we consider the linear system of
More informationREVIEW: The Matching Method Algorithm
Lecture 26: Numerov Algorithm for Solving the Time-Independent Schrödinger Equation 1 REVIEW: The Matching Method Algorithm Need for a more general method The shooting method for solving the time-independent
More informationExponential integrators and functions of the matrix exponential
Exponential integrators and functions of the matrix exponential Paul Matthews, Stephen Cox, Hala Ashi and Linda Cummings School of Mathematical Sciences, University of Nottingham, UK Introduction to exponential
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS NUMERICAL FLUID MECHANICS FALL 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS 02139 2.29 NUMERICAL FLUID MECHANICS FALL 2011 QUIZ 2 The goals of this quiz 2 are to: (i) ask some general
More informationPart 1. The simple harmonic oscillator and the wave equation
Part 1 The simple harmonic oscillator and the wave equation In the first part of the course we revisit the simple harmonic oscillator, previously discussed in di erential equations class. We use the discussion
More information8. Introduction and Chapter Objectives
Real Analog - Circuits Chapter 8: Second Order Circuits 8. Introduction and Chapter Objectives Second order systems are, by definition, systems whose input-output relationship is a second order differential
More informationMAE/MSE502 Partial Differential Equations in Engineering. Spring 2019 Mon/Wed 6:00-7:15 PM Classroom: CAVC 101
MAE/MSE502 Partial Differential Equations in Engineering Spring 2019 Mon/Wed 6:00-7:15 PM Classroom: CAVC 101 Instructor: Huei-Ping Huang, hp.huang@asu.edu Office: ERC 359 Office hours: Monday 3-4 PM,
More information2tdt 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
More informationFinite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations
Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO
More informationCalculus for the Life Sciences
Improved Calculus for the Life Sciences ntial Equations Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationNUMERICAL 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
More informationLecture 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
More informationFinite Difference and Finite Element Methods
Finite Difference and Finite Element Methods Georgy Gimel farb COMPSCI 369 Computational Science 1 / 39 1 Finite Differences Difference Equations 3 Finite Difference Methods: Euler FDMs 4 Finite Element
More informationMidterm 1 Review. Distance = (x 1 x 0 ) 2 + (y 1 y 0 ) 2.
Midterm 1 Review Comments about the midterm The midterm will consist of five questions and will test on material from the first seven lectures the material given below. No calculus either single variable
More informationDamped harmonic motion
Damped harmonic motion March 3, 016 Harmonic motion is studied in the presence of a damping force proportional to the velocity. The complex method is introduced, and the different cases of under-damping,
More informationMIT (Spring 2014)
18.311 MIT (Spring 014) Rodolfo R. Rosales May 6, 014. Problem Set # 08. Due: Last day of lectures. IMPORTANT: Turn in the regular and the special problems stapled in two SEPARATE packages. Print your
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
More informationOutline Calculus for the Life Sciences II. Pollution in a Lake 1. Introduction. Lecture Notes Numerical Methods for Differential Equations
Improved Improved Outline Calculus for the Life Sciences II tial Equations Joseph M. Mahaffy, mahaffy@math.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences
More informationPartial differential equations
Partial differential equations Many problems in science involve the evolution of quantities not only in time but also in space (this is the most common situation)! We will call partial differential equation
More informationA Fifth Order Flux Implicit WENO Method
A Fifth Order Flux Implicit WENO Method Sigal Gottlieb and Julia S. Mullen and Steven J. Ruuth April 3, 25 Keywords: implicit, weighted essentially non-oscillatory, time-discretizations. Abstract The weighted
More informationLab #2 - Two Degrees-of-Freedom Oscillator
Lab #2 - Two Degrees-of-Freedom Oscillator Last Updated: March 0, 2007 INTRODUCTION The system illustrated in Figure has two degrees-of-freedom. This means that two is the minimum number of coordinates
More informationLinearization of Differential Equation Models
Linearization of Differential Equation Models 1 Motivation We cannot solve most nonlinear models, so we often instead try to get an overall feel for the way the model behaves: we sometimes talk about looking
More informationAdvection / Hyperbolic PDEs. PHY 604: Computational Methods in Physics and Astrophysics II
Advection / Hyperbolic PDEs Notes In addition to the slides and code examples, my notes on PDEs with the finite-volume method are up online: https://github.com/open-astrophysics-bookshelf/numerical_exercises
More informationMITOCW watch?v=dztkqqy2jn4
MITOCW watch?v=dztkqqy2jn4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
More informationCS 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
More informationMAE502/MSE502 Partial Differential Equations in Engineering. Spring 2012 Mon/Wed 5:00-6:15 PM
MAE502/MSE502 Partial Differential Equations in Engineering Spring 2012 Mon/Wed 5:00-6:15 PM Instructor: Huei-Ping Huang, hp.huang@asu.edu (Huei rhymes with "way") Office: ERC 359 Office hours: Monday
More informationTime-Parallel Algorithms for Weather Prediction and Climate Simulation
Time-Parallel Algorithms for Weather Prediction and Climate Simulation Jean Côté Adjunct Prof. ESCER Centre (Étude et la Simulation du Climat à l Échelle Régionale) Sciences de la Terre & de l Atmosphère
More informationMatrix-Exponentials. September 7, dx dt = ax. x(t) = e at x(0)
Matrix-Exponentials September 7, 207 In [4]: using PyPlot INFO: Recompiling stale cache file /Users/stevenj/.julia/lib/v0.5/LaTeXStrings.ji for module LaTeXString Review: Solving ODEs via eigenvectors
More informationLinear Second-Order Differential Equations LINEAR SECOND-ORDER DIFFERENTIAL EQUATIONS
11.11 LINEAR SECOND-ORDER DIFFERENTIAL EQUATIONS A Spring with Friction: Damped Oscillations The differential equation, which we used to describe the motion of a spring, disregards friction. But there
More informationAnalysis III (BAUG) Assignment 3 Prof. Dr. Alessandro Sisto Due 13th October 2017
Analysis III (BAUG Assignment 3 Prof. Dr. Alessandro Sisto Due 13th October 2017 Question 1 et a 0,..., a n be constants. Consider the function. Show that a 0 = 1 0 φ(xdx. φ(x = a 0 + Since the integral
More informationIntroduction to First Order Equations Sections
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Introduction to First Order Equations Sections 2.1-2.3 Dr. John Ehrke Department of Mathematics Fall 2012 Course Goals The
More information10 Motivation for Fourier series
10 Motivation for Fourier series Donkeys and scholars in the middle! French soldiers, forming defensive squares in Egypt, during Napoleon s campaign The central topic of our course is the so-called Fourier
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
More informationScientific 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
More informationFinal Exam May 4, 2016
1 Math 425 / AMCS 525 Dr. DeTurck Final Exam May 4, 2016 You may use your book and notes on this exam. Show your work in the exam book. Work only the problems that correspond to the section that you prepared.
More information3.3. Phase and Amplitude Errors of 1-D Advection Equation
3.3. Phase and Amplitude Errors of 1-D Advection Equation Reading: Duran section 2.4.2. Tannehill et al section 4.1.2. The following example F.D. solutions of a 1D advection equation show errors in both
More informationRelevant self-assessment exercises: [LIST SELF-ASSESSMENT EXERCISES HERE]
Chapter 5 Fourier Analysis of Finite Difference Methods In this lecture, we determine the stability of PDE discretizations using Fourier analysis. First, we begin with Fourier analysis of PDE s, and then
More informationMITOCW watch?v=pqkyqu11eta
MITOCW watch?v=pqkyqu11eta The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
More informationSeparation of Variables
Separation of Variables A typical starting point to study differential equations is to guess solutions of a certain form. Since we will deal with linear PDEs, the superposition principle will allow us
More informationBasics Quantum Mechanics Prof. Ajoy Ghatak Department of physics Indian Institute of Technology, Delhi
Basics Quantum Mechanics Prof. Ajoy Ghatak Department of physics Indian Institute of Technology, Delhi Module No. # 03 Linear Harmonic Oscillator-1 Lecture No. # 04 Linear Harmonic Oscillator (Contd.)
More informationInitial 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
More informationWe will begin by first solving this equation on a rectangle in 2 dimensions with prescribed boundary data at each edge.
Page 1 Sunday, May 31, 2015 9:24 PM From our study of the 2-d and 3-d heat equation in thermal equlibrium another PDE which we will learn to solve. Namely Laplace's Equation we arrive at In 3-d In 2-d
More informationHomework 7 Solutions
Homework 7 Solutions # (Section.4: The following functions are defined on an interval of length. Sketch the even and odd etensions of each function over the interval [, ]. (a f( =, f ( Even etension of
More informationLecture 10: Powers of Matrices, Difference Equations
Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each
More informationThe 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
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationCS520: 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
More informationChaotic motion. Phys 420/580 Lecture 10
Chaotic motion Phys 420/580 Lecture 10 Finite-difference equations Finite difference equation approximates a differential equation as an iterative map (x n+1,v n+1 )=M[(x n,v n )] Evolution from time t
More informationHeat Equation, Wave Equation, Properties, External Forcing
MATH348-Advanced Engineering Mathematics Homework Solutions: PDE Part II Heat Equation, Wave Equation, Properties, External Forcing Text: Chapter 1.3-1.5 ecture Notes : 14 and 15 ecture Slides: 6 Quote
More informationPhysics 115/242 Comparison of methods for integrating the simple harmonic oscillator.
Physics 115/4 Comparison of methods for integrating the simple harmonic oscillator. Peter Young I. THE SIMPLE HARMONIC OSCILLATOR The energy (sometimes called the Hamiltonian ) of the simple harmonic oscillator
More informationTable of contents. d 2 y dx 2, As the equation is linear, these quantities can only be involved in the following manner:
M ath 0 1 E S 1 W inter 0 1 0 Last Updated: January, 01 0 Solving Second Order Linear ODEs Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections 4. 4. 7 and
More informationOrdinary 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
More informationElliptic Problems / Multigrid. PHY 604: Computational Methods for Physics and Astrophysics II
Elliptic Problems / Multigrid Summary of Hyperbolic PDEs We looked at a simple linear and a nonlinear scalar hyperbolic PDE There is a speed associated with the change of the solution Explicit methods
More informationMultistep 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
More informationMath 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros
Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros Midterm, October 6, 016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationFINITE VOLUME METHODS FOR ONE-DIMENSIONAL SCALAR CONSERVATION LAWS
1.73 - COMPUTATIONAL METHODS FOR FLOW IN POROUS MEDIA Spring 009 FINITE VOLUME METHODS FOR ONE-DIMENSIONAL SCALAR CONSERVATION LAWS Luis Cueto-Felgueroso 1.1. Problem statement Consider the 1D scalar conservation
More informationThe 1-D Heat Equation
The 1-D Heat Equation 18.303 Linear Partial Differential Equations Matthew J. Hancock Fall 004 1 The 1-D Heat Equation 1.1 Physical derivation Reference: Haberman 1.1-1.3 [Sept. 8, 004] In a metal rod
More informationLinear 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
More informationNumerical Modelling in Fortran: day 10. Paul Tackley, 2016
Numerical Modelling in Fortran: day 10 Paul Tackley, 2016 Today s Goals 1. Useful libraries and other software 2. Implicit time stepping 3. Projects: Agree on topic (by final lecture) (No lecture next
More informationDesigning Information Devices and Systems I Spring 2016 Official Lecture Notes Note 21
EECS 6A Designing Information Devices and Systems I Spring 26 Official Lecture Notes Note 2 Introduction In this lecture note, we will introduce the last topics of this semester, change of basis and diagonalization.
More informationButcher 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
More informationCopyright (c) 2006 Warren Weckesser
2.2. PLANAR LINEAR SYSTEMS 3 2.2. Planar Linear Systems We consider the linear system of two first order differential equations or equivalently, = ax + by (2.7) dy = cx + dy [ d x x = A x, where x =, and
More informationScientific 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
More informationSelected Topics in Physics a lecture course for 1st year students by W.B. von Schlippe Spring Semester 2007
Selected Topics in Physics a lecture course for st year students by W.B. von Schlippe Spring Semester 7 Lecture : Oscillations simple harmonic oscillations; coupled oscillations; beats; damped oscillations;
More informationDispersion relations, linearization and linearized dynamics in PDE models
Dispersion relations, linearization and linearized dynamics in PDE models 1 Dispersion relations Suppose that u(x, t) is a function with domain { < x 0}, and it satisfies a linear, constant coefficient
More informationTopic: Primal-Dual Algorithms Date: We finished our discussion of randomized rounding and began talking about LP Duality.
CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Primal-Dual Algorithms Date: 10-17-07 14.1 Last Time We finished our discussion of randomized rounding and
More informationChapter 9 Implicit Methods for Linear and Nonlinear Systems of ODEs
Chapter 9 Implicit Methods for Linear and Nonlinear Systems of ODEs In the previous chapter, we investigated stiffness in ODEs. Recall that an ODE is stiff if it exhibits behavior on widelyvarying timescales.
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Modified Equation of a Difference Scheme What is a Modified Equation of a Difference
More informationThe 1-D Heat Equation
The 1-D Heat Equation 18.303 Linear Partial Differential Equations Matthew J. Hancock Fall 005 1 The 1-D Heat Equation 1.1 Physical derivation Reference: Haberman 1.1-1.3 [Sept. 7, 005] In a metal rod
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More information12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis
ATH 337, by T. Lakoba, University of Vermont 113 12 The Heat equation in one spatial dimension: Simple explicit method and Stability analysis 12.1 Formulation of the IBVP and the minimax property of its
More informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
More informationDifferential Analysis II Lectures 22-24
Lecture : 3 April 015 18.156 Differential Analysis II Lectures - Instructor: Larry Guth Trans.: Kevin Sacel.1 Precursor to Schrödinger Equation Suppose we are trying to find u(, t) with u(, 0) = f() satisfying
More information18.325: Vortex Dynamics
8.35: Vortex Dynamics Problem Sheet. Fluid is barotropic which means p = p(. The Euler equation, in presence of a conservative body force, is Du Dt = p χ. This can be written, on use of a vector identity,
More informationBindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 6: Monday, Mar 7. e k+1 = 1 f (ξ k ) 2 f (x k ) e2 k.
Problem du jour Week 6: Monday, Mar 7 Show that for any initial guess x 0 > 0, Newton iteration on f(x) = x 2 a produces a decreasing sequence x 1 x 2... x n a. What is the rate of convergence if a = 0?
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationNumerical 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
More informationPartial Differential Equations
Partial Differential Equations Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical Engineering University of Connecticut xchen@engr.uconn.edu Contents 1
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More information10. Operators and the Exponential Response Formula
52 10. Operators and the Exponential Response Formula 10.1. Operators. Operators are to functions as functions are to numbers. An operator takes a function, does something to it, and returns this modified
More informationComputational Modeling for Physical Sciences
Computational Modeling for Physical Sciences Since the invention of computers the use of computational modeling and simulations have revolutionized the way we study physical systems. Their applications
More information12.1. Exponential shift. The calculation (10.1)
62 12. Resonance and the exponential shift law 12.1. Exponential shift. The calculation (10.1) (1) p(d)e = p(r)e extends to a formula for the effect of the operator p(d) on a product of the form e u, where
More informationClass Note #14. In this class, we studied an algorithm for integer multiplication, which. 2 ) to θ(n
Class Note #14 Date: 03/01/2006 [Overall Information] In this class, we studied an algorithm for integer multiplication, which improved the running time from θ(n 2 ) to θ(n 1.59 ). We then used some of
More informationIntegration of Ordinary Differential Equations
Integration of Ordinary Differential Equations Com S 477/577 Nov 7, 00 1 Introduction The solution of differential equations is an important problem that arises in a host of areas. Many differential equations
More informationODE Homework 1. Due Wed. 19 August 2009; At the beginning of the class
ODE Homework Due Wed. 9 August 2009; At the beginning of the class. (a) Solve Lẏ + Ry = E sin(ωt) with y(0) = k () L, R, E, ω are positive constants. (b) What is the limit of the solution as ω 0? (c) Is
More informationLecture 16: Relaxation methods
Lecture 16: Relaxation methods Clever technique which begins with a first guess of the trajectory across the entire interval Break the interval into M small steps: x 1 =0, x 2,..x M =L Form a grid of points,
More informationLecture 19 IIR Filters
Lecture 19 IIR Filters Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/5/10 1 General IIR Difference Equation IIR system: infinite-impulse response system The most general class
More informationMath 251 December 14, 2005 Answer Key to Final Exam. 1 18pt 2 16pt 3 12pt 4 14pt 5 12pt 6 14pt 7 14pt 8 16pt 9 20pt 10 14pt Total 150pt
Name Section Math 51 December 14, 5 Answer Key to Final Exam There are 1 questions on this exam. Many of them have multiple parts. The point value of each question is indicated either at the beginning
More information