Differential Equations
|
|
- Roxanne Miller
- 6 years ago
- Views:
Transcription
1 Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector Methods Euler-Trapezoidal, Milne Simpson Methods ITCS 4133/5133: Numerical Comp. Methods/Analysis 1 Ordinary Differential Equations
2 Motivation Engineering problems require estimates of derivatives of functions for analysis Approaches: 1. Use function differences between neighboring points, divided by distance between the points, 2. Fit a function to the relationship between the independent and dependent variable (say an nth order polynomial) and use its derivative ITCS 4133/5133: Numerical Comp. Methods/Analysis 2 Ordinary Differential Equations
3 Differential Equations An equation that defines a relationship between an unknown function and one or more derivatives Definitions: dy dx d 2 y dx 2 = f(x, y) ( = f x, y, dy ) dx Order: is the order of the highest derivative f(.) may be a function any combination of x, y, and (in case of second order) dy/dx Ordinary Diff. Eq.: f(.) is a function of a single variable ITCS 4133/5133: Numerical Comp. Methods/Analysis 3 Ordinary Differential Equations
4 Definitions(contd) Linearity: determined by whether f(.) is linear in x, y, dy/dx, Solution: is a function of the independent variable. Boundary Conditions: constraints placed on the solution space. ITCS 4133/5133: Numerical Comp. Methods/Analysis 4 Ordinary Differential Equations
5 Example Applications 1. Electrical Circuit: Relationship between current and time 2. 1D Heat Flow: L di dt + Ri = E, i = 0 at t = 0 H = KA dt dr where K is the coeff. of thermal conductivity, H is the quantity of heat, A is the area perpendicular to heat flow, T is the temperature. ITCS 4133/5133: Numerical Comp. Methods/Analysis 5 Ordinary Differential Equations
6 Example Applications ITCS 4133/5133: Numerical Comp. Methods/Analysis 6 Ordinary Differential Equations
7 Reminder:Finite Differences Forward Difference Backward Difference df(x) dx f(x + x) f(x) = x Two Step Method df(x) dx f(x) f(x x) = x df(x) dx f(x + x) f(x x) = 2 x ITCS 4133/5133: Numerical Comp. Methods/Analysis 7 Ordinary Differential Equations
8 Taylor Series Based Methods:Euler s Method Given y = f(x, y) treat f(x, y) as a constant and the derivative as a tangent (quotient) Thus, y = y 1 y 0 x 1 x 0 y 1 y 0 = f(x 0, y 0 )(x 1 x 0 ) y 1 = y 0 + hf(x 0, y 0 ) where h = (b a)/n, n is the number of values of x. ITCS 4133/5133: Numerical Comp. Methods/Analysis 8 Ordinary Differential Equations
9 Taylor Series Based Methods:Euler s Method y 1 = y 0 + hf(x 0, y 0 ) ITCS 4133/5133: Numerical Comp. Methods/Analysis 9 Ordinary Differential Equations
10 Euler s method: From Taylor Series Taylor s series, truncated to the first term is given by y(x + h) = y(x) + hy (x) + h2 2 y (η) Euler s method follows, since y(x + h) = y i+1, y(x) = y i, y (x) = f(x i, y i ), x < η < x + h ITCS 4133/5133: Numerical Comp. Methods/Analysis 10 Ordinary Differential Equations
11 Euler s Method: Example 1 y = x + y, 0 x 1, y(0) = 2 ITCS 4133/5133: Numerical Comp. Methods/Analysis 11 Ordinary Differential Equations
12 y = Euler s Method: Example 2 { y( 2x + 1/x), x 0 1 x = 0 where y(0) = 0.0, 0 x 2.0. ITCS 4133/5133: Numerical Comp. Methods/Analysis 12 Ordinary Differential Equations
13 Euler s Method: Algorithm ITCS 4133/5133: Numerical Comp. Methods/Analysis 13 Ordinary Differential Equations
14 Euler s Method: Notes, Errors dy dx is evaluated at beginning of interval Error e increases with the width of (x x 0 ), as higher order terms become more important Also known as one-step Euler method Local Error: Range over a single step size; measure difference between numerical solution at end of step (starting with exact solution at beginning of the step) and the exact solution at end of step. Global Error: Accumulates over the range of the solution; measured as the difference between numerical and exact solutions. Errors using Euler s method can be approximated using the second order term of the Taylor series: ɛ = h2 2 y (η) ITCS 4133/5133: Numerical Comp. Methods/Analysis 14 Ordinary Differential Equations
15 Runge-Kutta Methods To improve on Euler s method, we can use additional terms of the Taylor series. Problem: Need to compute additional higher order derivatives, which can be problematic for complex functions. Runge-Kutta methods determine the y value (dependent variable) based on the value at the beginning of the interval, step size and some representative slope over the interval Euler s and the mnodified Euler s methods are special cases of these techniques Runge-Kutta methods are classified based on their order; fourth order is the most commonly used. Higher order derivates are not required of these methods ITCS 4133/5133: Numerical Comp. Methods/Analysis 15 Ordinary Differential Equations
16 Second Order Runge-Kutta Methods General Form: k 1 k 2 = hf(x n, y n )//slope at beginning of interval = hf(x n + c 2 h, y n + a 21 k 1 )//slope at end of interval Iteration: y n+1 = y n + w 1 k 1 + w 2 k 2 Example Methods: Improved Euler: c 2 = 1, a 21 = 1, w 1 = w 2 = 0.5 Midpoint: c 2 = 1, a 21 = 2/3, w 1 = 0, w 2 = 1 Heun: c 2 = 2/3, a 21 = 2/3, w 1 = 1/4, w 2 = 3/4 ITCS 4133/5133: Numerical Comp. Methods/Analysis 16 Ordinary Differential Equations
17 Second Order Runge Kutta Methods: Midpoint Method Idea: Approximate the value of y at (x + h/2) by summing current value of y and one-half the change in y from Euler s method: k 1 k 2 = hf(x i, y i )// change in y : Euler s method = hf(x i + h/2, y i + k 1 /2)// change in y: slope est. at midpoint Iteration: y i+1 = y i + k 2 ITCS 4133/5133: Numerical Comp. Methods/Analysis 17 Ordinary Differential Equations
18 Runge Kutta Methods:Improved Euler s Method A second order Runge-Kutta method. Estimates of y at start and midpoint of interval are averaged to produce a revised estimate of y at end of interval. Procedure: k 1 = hf(x n, y n ) k 2 = hf(x n + h, y n + k 1 ) y n+1 = y n k k 2 ITCS 4133/5133: Numerical Comp. Methods/Analysis 18 Ordinary Differential Equations
19 Improved Euler s Method: Procedure Evaluate y at start of interval Estimate y at end of interval using Euler s method Evaluate y at end of interval Compute average slope Compute a revised y at end of interval using average slope ITCS 4133/5133: Numerical Comp. Methods/Analysis 19 Ordinary Differential Equations
20 Example : Midpoint and Improved Euler s Methods ITCS 4133/5133: Numerical Comp. Methods/Analysis 20 Ordinary Differential Equations
21 Classic Runge-Kutta Method: Fourth Order A commonly used class of Runge-Kutta methods. k 1 = hf(x i, y i ) k 2 = hf(x i + 0.5h, y i + 0.5k 1 ) k 3 = hf(x i + 0.5h, y i + 0.5k 2 ) k 4 = hf(x i + 0.5h, y i + k 3 ) Iteration: y i+1 = y i (k 1 + 2k 2 + 2k 3 + k 4 ) ITCS 4133/5133: Numerical Comp. Methods/Analysis 21 Ordinary Differential Equations
22 Classic Runge-Kutta Method: Algorithm ITCS 4133/5133: Numerical Comp. Methods/Analysis 22 Ordinary Differential Equations
23 Classic Runge-Kutta Method: Example 1 ITCS 4133/5133: Numerical Comp. Methods/Analysis 23 Ordinary Differential Equations
24 Classic Runge-Kutta Method: Example 2 ITCS 4133/5133: Numerical Comp. Methods/Analysis 24 Ordinary Differential Equations
25 Predictor-Corrector Methods Euler s method and Runge-Kutta methods generally require step sizes to be small, else might not yield precise solutions Predictor-Corrector methods can be used to increase the accuracy of solutions These methods use solutions from previous intervals to project to the end of the next interval, followed by iterative refinement. Disadvantage: Requires values from previous intervals - one-step methods such as the Euler s method have to be used. Predictor: Gets an initial estimate at the end of the interval. Corrector: Improves the estimate by iteration. ITCS 4133/5133: Numerical Comp. Methods/Analysis 25 Ordinary Differential Equations
26 Euler-Trapezoidal Method Uses Euler s method as predictor and Trapezoidal rule as corrector Predictor y i+1,0 = y i, + h dy dx i, Corrector y i+1,j = y i, + h 2 [ dy dx + dy i, dx i+1,j 1 ] ITCS 4133/5133: Numerical Comp. Methods/Analysis 26 Ordinary Differential Equations
27 Euler-Trapezoidal Method: Example ITCS 4133/5133: Numerical Comp. Methods/Analysis 27 Ordinary Differential Equations
28 Euler-Trapezoidal Method: Example ITCS 4133/5133: Numerical Comp. Methods/Analysis 28 Ordinary Differential Equations
29 Milne-Simpson Method Uses Milne s method as predictor and Simpson s rule as corrector Predictor y i+1,0 = y i 3, + 4h 3 [ 2 dy dx dy i, dx + 2 dy i 1, dx i 2, ] Corrector y i+1,j = y i 1, + h 3 [ dy dx + 4 dy i+1,j 1 dx + dy i, dx i 1, ] ITCS 4133/5133: Numerical Comp. Methods/Analysis 29 Ordinary Differential Equations
30 Milne-Simpson Method: Example ITCS 4133/5133: Numerical Comp. Methods/Analysis 30 Ordinary Differential Equations
31 Milne-Simpson: Example ITCS 4133/5133: Numerical Comp. Methods/Analysis 31 Ordinary Differential Equations
32 ITCS 4133/5133: Numerical Comp. Methods/Analysis 32 Ordinary Differential Equations
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
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationFourth 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)
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 21 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University 1 All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationUnit I (Testing of Hypothesis)
SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level
More informationChap. 20: Initial-Value Problems
Chap. 20: Initial-Value Problems Ordinary Differential Equations Goal: to solve differential equations of the form: dy dt f t, y The methods in this chapter are all one-step methods and have the general
More informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationLecture IV: Time Discretization
Lecture IV: Time Discretization Motivation Kinematics: continuous motion in continuous time Computer simulation: Discrete time steps t Discrete Space (mesh particles) Updating Position Force induces acceleration.
More information2.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS. differential equations with the initial values y(x 0. ; l.
Numerical Methods II UNIT.1 NUMERICAL SOLUTION OF SIMULTANEOUS FIRST ORDER ORDINARY DIFFERENTIAL EQUATIONS.1.1 Runge-Kutta Method of Fourth Order 1. Let = f x,y,z, = gx,y,z be the simultaneous first order
More informationHIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j )
HIGHER ORDER METHODS There are two principal means to derive higher order methods y n+1 = p j=0 a j y n j + h p j= 1 b j f(x n j,y n j ) (a) Method of Undetermined Coefficients (b) Numerical Integration
More informationChapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 1. Runge-Kutta Methods
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com 1 . Chapter 8 Numerical Solution of
More informationLecture V: The game-engine loop & Time Integration
Lecture V: The game-engine loop & Time Integration The Basic Game-Engine Loop Previous state: " #, %(#) ( #, )(#) Forces -(#) Integrate velocities and positions Resolve Interpenetrations Per-body change
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK
KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS
More informationNumerical Differential Equations: IVP
Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential
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 information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationInitial 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
More informationConsistency 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
More informationEuler s Method, cont d
Jim Lambers MAT 461/561 Spring Semester 009-10 Lecture 3 Notes These notes correspond to Sections 5. and 5.4 in the text. Euler s Method, cont d We conclude our discussion of Euler s method with an example
More information1 Error Analysis for Solving IVP
cs412: introduction to numerical analysis 12/9/10 Lecture 25: Numerical Solution of Differential Equations Error Analysis Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore
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 informationVirtual University of Pakistan
Virtual University of Pakistan File Version v.0.0 Prepared For: Final Term Note: Use Table Of Content to view the Topics, In PDF(Portable Document Format) format, you can check Bookmarks menu Disclaimer:
More informationChapter 11 ORDINARY DIFFERENTIAL EQUATIONS
Chapter 11 ORDINARY DIFFERENTIAL EQUATIONS The general form of a first order differential equations is = f(x, y) with initial condition y(a) = y a We seek the solution y = y(x) for x > a This is shown
More informationNumerical 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
More informationMath 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
More informationNumerical Methods for Initial Value Problems; Harmonic Oscillators
Lab 1 Numerical Methods for Initial Value Problems; Harmonic Oscillators Lab Objective: Implement several basic numerical methods for initial value problems (IVPs), and use them to study harmonic oscillators.
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationUSHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY
Code No: R007/R0 Set No. I B.Tech I Semester Supplementary Examinations, Feb/Mar 04 MATHEMATICAL METHODS ( Common to Civil Engineering, Electrical & Electronics Engineering, Computer Science & Engineering,
More informationNumerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point
Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error In this method we assume initial value of x, and substitute in the equation. Then modify x and continue till we
More informationThis practice exam is intended to help you prepare for the final exam for MTH 142 Calculus II.
MTH 142 Practice Exam Chapters 9-11 Calculus II With Analytic Geometry Fall 2011 - University of Rhode Island This practice exam is intended to help you prepare for the final exam for MTH 142 Calculus
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 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 informationOrdinary Differential Equations (ODEs)
Ordinary Differential Equations (ODEs) 1 Computer Simulations Why is computation becoming so important in physics? One reason is that most of our analytical tools such as differential calculus are best
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 informationThe Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem Shixiong Wang 1*, Jianhua He 1, Chen Wang 2, Xitong Li 1
The Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem Shixiong Wang 1*, Jianhua He 1, Chen Wang 2, Xitong Li 1 1 School of Electronics and Information, Northwestern Polytechnical
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 information9.6 Predictor-Corrector Methods
SEC. 9.6 PREDICTOR-CORRECTOR METHODS 505 Adams-Bashforth-Moulton Method 9.6 Predictor-Corrector Methods The methods of Euler, Heun, Taylor, and Runge-Kutta are called single-step methods because they use
More informationODE Runge-Kutta methods
ODE Runge-Kutta methods The theory (very short excerpts from lectures) First-order initial value problem We want to approximate the solution Y(x) of a system of first-order ordinary differential equations
More informationDELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science
DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS ( WI3097 TU AESB0 ) Thursday April 6
More informationOrdinary 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.
More informationSolution of First Order Initial Value Problem by Sixth Order Predictor Corrector Method
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (2017), pp. 2277 2290 Research India Publications http://www.ripublication.com/gjpam.htm Solution of First Order Initial
More informationMathematics for chemical engineers. Numerical solution of ordinary differential equations
Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler
More informationSOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)
CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY (Approved by AICTE New Delhi, Affiliated to Anna University Chennai. Zamin Endathur Village, Madurntakam Taluk, Kancheepuram Dist.-603311.) MA6459 - NUMERICAL
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 informationTABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1. Chapter Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9
TABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1 Chapter 01.01 Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9 Chapter 01.02 Measuring errors 11 True error 11 Relative
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 informationNumerical Methods for Initial Value Problems; Harmonic Oscillators
1 Numerical Methods for Initial Value Problems; Harmonic Oscillators Lab Objective: Implement several basic numerical methods for initial value problems (IVPs), and use them to study harmonic oscillators.
More informationAN OVERVIEW. Numerical Methods for ODE Initial Value Problems. 1. One-step methods (Taylor series, Runge-Kutta)
AN OVERVIEW Numerical Methods for ODE Initial Value Problems 1. One-step methods (Taylor series, Runge-Kutta) 2. Multistep methods (Predictor-Corrector, Adams methods) Both of these types of methods are
More informationSRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY DEPARTMENT OF SCIENCE & HUMANITIES STATISTICS & NUMERICAL METHODS TWO MARKS UNIT-I HYPOTHESIS TESTING 1. What are the applications of distributions? * Test the hypothesis
More informationNumerical Solution of Differential Equations
1 Numerical Solution of Differential Equations A differential equation (or "DE") contains derivatives or differentials. In a differential equation the unknown is a function, and the differential equation
More informationCOSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods
COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:
More informationM.SC. PHYSICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student
More informationOrdinary 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
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 informationPrevious Year Questions & Detailed Solutions
Previous Year Questions & Detailed Solutions. The rate of convergence in the Gauss-Seidal method is as fast as in Gauss Jacobi smethod ) thrice ) half-times ) twice 4) three by two times. In application
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 informationResearch 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
More informationOrdinary 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
More informationWoods Hole Methods of Computational Neuroscience. Differential Equations and Linear Algebra. Lecture Notes
Woods Hole Methods of Computational Neuroscience Differential Equations and Linear Algebra Lecture Notes c 004, 005 William L. Kath MCN 005 ODE & Linear Algebra Notes 1. Classification of differential
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 information2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20
2.29 Numerical Fluid Mechanics Fall 2011 Lecture 20 REVIEW Lecture 19: Finite Volume Methods Review: Basic elements of a FV scheme and steps to step-up a FV scheme One Dimensional examples d x j x j 1/2
More informationComputational Techniques Prof. Dr. Niket Kaisare Department of Chemical Engineering Indian Institute of Technology, Madras
Computational Techniques Prof. Dr. Niket Kaisare Department of Chemical Engineering Indian Institute of Technology, Madras Module No. # 07 Lecture No. # 05 Ordinary Differential Equations (Refer Slide
More informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationSolving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations
Solving PDEs with PGI CUDA Fortran Part 4: Initial value problems for ordinary differential equations Outline ODEs and initial conditions. Explicit and implicit Euler methods. Runge-Kutta methods. Multistep
More informationExamination paper for TMA4130 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA4130 Matematikk 4N Academic contact during examination: Morten Nome Phone: 90 84 97 83 Examination date: 13 December 2017 Examination time (from
More informationA Variable-Step Double-Integration Multi-Step Integrator
A Variable-Step Double-Integration Multi-Step Integrator Matt Berry Virginia Tech Liam Healy Naval Research Laboratory 1 Overview Background Motivation Derivation Preliminary Results Future Work 2 Background
More informationmultistep 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
More informationNumerical Methods for the Solution of Differential Equations
Numerical Methods for the Solution of Differential Equations Markus Grasmair Vienna, winter term 2011 2012 Analytical Solutions of Ordinary Differential Equations 1. Find the general solution of the differential
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More information8.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
More informationSTATISTICS AND NUMERICAL METHODS
STATISTICS AND NUMERICAL METHODS Question IV November / December 2011 Part-A 1. The heights of college students in Chennai are normally distributed with standard deviation 6 cm and sample of 100 students
More informationMini project ODE, TANA22
Mini project ODE, TANA22 Filip Berglund (filbe882) Linh Nguyen (linng299) Amanda Åkesson (amaak531) October 2018 1 1 Introduction Carl David Tohmé Runge (1856 1927) was a German mathematician and a prominent
More information+ h4. + h5. 6! f (5) i. (C.3) Since., it yields
Appendix C. Derivation of the Numerical Integration Formulae C.1. Derivation of the Numerical Integration of dy(x) / dx = f (x) For a given analytical or taulated function f (x), the left column in Tale
More informationMath 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.
Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.8: 1b, 3b, 4 Burden & Faires 5.6. Multistep Methods 1. Use all the Adams-Bashforth
More informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationNUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A)
NUMERICAL ANALYSIS SYLLABUS MATHEMATICS PAPER IV (A) Unit - 1 Errors & Their Accuracy Solutions of Algebraic and Transcendental Equations Bisection Method The method of false position The iteration method
More information5. Ordinary Differential Equations. Indispensable for many technical applications!
Indispensable for many technical applications! Numerisches Programmieren, Hans-Joachim Bungartz page 1 of 30 5.1. Introduction Differential Equations One of the most important fields of application of
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 informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationExamination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N
Department of Mathematical Sciences Examination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N Academic contact during examination: Markus Grasmair Phone: 97 58 04 35 Code C): Basic calculator.
More informationOrdinary Differential Equations (ode)
Ordinary Differential Equations (ode) Numerical Methods for Solving Initial condition (ic) problems and Boundary value problems (bvp) What is an ODE? =,,...,, yx, dx dx dx dx n n 1 n d y d y d y In general,
More informationEuler s Method and Logistic Growth (BC Only)
Euler s Method Students should be able to: Approximate numerical solutions of differential equations using Euler s method without a calculator. Recognize the method as a recursion formula extension of
More informationLogistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations
Logistic Map, Euler & Runge-Kutta Method and Lotka-Volterra Equations S. Y. Ha and J. Park Department of Mathematical Sciences Seoul National University Sep 23, 2013 Contents 1 Logistic Map 2 Euler 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 informationSME 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SME 3023 Applied Numerical Methods Ordinary Differential Equations Abu Hasan Abdullah Faculty of Mechanical Engineering Sept 2012 Abu Hasan Abdullah (FME) SME 3023 Applied
More informationComputational Methods
Numerical Computational Methods Revised Edition P. B. Patil U. P. Verma Alpha Science International Ltd. Oxford, U.K. CONTENTS Preface List ofprograms v vii 1. NUMER1CAL METHOD, ERROR AND ALGORITHM 1 1.1
More informationSolving Ordinary Differential equations
Solving Ordinary Differential equations Taylor methods can be used to build explicit methods with higher order of convergence than Euler s method. The main difficult of these methods is the computation
More informationNumerical Analysis Exam with Solutions
Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the
More information10 Numerical Solutions of PDEs
10 Numerical Solutions of PDEs There s no sense in being precise when you don t even know what you re talking about.- John von Neumann (1903-1957) Most of the book has dealt with finding exact solutions
More informationSolving scalar IVP s : Runge-Kutta Methods
Solving scalar IVP s : Runge-Kutta Methods Josh Engwer Texas Tech University March 7, NOTATION: h step size x n xt) t n+ t + h x n+ xt n+ ) xt + h) dx = ft, x) SCALAR IVP ASSUMED THROUGHOUT: dt xt ) =
More informationNumerical Methods. Scientists. Engineers
Third Edition Numerical Methods for Scientists and Engineers K. Sankara Rao Numerical Methods for Scientists and Engineers Numerical Methods for Scientists and Engineers Third Edition K. SANKARA RAO Formerly,
More informationCS 257: Numerical Methods
CS 57: Numerical Methods Final Exam Study Guide Version 1.00 Created by Charles Feng http://www.fenguin.net CS 57: Numerical Methods Final Exam Study Guide 1 Contents 1 Introductory Matter 3 1.1 Calculus
More informationSKMM 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SKMM 3023 Applied Numerical Methods Ordinary Differential Equations ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Ordinary
More informationMecE 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
More informationOrdinary Differential Equations (ODEs)
Ordinary Differential Equations (ODEs) NRiC Chapter 16. ODEs involve derivatives wrt one independent variable, e.g. time t. ODEs can always be reduced to a set of firstorder equations (involving only first
More informationLecture Notes on Numerical Differential Equations: IVP
Lecture Notes on Numerical Differential Equations: IVP Professor Biswa Nath Datta Department of Mathematical Sciences Northern Illinois University DeKalb, IL. 60115 USA E mail: dattab@math.niu.edu URL:
More informationJim Lambers MAT 772 Fall Semester Lecture 21 Notes
Jim Lambers MAT 772 Fall Semester 21-11 Lecture 21 Notes These notes correspond to Sections 12.6, 12.7 and 12.8 in the text. Multistep Methods All of the numerical methods that we have developed for solving
More information