Math 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework
|
|
- Geraldine King
- 5 years ago
- Views:
Transcription
1 Math 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework Jan Mandel University of Colorado Denver May 12, /20/09: Sec. 1.1, 1.2. Hw 1 due 1/27: problems 1.1, 1.3, geometric interpretation (sec. 1.6) 1/25/10: If you use a laptop, please bring it. At 11am, the class will continue by Chris Harder s PhD defense. 1/27/10: Sec. 1.3, integration by parts - justification of eq. (1.18) 2/1/10: Sec. 1.4, motivation of Sobolev spaces from minimization of energy 2/3/10: Sec. 1.5 Sobolev spaces Hw 2 due 2/10: problems 1.8, Make sure Matlab works on your laptops. 2/8/10 Sec : Abstract formulation and error estimates, regularity 2/10/10 Sec L 2 estimate by duality (Nitsche s trick) 2/15/10 Difference formulas - LeVeque ch. 1. Hw 3 due 2/22: write a function c=d5(x) to compute the coefficients of a finite difference formula to evaluate u (5) (x 0 ) from x = [x 0,..., x 5 ]. (See the book p. 11). Write a script test d5 that will test the coefficients and verify the differencing is exact for all polynomial of appropriate order. test d5 should run alone, with no input of any kind. I will test your d5 on both uniform and nonuniform grids. 2/17/10 Solving the laplace equation in 1D, l 2 error estimate - sec Greens function 2/22/10 Solution of homework problem 1.3 (quadratic elements in 1D).Max error estimate for the Laplace equation in 1D
2 2/24/10 Neumann problem - FE Johnson 1.7, FD Le Veque Hw 4 due 3/3: 1. Find the variational solution of the Laplace equation d 2 u/dx 2 = δ y in (0, 1), u (0) = u (1) = 0, for a fixed y (0, 1) Use the weak formulation d 2 u/dx 2 vdx = v (y) for all suitable test functions v and integration by parts to find continuous and piecewise smooth u. Summarize and graph the resulting Green s function u (x, y). 2. Write Matlab function u=neumann fd(f,a,b,sigma0,sigma1) to solve the Neumann problem u = f in (a, b), u (a) = σ 0, u (b) = σ 1. Here f and u are vector of length n + 2 of values at the nodes of uniform mesh x 0 = a,..., x n+1 = b, with the boundary condition discretized by finite differences (2nd order inside the interval, 1st order for the boundary conditions) as in the book. Then write the function u=neumann fe(f,a,b,sigma0,sigma1) for the same problem discretized by linear finite elements on the same mesh. Test on the interval (0, 1) for the right-hand side and the boundary conditions given by the exact solution u (x) = x (1 x). Plot the numerical solutions and the exact solution, and compare in the 2 norm and the maximum norm. The solution is determined only up to an additive constant, so for the comparison, add a constant vector to the solution to make the average zero. Print n, h, and the norms of the error divided by h and h 2 to verify the rate of convergence for n = 2, 4, 8,..., Store the system matrix as sparse. Hint: The solution is determined only up to a constant. To solve the singular system of equations, take an arbitrary lnear equation with zero right hand side, which is not satisfied by the constant, for example u k = 0, and add it to one of the equations in the system. Turn in 1. matlab codes 2. your report with all graphs and printout including the source as a single file or hardcopy. 3/1 Nonlinear equation , singular perturbation , reading: 2.13, 2.14, /3 Laplace equation in 2D ( ). Hw 5 due 3/ Write matlab code to find the solution of the nonlinear pendulum equation θ = sin θ in (0, 2π) with boundary conditions u (0) = a, u (2π) = b on a uniform mesh as Matlab function pendulum(tol,maxit,theta0) where tol is the stopping tolerance in the max norm, maxit is the maximum number of iterations for Newton s method, and theta0 is the initial approximation on your mesh. Graph the Newton iterates to get the same pictures as in the book. The boundary values are the first and the last entries of theta0. Use this code to find the solution starting from constant theta0=0.7, and at least one other solution with the same boundary values. Turn in the matlab code and your report with graphs, listing of the code, and description of the code and the results. 2. Write matlab code to solve the equation εu + u = 1 in (a, b), u (a) = u (b) = 0, on a uniform mesh x 0 = a,..., x n+1 = b and approximation of u by central difference, as u=advection(a,b,epsilon,n) returning vector u of length n + 1. Compare the solution with the exact solution, which you find analytically, and create a table and mesh plot of the max error as a function of log ε and log h, h = 1/n. for small ε > 0 and large n. Explore numerically the question how large n has to be for some given error tolerance and given small ε. Repeat for approximations of u by left and right 2
3 one-sided differences. Turn in the matlab code and your report with graphs, listing of the code, and description of the code and the results as a single file or hardcopy. Project 1, due 4/12. Construct example of solutions u of the homogeneous Dirichlet problem for the Laplace equation on unit square, u = f in Ω = (0, 1) (0, 1), u = 0 on Ω, such that f is smooth but u is not; in particular, 4 u/ x 4 and 4 u/ y 4 are not in L 2 (Ω) and u is not in H β (Ω). For which β > 0 do you get such examples? Consider w = Im z a ln z, show that w = 0, and choose a so that w is zero on one axis and polynomial on the other. Then find v such that w = v on the axes, and v = 0 or is smooth, and consider u = (v w) ϕ, where ϕ is a smooth cut-off function to force u = 0 on the other two sides of Ω. Discuss if it possible to guarantee that u H 4 (Ω) by assuming that f is sufficiently smooth and the implications for the l 2 estimate of the error of the finite difference method. 3/8 Solved some older hw problems. Initial value problems ( ) 3/10 Basic methods for IVP: notes ch. 11 3/17 Midterm. Review questions: Using integration by parts, derive the variational formulation of the Laplace equation in 1D. (Assume all functions are smooth enough.) Using integration by parts, derive the variational formulation of the Laplace equation in 2D. (Assume all functions are smooth enough.) Define the Sobolev space H 1 (Ω). Write the Sobolev inequality for functions in H 1 (Ω), Ω a bounded domain with piecewise smooth boundary (and no zero angles). For which d does it hold that H 1 (Ω) C ( Ω ) for a (suitable) domain Ω R d? Show that the variational formulation and minimization energy (in abstract form) are equivalent. Formulate and prove the Lax-Milgram theorem. Formulate and prove Cea s lemma. Formulate and prove L 2 error estimate using duality (Nitsche s trick) Derive the truncation error of the 3-point central difference formula for second derivative. Write the discretization of u = f in (0, 1), u (0) = u (1) = 0 by finite differences as a linear system AU = b. Find all eigenvalues and eigenvectors of the matrix A above. Bound A 1 independently of h (in the specral norm). 3
4 Given a bound on the truncation error and on A 1, find a bound on the error of the solution. Derive a finite difference discretization of the equation u = f (u) in (0, 1), u (0) = u (1) = 0 and state the Newton s method for the solution of the discretized equations. 3/19 Midterm 3/29 Convergence of basic methods for IVP: notes /31 Runge-Kutta methods: notes /5 Revisited Project 1. Leap-frog method (notes 11.6); absolute stability revisited. Homework 6 due April 12: Test the Euler method, Backward Euler method, Leapfrog method, the Trapezoidal method, and the modified Trapezoidal method u n+1 = u n + h ((1 h) f 2 n + (1 + h) f n+1 ) on the problem u (t) = λ (u cos t) sin (t), u (0) = 1.5. The exact solution is given by (8.2) in the book. For each method, print a square table of max errors for h = 10 1, 10 2,...,10 6 and λ = 1, 10, 10 2,..., Explain the results. Plot at least 3 appropriate graphs of the solution. For each method, make also Matlab mesh plot of the error. Label all axes correctly and annotate the plots and make sure the tables have clear headings so that your results make sense. Submit all matlab files with a single script go.m that will produce your table and graphs with no input. Submit your report as a single pdf file or hardcopy. 4/7 A-stability (8.3.1), stiff problems, L-stability (8.3.2). Diffusion equation in 1D: method of lines, stability, stiffness ( ) 4/12 truncation error (9.1), convergence, Lax equivalence theorem (9.5), ADI method. Homework 7 due April 19: Write code to solve the heat equation u t = κ (u xx + u yy ) for x Ω = (0, 1) (0, 1), t (0, 1), u (t, x, y) = 0 for (x, y) Ω, u (0, x, y) = f (x, y) by 1. Euler method, 2. Crank-Nicholson method, 3. ADI, with space mesh step h = 0.2, 0.1, 0.05, and appropriate time step, for κ = 1 and 0.1. You may use Matlab sparse Choleski for the Crank-Nicholson method, if you do, decompose the matrix only once. Use f (x, y) = sin (5πx) sin (2πy), compute exact solution, compare your numerical result with the exact solution at t = 1, and tabulate the max norm of the error. If any computation takes more than 20 minutes you may leave the table entry blank. Submit matlab code with a single script go.m that will produce your tables and (optionally) graphs with no input, and a report with code, tables, and all other work (statement or derivation of the methods and of the exact solution). 4/14 Advection equation, Euler method, von Neumann stability, leapfrog method, Lax-Friedrichs method ( ). 4
5 4/19 Lax-Wendroff method, upwind method (derived from the C-I-R method) (10.4, for C-I-R: LeVeque, Numerical Methods for Conservation Laws, Birkhauser, 1992 (NMCL), 13.1), stability (10.5), CFL condition (10.6-7) Homework 8 due April 26: Program the leapfrog method, Lax-Friedrichs method, Lax-Wendroff method, and the upwind method for the equation u t +au x = 0 with a = 2 on the interval ( 1, 1) with periodic boundary conditions, and 0 t 0.9. Choose mesh step h = 0.05 and time step such that ak/h = 0.9. Plot the exact solution and the numerical solutions on the rectangle ( 1, 1) (0, 0.9), for these choices of the initial value: u 0 (x) = 0 in ( 1, 1) \ ( 0.2, 0.2), and in ( 0.2, 0.2) a) smooth function by shifting and scaling of cos so that u 0 (0) = 1, u 0 (±0.2) = u 0 (±0.2) = 0 b) piecewise linear function such that u 0 (0) = 1, u 0 (±0.2) = 0 c) piecewise constant function equal to 1 on the nodes inside ( 0.2, 0.2). That is total 4 times 3 = 12 figures. For each method and initial value, compute the max error and organize them in 4 times 3 table. Comment on the error and the figures using analysis of the methods in the book. Turn in matlab code and a report with the code and the results. Project 2, due at the time of the final exam. Choose one of the equations in section 11.1 and write a code for an explicit finite difference method for its solution. Or talk to me to pick another problem. Use the code to find and visualize an interesting nontrivial solution of the equation. Turn in matlab code and a report with the code, its derivation, explanation of the problem and the method, and the results and their explanation. 4/21: Dispersion (E.3), modified equations (10.9) (upwinding only) 4/26 Modified equations for Lax-Friedrichs (rest of 10.9). Hyperbolic systems ( ), upwinding for initial BVP ( ), implicit-explicit methods (11.5), demo: fire spotting.m 4/28 Systems of conservation laws, conservative methods, nonlinear Lax-Wendroff method, demo: waterwave.m (from R. Leveque, Numerical Methods for Conservation Laws, Birkäuser 1992, pp. 1 3, 14 16, , and C. Moller, Shallow Water Equations (pdf)) 5/3 q&a: implementing the matrix for 2D Laplace equation. Upwind method as example of conservative method. Characteristics, Burger s equation, weak solution, jump conditions. 5/5 Lax-Wendroff theorem, Riemann s problem and its solution for Burger s equation, entropy condition, Godunov s method, monotone methods, convergence of monotone methods. I am available for consultations: Friday 5/7 before 9:30; after 2pm with appointment; Monday 5/10 before 11:30 and 12:30-2:15; after 2:15 with appointment one day in advance. 5
6 Final: Wednesday 5/ :15. Review questions for the final 1. Derive the truncation error for one of the covered methods (Euler, Backward Euler, Trapezoidal, Heun, Leapfrog) 2. Derive the region of absolute stability for those same methods. 3. Define A-stability and L-stability. Define all terms in the definition starting from the differential equation. 4. Derive the truncation error for the Crank-Nicholson method for the heat equation. 5. State the Lax-Richtmyer equivalence theorem. 6. Derive the stability restriction on the time step of the Euler method for the heat equation using the Fourier mode analysis on a rectangle. 7. State the upwind method for the advection equation and perform von Neumann stability analysis to derive the CFL condition. The same for Lax-Friedrichs, Lax- Wendroff. 8. Derive the modified equation for the upwind method; the same for Lax-Wendroff and Leapfrog method. 9. Perform the von-neumann analysis for the modified equation of the upwind method; the same for Lax-Wendroff and Leapfrog method. Identify dissipation and dispersion, compute the group velocity. 10. Define a system of hyperbolic conservation laws. 11. Show that the upwind method is a conservative scheme. 12. Solve the Burger s equation for a given an initial value by the method of characteristics. 6
Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems
Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,
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 informationChapter 10 Exercises
Chapter 10 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rl/fdmbook Exercise 10.1 (One-sided and
More informationPart 1. The diffusion equation
Differential Equations FMNN10 Graded Project #3 c G Söderlind 2016 2017 Published 2017-11-27. Instruction in computer lab 2017-11-30/2017-12-06/07. Project due date: Monday 2017-12-11 at 12:00:00. Goals.
More information7 Hyperbolic Differential Equations
Numerical Analysis of Differential Equations 243 7 Hyperbolic Differential Equations While parabolic equations model diffusion processes, hyperbolic equations model wave propagation and transport phenomena.
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 informationLast time: Diffusion - Numerical scheme (FD) Heat equation is dissipative, so why not try Forward Euler:
Lecture 7 18.086 Last time: Diffusion - Numerical scheme (FD) Heat equation is dissipative, so why not try Forward Euler: U j,n+1 t U j,n = U j+1,n 2U j,n + U j 1,n x 2 Expected accuracy: O(Δt) in time,
More informationLecture Notes on Numerical Schemes for Flow and Transport Problems
Lecture Notes on Numerical Schemes for Flow and Transport Problems by Sri Redeki Pudaprasetya sr pudap@math.itb.ac.id Department of Mathematics Faculty of Mathematics and Natural Sciences Bandung Institute
More informationFDM for wave equations
FDM for wave equations Consider the second order wave equation Some properties Existence & Uniqueness Wave speed finite!!! Dependence region Analytical solution in 1D Finite difference discretization Finite
More informationLecture Notes on Numerical Schemes for Flow and Transport Problems
Lecture Notes on Numerical Schemes for Flow and Transport Problems by Sri Redeki Pudaprasetya sr pudap@math.itb.ac.id Department of Mathematics Faculty of Mathematics and Natural Sciences Bandung Institute
More informationQualifying Examination
Summer 24 Day. Monday, September 5, 24 You have three hours to complete this exam. Work all problems. Start each problem on a All problems are 2 points. Please email any electronic files in support of
More informationReview for Exam 2 Ben Wang and Mark Styczynski
Review for Exam Ben Wang and Mark Styczynski This is a rough approximation of what we went over in the review session. This is actually more detailed in portions than what we went over. Also, please note
More informationIndex. C 2 ( ), 447 C k [a,b], 37 C0 ( ), 618 ( ), 447 CD 2 CN 2
Index advection equation, 29 in three dimensions, 446 advection-diffusion equation, 31 aluminum, 200 angle between two vectors, 58 area integral, 439 automatic step control, 119 back substitution, 604
More informationMATH 333: Partial Differential Equations
MATH 333: Partial Differential Equations Problem Set 9, Final version Due Date: Tues., Nov. 29, 2011 Relevant sources: Farlow s book: Lessons 9, 37 39 MacCluer s book: Chapter 3 44 Show that the Poisson
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 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 informationNumerical Methods for Conservation Laws WPI, January 2006 C. Ringhofer C2 b 2
Numerical Methods for Conservation Laws WPI, January 2006 C. Ringhofer ringhofer@asu.edu, C2 b 2 2 h2 x u http://math.la.asu.edu/ chris Last update: Jan 24, 2006 1 LITERATURE 1. Numerical Methods for Conservation
More informationNumerical Methods for PDEs
Numerical Methods for PDEs Problems 1. Numerical Differentiation. Find the best approximation to the second drivative d 2 f(x)/dx 2 at x = x you can of a function f(x) using (a) the Taylor series approach
More informationNUMERICAL METHODS FOR ENGINEERING APPLICATION
NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto
More informationPDEs, part 3: Hyperbolic PDEs
PDEs, part 3: Hyperbolic PDEs Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2011 Hyperbolic equations (Sections 6.4 and 6.5 of Strang). Consider the model problem (the
More informationMath 251 December 14, 2005 Final Exam. 1 18pt 2 16pt 3 12pt 4 14pt 5 12pt 6 14pt 7 14pt 8 16pt 9 20pt 10 14pt Total 150pt
Math 251 December 14, 2005 Final Exam Name Section There are 10 questions on this exam. Many of them have multiple parts. The point value of each question is indicated either at the beginning of each question
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 informationMathematics Qualifying Exam Study Material
Mathematics Qualifying Exam Study Material The candidate is expected to have a thorough understanding of engineering mathematics topics. These topics are listed below for clarification. Not all instructors
More informationNumerical Solutions for Hyperbolic Systems of Conservation Laws: from Godunov Method to Adaptive Mesh Refinement
Numerical Solutions for Hyperbolic Systems of Conservation Laws: from Godunov Method to Adaptive Mesh Refinement Romain Teyssier CEA Saclay Romain Teyssier 1 Outline - Euler equations, MHD, waves, hyperbolic
More informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
More informationNumerical Solution of partial differential equations
G. D. SMITH Brunei University Numerical Solution of partial differential equations FINITE DIFFERENCE METHODS THIRD EDITION CLARENDON PRESS OXFORD Contents NOTATION 1. INTRODUCTION AND FINITE-DIFFERENCE
More informationMath 660-Lecture 23: Gudonov s method and some theories for FVM schemes
Math 660-Lecture 3: Gudonov s method and some theories for FVM schemes 1 The idea of FVM (You can refer to Chapter 4 in the book Finite volume methods for hyperbolic problems ) Consider the box [x 1/,
More informationA THEORETICAL INTRODUCTION TO NUMERICAL ANALYSIS
A THEORETICAL INTRODUCTION TO NUMERICAL ANALYSIS Victor S. Ryaben'kii Semyon V. Tsynkov Chapman &. Hall/CRC Taylor & Francis Group Boca Raton London New York Chapman & Hall/CRC is an imprint of the Taylor
More informationApplied Mathematics 205. Unit III: Numerical Calculus. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit III: Numerical Calculus Lecturer: Dr. David Knezevic Unit III: Numerical Calculus Chapter III.3: Boundary Value Problems and PDEs 2 / 96 ODE Boundary Value Problems 3 / 96
More informationFDM for parabolic equations
FDM for parabolic equations Consider the heat equation where Well-posed problem Existence & Uniqueness Mass & Energy decreasing FDM for parabolic equations CNFD Crank-Nicolson + 2 nd order finite difference
More informationOrdinary 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
More informationNumerical Algorithms for Visual Computing II 2010/11 Example Solutions for Assignment 6
Numerical Algorithms for Visual Computing II 00/ Example Solutions for Assignment 6 Problem (Matrix Stability Infusion). The matrix A of the arising matrix notation U n+ = AU n takes the following form,
More informationCS205B / CME306 Homework 3. R n+1 = R n + tω R n. (b) Show that the updated rotation matrix computed from this update is not orthogonal.
CS205B / CME306 Homework 3 Rotation Matrices 1. The ODE that describes rigid body evolution is given by R = ω R. (a) Write down the forward Euler update for this equation. R n+1 = R n + tω R n (b) Show
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 informationENO and WENO schemes. Further topics and time Integration
ENO and WENO schemes. Further topics and time Integration Tefa Kaisara CASA Seminar 29 November, 2006 Outline 1 Short review ENO/WENO 2 Further topics Subcell resolution Other building blocks 3 Time Integration
More informationConservation of Mass (Eulerian Framework)
CME306 / CS205B Homework 1 (Theory) Conservation of Mass (Eulerian Framework) 1. In an Eulerian framework, the strong form of Conservation of Mass takes the form below. Please briefly explain the three
More informationProblem Set 4 Issued: Wednesday, March 18, 2015 Due: Wednesday, April 8, 2015
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS 0139.9 NUMERICAL FLUID MECHANICS SPRING 015 Problem Set 4 Issued: Wednesday, March 18, 015 Due: Wednesday,
More informationDesign of optimal Runge-Kutta methods
Design of optimal Runge-Kutta methods David I. Ketcheson King Abdullah University of Science & Technology (KAUST) D. Ketcheson (KAUST) 1 / 36 Acknowledgments Some parts of this are joint work with: Aron
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 informationSyllabus for Applied Mathematics Graduate Student Qualifying Exams, Dartmouth Mathematics Department
Syllabus for Applied Mathematics Graduate Student Qualifying Exams, Dartmouth Mathematics Department Alex Barnett, Scott Pauls, Dan Rockmore August 12, 2011 We aim to touch upon many topics that a professional
More informationFinal exam (practice) UCLA: Math 31B, Spring 2017
Instructor: Noah White Date: Final exam (practice) UCLA: Math 31B, Spring 2017 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in
More informationOrdinary 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
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 informationMATH-UA 263 Partial Differential Equations Recitation Summary
MATH-UA 263 Partial Differential Equations Recitation Summary Yuanxun (Bill) Bao Office Hour: Wednesday 2-4pm, WWH 1003 Email: yxb201@nyu.edu 1 February 2, 2018 Topics: verifying solution to a PDE, dispersion
More informationIterative Methods for Linear Systems
Iterative Methods for Linear Systems 1. Introduction: Direct solvers versus iterative solvers In many applications we have to solve a linear system Ax = b with A R n n and b R n given. If n is large the
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
More informationTyn Myint-U Lokenath Debnath. Linear Partial Differential Equations for Scientists and Engineers. Fourth Edition. Birkhauser Boston Basel Berlin
Tyn Myint-U Lokenath Debnath Linear Partial Differential Equations for Scientists and Engineers Fourth Edition Birkhauser Boston Basel Berlin Preface to the Fourth Edition Preface to the Third Edition
More informationSelected HW Solutions
Selected HW Solutions HW1 1 & See web page notes Derivative Approximations. For example: df f i+1 f i 1 = dx h i 1 f i + hf i + h h f i + h3 6 f i + f i + h 6 f i + 3 a realmax 17 1.7014 10 38 b realmin
More informationNotes: Outline. Shock formation. Notes: Notes: Shocks in traffic flow
Outline Scalar nonlinear conservation laws Traffic flow Shocks and rarefaction waves Burgers equation Rankine-Hugoniot conditions Importance of conservation form Weak solutions Reading: Chapter, 2 R.J.
More informationFinite difference method for elliptic problems: I
Finite difference method for elliptic problems: I Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
More informationME Computational Fluid Mechanics Lecture 5
ME - 733 Computational Fluid Mechanics Lecture 5 Dr./ Ahmed Nagib Elmekawy Dec. 20, 2018 Elliptic PDEs: Finite Difference Formulation Using central difference formulation, the so called five-point formula
More informationMTH 452/552 Homework 3
MTH 452/552 Homework 3 Do either 1 or 2. 1. (40 points) [Use of ode113 and ode45] This problem can be solved by a modifying the m-files odesample.m and odesampletest.m available from the author s webpage.
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
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 informationNumerical Mathematics
Alfio Quarteroni Riccardo Sacco Fausto Saleri Numerical Mathematics Second Edition With 135 Figures and 45 Tables 421 Springer Contents Part I Getting Started 1 Foundations of Matrix Analysis 3 1.1 Vector
More informationCS412: Introduction to Numerical Methods
CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,
More informationFinal exam (practice) UCLA: Math 31B, Spring 2017
Instructor: Noah White Date: Final exam (practice) UCLA: Math 3B, Spring 207 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in the
More informationMath 106: Calculus I, Spring 2018: Midterm Exam II Monday, April Give your name, TA and section number:
Math 106: Calculus I, Spring 2018: Midterm Exam II Monday, April 6 2018 Give your name, TA and section number: Name: TA: Section number: 1. There are 6 questions for a total of 100 points. The value of
More information[2] (a) Develop and describe the piecewise linear Galerkin finite element approximation of,
269 C, Vese Practice problems [1] Write the differential equation u + u = f(x, y), (x, y) Ω u = 1 (x, y) Ω 1 n + u = x (x, y) Ω 2, Ω = {(x, y) x 2 + y 2 < 1}, Ω 1 = {(x, y) x 2 + y 2 = 1, x 0}, Ω 2 = {(x,
More informationPartial Differential Equations
Partial Differential Equations Introduction Deng Li Discretization Methods Chunfang Chen, Danny Thorne, Adam Zornes CS521 Feb.,7, 2006 What do You Stand For? A PDE is a Partial Differential Equation This
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
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 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 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 informationFinite Difference Methods for Boundary Value Problems
Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationHigh-Order Finite-Volume Methods! Phillip Colella! Computational Research Division! Lawrence Berkeley National Laboratory!
High-Order Finite-Volume Methods! Phillip Colella! Computational Research Division! Lawrence Berkeley National Laboratory! Why Higher Order?! Locally-refined grids, mapped-multiblock grids smooth except
More informationTutorial 2. Introduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes c 2012 Classifying PDEs Looking at the PDE Au xx + 2Bu xy + Cu yy + Du x + Eu y + Fu +.. = 0, and its discriminant, B 2
More informationChapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS
Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS 5.1 Introduction When a physical system depends on more than one variable a general
More informationFinite difference methods for the diffusion equation
Finite difference methods for the diffusion equation D150, Tillämpade numeriska metoder II Olof Runborg May 0, 003 These notes summarize a part of the material in Chapter 13 of Iserles. They are based
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Implicit Schemes for the Model Problem The Crank-Nicolson scheme and θ-scheme
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 informationA very short introduction to the Finite Element Method
A very short introduction to the Finite Element Method Till Mathis Wagner Technical University of Munich JASS 2004, St Petersburg May 4, 2004 1 Introduction This is a short introduction to the finite element
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationMATH 2083 FINAL EXAM REVIEW The final exam will be on Wednesday, May 4 from 10:00am-12:00pm.
MATH 2083 FINAL EXAM REVIEW The final exam will be on Wednesday, May 4 from 10:00am-12:00pm. Bring a calculator and something to write with. Also, you will be allowed to bring in one 8.5 11 sheet of paper
More informationBoundary Value Problems and Iterative Methods for Linear Systems
Boundary Value Problems and Iterative Methods for Linear Systems 1. Equilibrium Problems 1.1. Abstract setting We want to find a displacement u V. Here V is a complete vector space with a norm v V. In
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More information10. e tan 1 (y) 11. sin 3 x
MATH B FINAL REVIEW DISCLAIMER: WHAT FOLLOWS IS A LIST OF PROBLEMS, CONCEPTUAL QUESTIONS, TOPICS, AND SAMPLE PROBLEMS FROM THE TEXTBOOK WHICH COMPRISE A HEFTY BUT BY NO MEANS EXHAUSTIVE LIST OF MATERIAL
More informationNumerical methods Revised March 2001
Revised March 00 By R. W. Riddaway (revised by M. Hortal) Table of contents. Some introductory ideas. Introduction. Classification of PDE's.3 Existence and uniqueness.4 Discretization.5 Convergence, consistency
More informationYou 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.
More informationBasics of Discretization Methods
Basics of Discretization Methods In the finite difference approach, the continuous problem domain is discretized, so that the dependent variables are considered to exist only at discrete points. Derivatives
More informationSolving Differential Equations on 2-D Geometries with Matlab
Solving Differential Equations on 2-D Geometries with Matlab Joshua Wall Drexel University Philadelphia, PA 19104 (Dated: April 28, 2014) I. INTRODUCTION Here we introduce the reader to solving partial
More informationSung-Ik Sohn and Jun Yong Shin
Commun. Korean Math. Soc. 17 (2002), No. 1, pp. 103 120 A SECOND ORDER UPWIND METHOD FOR LINEAR HYPERBOLIC SYSTEMS Sung-Ik Sohn and Jun Yong Shin Abstract. A second order upwind method for linear hyperbolic
More informationTime stepping methods
Time stepping methods ATHENS course: Introduction into Finite Elements Delft Institute of Applied Mathematics, TU Delft Matthias Möller (m.moller@tudelft.nl) 19 November 2014 M. Möller (DIAM@TUDelft) Time
More informationVISCOUS FLUX LIMITERS
VISCOUS FLUX LIMITERS E. F. Toro Department of Aerospace Science College of Aeronautics Cranfield Institute of Technology Cranfield, Beds MK43 OAL England. Abstract We present Numerical Viscosity Functions,
More informationNumerical Analysis of Differential Equations Numerical Solution of Parabolic Equations
Numerical Analysis of Differential Equations 215 6 Numerical Solution of Parabolic Equations 6 Numerical Solution of Parabolic Equations TU Bergakademie Freiberg, SS 2012 Numerical Analysis of Differential
More informationA recovery-assisted DG code for the compressible Navier-Stokes equations
A recovery-assisted DG code for the compressible Navier-Stokes equations January 6 th, 217 5 th International Workshop on High-Order CFD Methods Kissimmee, Florida Philip E. Johnson & Eric Johnsen Scientific
More informationApplied Math Qualifying Exam 11 October Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems.
Printed Name: Signature: Applied Math Qualifying Exam 11 October 2014 Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems. 2 Part 1 (1) Let Ω be an open subset of R
More informationACM/CMS 107 Linear Analysis & Applications Fall 2017 Assignment 2: PDEs and Finite Element Methods Due: 7th November 2017
ACM/CMS 17 Linear Analysis & Applications Fall 217 Assignment 2: PDEs and Finite Element Methods Due: 7th November 217 For this assignment the following MATLAB code will be required: Introduction http://wwwmdunloporg/cms17/assignment2zip
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 informationMAT 211, Spring 2015, Introduction to Linear Algebra.
MAT 211, Spring 2015, Introduction to Linear Algebra. Lecture 04, 53103: MWF 10-10:53 AM. Location: Library W4535 Contact: mtehrani@scgp.stonybrook.edu Final Exam: Monday 5/18/15 8:00 AM-10:45 AM The aim
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Introduction to Hyperbolic Equations The Hyperbolic Equations n-d 1st Order Linear
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 informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationDivergence Formulation of Source Term
Preprint accepted for publication in Journal of Computational Physics, 2012 http://dx.doi.org/10.1016/j.jcp.2012.05.032 Divergence Formulation of Source Term Hiroaki Nishikawa National Institute of Aerospace,
More informationMB4018 Differential equations
MB4018 Differential equations Part II http://www.staff.ul.ie/natalia/mb4018.html Prof. Natalia Kopteva Spring 2015 MB4018 (Spring 2015) Differential equations Part II 0 / 69 Section 1 Second-Order Linear
More informationThe one-dimensional equations for the fluid dynamics of a gas can be written in conservation form as follows:
Topic 7 Fluid Dynamics Lecture The Riemann Problem and Shock Tube Problem A simple one dimensional model of a gas was introduced by G.A. Sod, J. Computational Physics 7, 1 (1978), to test various algorithms
More information1 Upwind scheme for advection equation with variable. 2 Modified equations: numerical dissipation and dispersion
1 Upwind sceme for advection equation wit variable coefficient Consider te equation u t + a(x)u x Applying te upwind sceme, we ave u n 1 = a (un u n 1), a 0 u n 1 = a (un +1 u n ) a < 0. CFL condition
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 information3.4. Monotonicity of Advection Schemes
3.4. Monotonicity of Advection Schemes 3.4.1. Concept of Monotonicity When numerical schemes are used to advect a monotonic function, e.g., a monotonically decreasing function of x, the numerical solutions
More information