Exercises, module A (ODEs, numerical integration etc)
|
|
- Arnold Robertson
- 5 years ago
- Views:
Transcription
1 FYTN HT18 Dept. of Astronomy and Theoretical Physics Lund University, Sweden Exercises, module A (ODEs, numerical integration etc) 1. Use Euler s method to solve y (x) = y(x), y() = 1. (a) Determine y after n steps of size h, y n. What is the exact solution? (b) For which values of h is the sequence y,y 1,... bounded? (c) Let y(x,h) denote the estimate of y(x) obtained for step size h. Determine the global error y(x,h) y(x) to leading order in h, for fixed x.. Solve the initial value problem y (x) = xy(x), y() = 1. What is the analytic solution? Use the nd order Runge-Kutta with a = b = 1/ and m = 1 and step size h =.. Compare the results from the Runge-Kutta method with the exact result at time t = h. What is the relative error? Compare also to the relative error obtained using the Euler method.. Use the Euler-Maclaurin summation formula to show that n m = 1 n(n+1) and n m = 1 6 n(n+1)(n+1) 4. Calculate 4 dx x with the trapezoidal rule for the step sizes.5,.5 och.15. Improve the values by Richardson extrapolation. 5. Calculate the integral in exercise 4 by using two-point Gaussian integration, after a change of variable to t = x Determine an integration formula of the type f(x)(1+x )dx A 1 f(x 1 )+A f(x ) that is exact for all polynomials with degree less than Consider the boundary value problem y (x) y(x) = with y() = and y(1) = sinh(1). What is theanalytic solution? Solve this problemusingthe matrix methodwith a step size h =.5 (this gives -equation system to be diagonalized). Compare your numerical solution to the analytic result.
2 Solutions 1. Use Euler s method to solve y (x) = y(x), y() = 1. (a) Determine y after n steps of size h, y n. What is the exact solution? Solution: Theanalytic solution is y(x) = e x - we look for afunction whosederivative is proportional to itself, this is clearly an exponential function. If we would rather want to derive this result, note that the equation above can be written y (x)/y(x) =, or equivalently dln[y(x)]/dx =. Integrating from to x on both sides give ln[y(x)] = x, or, y(x) = e x. Let us now turn to the Euler algorithm. Discretizing x via x n = nh with a step-size h and defining y n = y(x n ), the Euler algorithm becomes: y = 1 y 1 y(+h) = 1 h y y(+h) = (1 h) y n y(+nh) = (1 h) n (b) For which values of h is the sequence y,y 1,... bounded? Solution: A bounded sequence is one for which, for all n [, ], y n remains finite. So for our case, where y n = (1 h) n, we must require h. (c) Let y(x,h) denote the estimate of y(x) obtained for step size h. Determine the global error y(x,h) y(x) to leading order in h, for fixed x. Solution: Using the fact that n = x/h, we write y n = y(x,h) = (1 h) x/h. Note that we have y(x,h) = exp[lny(x,h)] = exp[(x/h)ln(1 h)], so that using the Taylor expansion of the logarithm ln[1+z] z z /, we have y(x,h) exp[ x(1+h/)] exp( x) = y(x,h = ) = y(x) when h as it should. We now proceed by Taylor expanding the the approximate solution, y(x, h), for small h according to y(x,h) = y(x,h = )+h dy(x,h) h= +... dh Using the fact that (use the Taylor expansion of the logarithm to second order and 1/(1+z) 1 z for small z below) ( dy(x, h) = (1 h) x/h x dh h(1 h) + xln(1 h) ) h xe x / as h and that y(x,h = ) = y(x) we find y(x,h) y(x) h xe x /+O(h ) i.e. the global error scales linearly with h as it should for the Euler algorithm. Note that we here, besides the correct scaling with h, also calculated an explicit expression for the prefactor in the global error estimate.
3 . Solve the initial value problem y (x) = xy(x), y() = 1. What is the analytic solution? Use the nd order Runge-Kutta with a = b = 1/ and m = 1 and step size h =.. Compare the results from the Runge-Kutta method with the exact result at time t = h. What is the relative error? Compare also to the relative error obtained using the Euler method. Solution: We write y (x) = f(x,y(x)) with f(x,y(x)) = xy(x). The analytic solution is y(x) = exp( x /). as can be derived using the integrating factor method, for instance. The nd order Runge-Kutta method is k 1 = hf(x n,y n ) k = hf(x n +mh,y n +mk 1 ) y n+1 = y n +ak 1 +bk where y n = y(x n ) and x n = nh. The first iteration gives: k 1 = hx y =. 1 = k = h(x +mh)(y +mk 1 ) = (.) =.4 y 1 = y +ak 1 +bk =.98 with a = b = 1/ and m = 1. The second iteration is: k 1 = hx 1 y 1 =...98 =.9 k = h(x 1 +mh)(y 1 +mk 1 ) =..4 (.98.9).75 y = y 1 +ak 1 +bk.9 Comparing this to the exact expression we find a relative error If we instead use the Euler method, which for the present problem becomes: y n+1 = y n hx n y n = (1 hx n )y n, we find: y 1 = (1 hx )y = 1 y = (1 hx 1 )y 1 = (1..) 1 =.96 this gives a relative error 4 1 compared to the analytic solution.. Use the Euler-Maclaurin summation formula to show that n m = 1 n(n+1) and n m = 1 6 n(n+1)(n+1) Solution: Using h = 1 in the Euler-Maclaurin formula gives us f() + n f(m)+ f(n) n = f(m)dm+ c k k=1 with c k = B k (k)! (f(k) (n) f (k) ())
4 and where B i are the Bernoulli numbers (B = 1, B = 1/6, B 4 = /,...). So in the first sum, we use f(m) = m. The integral gives n / and we need to add f(n)/ = n/. The first derivative of f is constant and all higher derivatives are zero so all c k vanish and the result is n(n+1)/. In the second sum we use f(m) = m. The integral becomes n / and we add f(n)/ = n /. The derivative of f is m and the B = 1/6 so we need to add c 1 = 1/6! (n ), all other c k vanish. The result is n(n+1)(n+1)/6. 4. Calculate the integral 4 dx I = x with the trapezoidal rule for the step sizes.5,.5 och.15. Improve the values by Richardson extrapolation. Solution: The exact answer is ln() ln(1) = ln().69. Discretizing x between the integration limits as x = x n (n =,1,...,N) where x = and x N = 4 and defining f n = f(x n ) the trapezoidal method is: Thus, ( f1 I trapz (h) h +f +f f ) N. ( f() I trapz (.5) =.5 ( f() I trapz (.5) =.5 +f(.5)+ f(4) ).78, +f(.5)+f(.5)+f(.75)+ f(4) ).697. ( f() I trapz (.15) =.15 +f(.15)+f(.5)+f(.75)+f(.5)+f(.65) +f(.75)+f(.875) + f(4) ) The relative errors compared to the exact result are. and.56 respectively. Using one Richardson extrapolation step we get the improved estimates of the integral I: and Î(.5) = 4I trapz(.5) I trapz (.5).695 Î(.15) = 4I trapz(.15) I trapz (.5).6915 Two Richardson extrapolation steps yields: ˆÎ = 16Î(.15) Î(.5) with a relative error 1 6, i.e. a result very close to the exact one. 5. Calculate the integral in exercise 4 by using two-point Gaussian integration, after a change of variable to t = x 7. Solution: After the suggested change of variables the integral becomes I = dt t+
5 i.e. on the form given in ODE lectures 4 and 5. Using the explicit formula derived there: 1 I 1/ /+ giving a relative error of.1 compared to the exact result. 6. Determine an integration formula of the type f(x)(1+x )dx A 1 f(x 1 )+A f(x ) that is exact for all polynomials with degree less than 4. Solution: We need the corresponding second order orthogonal polynomial, and we use the Gram-Schmidt method with w(x) = 1+x. As always φ = 1. φ 1 = x φ x φ φ φ = x φ = x φ 1 x φ 1 φ 1 φ 1 φ x φ φ φ = x 5 So the zeros are ± /5. Inserting f(x) = 1 gives (x +1)dx = 8 = A 1 +A and f(x) = x gives So A 1 = A = 4/ and x(x +1)dx = = A 1 ( /5)+A ( /5) f(x)(1+x )dx 4 f( /5)+ 4 f( /5) is exact for all polynomials with degree less than Consider the boundary value problem y (x) y(x) = with y() = and y(1) = sinh(1). What is theanalytic solution? Solve this problemusingthe matrix methodwith a step size h =.5 (this gives -equation system to be diagonalized). Compare your numerical solution to the analytic result. Solution: The analytic solution is: y(x) = sinh(x) Discretizing y (x) y(x) = gives y n+1 (+h )y n +y n for n = 1,,. The boundary condition becomes: y = and y 4 = sinh(1). Or, on matrix form, A y = b, we have (+h ) 1 A = 1 (+h ) 1 1 (+h ) and b = sinh(1) Comparing the solution of this equation system to the exact result we find that the relative errors for x n =.5,.5 and.75 are roughly , and respectively.
Integration 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 informationEXAMPLE OF ONE-STEP METHOD
EXAMPLE OF ONE-STEP METHOD Consider solving y = y cos x, y(0) = 1 Imagine writing a Taylor series for the solution Y (x), say initially about x = 0. Then Y (h) = Y (0) + hy (0) + h2 2 Y (0) + h3 6 Y (0)
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 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 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 informationSecond Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177
Second Order ODEs Often physical or biological systems are best described by second or higher-order ODEs. That is, second or higher order derivatives appear in the mathematical model of the system. For
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 informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
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 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 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 informationTHE TRAPEZOIDAL QUADRATURE RULE
y 1 Computing area under y=1/(1+x^2) 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Trapezoidal rule x THE TRAPEZOIDAL QUADRATURE RULE From Chapter 5, we have the quadrature
More information11.10a Taylor and Maclaurin Series
11.10a 1 11.10a Taylor and Maclaurin Series Let y = f(x) be a differentiable function at x = a. In first semester calculus we saw that (1) f(x) f(a)+f (a)(x a), for all x near a The right-hand side of
More informationDegree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m.
Degree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m. Candidates should submit answers to a maximum of four
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationExamples of solutions to the examination in Computational Physics (FYTN03), October 24, 2016
Examples of solutions to the examination in Computational Physics (FYTN3), October 4, 6 Allowed calculation aids: TEFYMA or Physics Handbook. The examination consists of eight problems each worth five
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 informationDifferential Equations
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
More informationChecking the Radioactive Decay Euler Algorithm
Lecture 2: Checking Numerical Results Review of the first example: radioactive decay The radioactive decay equation dn/dt = N τ has a well known solution in terms of the initial number of nuclei present
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationHomework #3 Solutions
Homework #3 Solutions Math 82, Spring 204 Instructor: Dr. Doreen De eon Exercises 2.2: 2, 3 2. Write down the heat equation (homogeneous) which corresponds to the given data. (Throughout, heat is measured
More informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
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 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 informationMath 113 (Calculus 2) Exam 4
Math 3 (Calculus ) Exam 4 November 0 November, 009 Sections 0, 3 7 Name Student ID Section Instructor In some cases a series may be seen to converge or diverge for more than one reason. For such problems
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 informationSolutions to Assignment-11
Solutions to Assignment-. (a) For any sequence { } of positive numbers, show that lim inf + lim inf an lim sup an lim sup +. Show from this, that the root test is stronger than the ratio test. That is,
More informationSYSTEMS OF ODES. mg sin ( (x)) dx 2 =
SYSTEMS OF ODES Consider the pendulum shown below. Assume the rod is of neglible mass, that the pendulum is of mass m, and that the rod is of length `. Assume the pendulum moves in the plane shown, and
More informationModule Two: Differential Calculus(continued) synopsis of results and problems (student copy)
Module Two: Differential Calculus(continued) synopsis of results and problems (student copy) Srikanth K S 1 Syllabus Taylor s and Maclaurin s theorems for function of one variable(statement only)- problems.
More informationLECTURE 14: REGULAR SINGULAR POINTS, EULER EQUATIONS
LECTURE 14: REGULAR SINGULAR POINTS, EULER EQUATIONS 1. Regular Singular Points During the past few lectures, we have been focusing on second order linear ODEs of the form y + p(x)y + q(x)y = g(x). Particularly,
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 informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More informationi x i y i
Department of Mathematics MTL107: Numerical Methods and Computations Exercise Set 8: Approximation-Linear Least Squares Polynomial approximation, Chebyshev Polynomial approximation. 1. Compute the linear
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 informationInitial Value Problems
Numerical Analysis, lecture 13: Initial Value Problems (textbook sections 10.1-4, 10.7) differential equations standard form existence & uniqueness y 0 y 2 solution methods x 0 x 1 h h x 2 y1 Euler, Heun,
More informationMultiplicative Runge-Kutta Methods
Multiplicative Runge-Kutta Methods Hatice Aktöre Submitted to the Institute of Graduate Studies and Research in partial fulfillment of the requirements for the Degree of Master of Science in Applied Mathematics
More informationSeries Solutions of Differential Equations
Chapter 6 Series Solutions of Differential Equations In this chapter we consider methods for solving differential equations using power series. Sequences and infinite series are also involved in this treatment.
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationTaylor Series. richard/math230 These notes are taken from Calculus Vol I, by Tom M. Apostol,
Taylor Series Professor Richard Blecksmith richard@math.niu.edu Dept. of Mathematical Sciences Northern Illinois University http://math.niu.edu/ richard/math230 These notes are taken from Calculus Vol
More informationFINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations.
FINITE DIFFERENCES Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. 1. Introduction When a function is known explicitly, it is easy
More informationChap. 19: Numerical Differentiation
Chap. 19: Numerical Differentiation Differentiation Definition of difference: y x f x x i x f x i As x is approaching zero, the difference becomes a derivative: dy dx lim x 0 f x i x f x i x 2 High-Accuracy
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 informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
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 informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
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 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 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 informationPrinciples of Scientific Computing Local Analysis
Principles of Scientific Computing Local Analysis David Bindel and Jonathan Goodman last revised January 2009, printed February 25, 2009 1 Among the most common computational tasks are differentiation,
More informationMTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.
MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:
More informationReview: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function.
Taylor Series (Sect. 10.8) Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function. Review: Power series define functions Remarks:
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 informationRegression and Nonlinear Axes
Introduction to Chemical Engineering Calculations Lecture 2. What is regression analysis? A technique for modeling and analyzing the relationship between 2 or more variables. Usually, 1 variable is designated
More informationEngg. Math. I. Unit-I. Differential Calculus
Dr. Satish Shukla 1 of 50 Engg. Math. I Unit-I Differential Calculus Syllabus: Limits of functions, continuous functions, uniform continuity, monotone and inverse functions. Differentiable functions, Rolle
More informationChapter 4 Sequences and Series
Chapter 4 Sequences and Series 4.1 Sequence Review Sequence: a set of elements (numbers or letters or a combination of both). The elements of the set all follow the same rule (logical progression). The
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Multidimensional Unconstrained Optimization Suppose we have a function f() of more than one
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More information4.4 Computing π, ln 2 and e
252 4.4 Computing π, ln 2 and e The approximations π 3.1415927, ln 2 0.69314718, e 2.7182818 can be obtained by numerical methods applied to the following initial value problems: (1) y = 4, 1 + x2 y(0)
More information= D ( )( ) derivative
> restart; In this worksheet we are going to be considering the numeric solution of the following differential equation: > ode diff(y(x,x f(x,y(x; d ode dx y( x f ( x, y( x Here, f is taken to be a known
More informationHigher order derivatives of the inverse function
Higher order derivatives of the inverse function Andrej Liptaj Abstract A general recursive and limit formula for higher order derivatives of the inverse function is presented. The formula is next used
More informationOR MSc Maths Revision Course
OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
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 informationExplicit One-Step Methods
Chapter 1 Explicit One-Step Methods Remark 11 Contents This class presents methods for the numerical solution of explicit systems of initial value problems for ordinary differential equations of first
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationEquations with regular-singular points (Sect. 5.5).
Equations with regular-singular points (Sect. 5.5). Equations with regular-singular points. s: Equations with regular-singular points. Method to find solutions. : Method to find solutions. Recall: The
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationPhysics 115/242 Romberg Integration
Physics 5/242 Romberg Integration Peter Young In this handout we will see how, starting from the trapezium rule, we can obtain much more accurate values for the integral by repeatedly eliminating the leading
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 informationStudy Guide/Practice Exam 3
Study Guide/Practice Exam 3 This study guide/practice exam covers only the material since exam. The final exam, however, is cumulative so you should be sure to thoroughly study earlier material. The distribution
More informationExtrapolation in Numerical Integration. Romberg Integration
Extrapolation in Numerical Integration Romberg Integration Matthew Battaglia Joshua Berge Sara Case Yoobin Ji Jimu Ryoo Noah Wichrowski Introduction Extrapolation: the process of estimating beyond the
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE712B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationMultiple Choice Review Problems
Multiple Choice Review Problems 1. (NC) Which graph best represents the position of a particle, st ( ), as a function of time, if the particle's velocity is negative and the particle's acceleration is
More informationSolutions: Problem Set 3 Math 201B, Winter 2007
Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If
More information3 Applications of partial differentiation
Advanced Calculus Chapter 3 Applications of partial differentiation 37 3 Applications of partial differentiation 3.1 Stationary points Higher derivatives Let U R 2 and f : U R. The partial derivatives
More informationChapter 1. Numerical Errors. Module No. 3. Operators in Numerical Analysis
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-71309 email: anita.buie@gmail.com . Chapter 1 Numerical Errors Module
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 information1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal
. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal 3 9 matrix D such that A = P DP, for A =. 3 4 3 (a) P = 4, D =. 3 (b) P = 4, D =. (c) P = 4 8 4, D =. 3 (d) P
More informationLecture 4: Extended Kalman filter and Statistically Linearized Filter
Lecture 4: Extended Kalman filter and Statistically Linearized Filter Department of Biomedical Engineering and Computational Science Aalto University February 17, 2011 Contents 1 Overview of EKF 2 Linear
More informationStudy # 1 11, 15, 19
Goals: 1. Recognize Taylor Series. 2. Recognize the Maclaurin Series. 3. Derive Taylor series and Maclaurin series representations for known functions. Study 11.10 # 1 11, 15, 19 f (n) (c)(x c) n f(c)+
More informationLecture Notes on. Differential Equations. Emre Sermutlu
Lecture Notes on Differential Equations Emre Sermutlu ISBN: Copyright Notice: To my wife Nurten and my daughters İlayda and Alara Contents Preface ix 1 First Order ODE 1 1.1 Definitions.............................
More informationECONOMICS 207 SPRING 2006 LABORATORY EXERCISE 5 KEY. 8 = 10(5x 2) = 9(3x + 8), x 50x 20 = 27x x = 92 x = 4. 8x 2 22x + 15 = 0 (2x 3)(4x 5) = 0
ECONOMICS 07 SPRING 006 LABORATORY EXERCISE 5 KEY Problem. Solve the following equations for x. a 5x 3x + 8 = 9 0 5x 3x + 8 9 8 = 0(5x ) = 9(3x + 8), x 0 3 50x 0 = 7x + 7 3x = 9 x = 4 b 8x x + 5 = 0 8x
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More informationMA 162 FINAL EXAM PRACTICE PROBLEMS Spring Find the angle between the vectors v = 2i + 2j + k and w = 2i + 2j k. C.
MA 6 FINAL EXAM PRACTICE PROBLEMS Spring. Find the angle between the vectors v = i + j + k and w = i + j k. cos 8 cos 5 cos D. cos 7 E. cos. Find a such that u = i j + ak and v = i + j + k are perpendicular.
More informationMath Real Analysis II
Math 4 - Real Analysis II Solutions to Homework due May Recall that a function f is called even if f( x) = f(x) and called odd if f( x) = f(x) for all x. We saw that these classes of functions had a particularly
More informationPolytechnic Institute of NYU MA 2132 Final Practice Answers Fall 2012
Polytechnic Institute of NYU MA Final Practice Answers Fall Studying from past or sample exams is NOT recommended. If you do, it should be only AFTER you know how to do all of the homework and worksheet
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
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 informationMath Exam 2, October 14, 2008
Math 96 - Exam 2, October 4, 28 Name: Problem (5 points Find all solutions to the following system of linear equations, check your work: x + x 2 x 3 2x 2 2x 3 2 x x 2 + x 3 2 Solution Let s perform Gaussian
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationComputational Methods CMSC/AMSC/MAPL 460. Ordinary differential equations
/0/0 Computational Methods CMSC/AMSC/MAPL 460 Ordinar differential equations Ramani Duraiswami Dept. of Computer Science Several slides adapted from Profs. Dianne O Lear and Eric Sandt TAMU Higher Order
More informationProblem Sheet 0: Numerical integration and Euler s method. If you find any typos/errors in this problem sheet please
Problem Sheet 0: Numerical integration and Euler s method If you find any typos/errors in this problem sheet please email jk08@ic.ac.uk. The material in this problem sheet is not examinable. It is merely
More informationSome Applications of the Euler-Maclaurin Summation Formula
International Mathematical Forum, Vol. 8, 203, no., 9-4 Some Applications of the Euler-Maclaurin Summation Formula Rafael Jakimczuk División Matemática, Universidad Nacional de Luján Buenos Aires, Argentina
More informationMath 104: l Hospital s rule, Differential Equations and Integration
Math 104: l Hospital s rule, and Integration Ryan Blair University of Pennsylvania Tuesday January 22, 2013 Math 104:l Hospital s rule, andtuesday Integration January 22, 2013 1 / 8 Outline 1 l Hospital
More informationComputation Fluid Dynamics
Computation Fluid Dynamics CFD I Jitesh Gajjar Maths Dept Manchester University Computation Fluid Dynamics p.1/189 Garbage In, Garbage Out We will begin with a discussion of errors. Useful to understand
More informationMATLAB Laboratory 10/14/10 Lecture. Taylor Polynomials
MATLAB Laboratory 10/14/10 Lecture Taylor Polynomials Lisa A. Oberbroeckling Loyola University Maryland loberbroeckling@loyola.edu L. Oberbroeckling (Loyola University) MATLAB 10/14/10 Lecture 1 / 7 Taylor/Maclaurin
More informationNotation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i
LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent
More informationMTH603 FAQ + Short Questions Answers.
Absolute Error : Accuracy : The absolute error is used to denote the actual value of a quantity less it s rounded value if x and x* are respectively the rounded and actual values of a quantity, then absolute
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 information