5.3 Higher-Order Taylor Methods

Slides:



Advertisements
Similar presentations
Formal Computational Skills
Advertisements

Chapter 6 Differential Equations
Section 11.6 – Taylor’s Formula with Remainder
Numerical Integration
Differential Equations Brannan Copyright © 2010 by John Wiley & Sons, Inc. All rights reserved. Chapter 08: Series Solutions of Second Order Linear Equations.
Chapter 7 Numerical Differentiation and Integration
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
Computational Methods in Physics PHYS 3437
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Ordinary Differential Equations Equations which are.
Ch 3.5: Nonhomogeneous Equations; Method of Undetermined Coefficients
Chapter 1 Introduction The solutions of engineering problems can be obtained using analytical methods or numerical methods. Analytical differentiation.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
Numerical solution of Differential and Integral Equations PSCi702 October 19, 2005.
Section 6.1: Euler’s Method. Local Linearity and Differential Equations Slope at (2,0): Tangent line at (2,0): Not a good approximation. Consider smaller.
Boyce/DiPrima 9th ed, Ch 8.4: Multistep Methods Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce and Richard.
Interpolation. Interpolation is important concept in numerical analysis. Quite often functions may not be available explicitly but only the values of.
Math 3120 Differential Equations with Boundary Value Problems
Infinite Series Copyright © Cengage Learning. All rights reserved.
1 Interpolation. 2 What is Interpolation ? Given (x 0,y 0 ), (x 1,y 1 ), …… (x n,y n ), find the value of ‘y’ at a.
Integration of 3-body encounter. Figure taken from
Engineering Analysis – Computational Fluid Dynamics –
CHAPTER 3 NUMERICAL METHODS
Lecture 16 - Approximation Methods CVEN 302 July 15, 2002.
Jump to first page Chapter 3 Splines Definition (3.1) : Given a function f defined on [a, b] and a set of numbers, a = x 0 < x 1 < x 2 < ……. < x n = b,
Section 9.7 – Taylor Theorem. Taylor’s Theorem Like all of the “Value Theorems,” this is an existence theorem.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 7 - Chapter 25.
Suppose we are given a differential equation and initial condition: Then we can approximate the solution to the differential equation by its linearization.
Chapter 5. Ordinary Differential Equation
Designing Parametric Cubic Curves 1. 2 Objectives Introduce types of curves ­Interpolating ­Hermite ­Bezier ­B-spline Analyze their performance.
Ch 8.2: Improvements on the Euler Method Consider the initial value problem y' = f (t, y), y(t 0 ) = y 0, with solution  (t). For many problems, Euler’s.
Ordinary Differential Equations
9.3 Taylor’s Theorem: Error Analysis yes no.
1/14  5.2 Euler’s Method Compute the approximations of y(t) at a set of ( usually equally-spaced ) mesh points a = t 0 < t 1
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
NUMERICAL DIFFERENTIATION or DIFFERENCE APPROXIMATION Used to evaluate derivatives of a function using the functional values at grid points. They are.
This chapter is concerned with the problem in the form Chapter 6 focuses on how to find the numerical solutions of the given initial-value problems. Main.
Copyright © Cengage Learning. All rights reserved Applications of Taylor Polynomials.
Keywords (ordinary/partial) differencial equation ( 常 / 偏 ) 微分方程 difference equation 差分方程 initial-value problem 初值问题 convex 凸的 concave 凹的 perturbed problem.
CHAPTER 3 NUMERICAL METHODS
Part 7 - Chapter 25.
Copyright © Cengage Learning. All rights reserved.
Boundary Element Analysis of Systems Using Interval Methods
Interpolation.
Ordinary Differential Equations
Chapter 22.
525602:Advanced Numerical Methods for ME
Interpolation.
Class Notes 18: Numerical Methods (1/2)
Numerical Solutions of Ordinary Differential Equations
Class Notes 19: Numerical Methods (2/2)
Class Notes 9: Power Series (1/3)
Taylor Polynomials & Approximation (9.7)
Chapter 7 Numerical Differentiation and Integration
Calculus BC AP/Dual, Revised © : Lagrange's Error Bound
Remainder of a Taylor Polynomial
Chapter 26.
Sec 21: Analysis of the Euler Method
Part 7 - Chapter 25.
POLYNOMIAL INTERPOLATION
Section 11.6 – Taylor’s Formula with Remainder
Numerical Analysis Lecture 19.
Numerical Analysis Lecture 37.
Numerical Analysis Lecture 2.
5.6 Multistep Methods The methods discussed to this point in the chapter are called one-step methods because the approximation for the mesh point involves.
Ch5 Initial-Value Problems for ODE
9.7 Taylor Polynomials & Approximations
Copyright © Cengage Learning. All rights reserved.
Chapter 2 A Survey of Simple Methods and Tools
Presentation transcript:

5.3 Higher-Order Taylor Methods Since the object of numerical techniques is to determine accurate approximations with minimal effort, we need a means for comparing the efficiency of various approximation methods. The first device we consider is called the local truncation error of the method. The local truncation error at a specified step measures the amount by which the exact solution to the differential equation fails to satisfy the difference equation being used for the approximation.

local truncation error Definition The difference method has local truncation error for each

local truncation error of Euler’s method For Euler’s method, the local truncation error at the i th step for the problem is where, as usual, denotes the exact value of the solution at . . We see that Euler’s method has When is known to be bounded by a constant M on [a,b] , this implies so the local truncation error in Euler’s method is .

local truncation error This error is local error because it measures the accuracy of the method at a specific step, assuming that the method was exact at the previous step. As such, it depends on the differential equation, the step size, and the particular step in the approximation.

Taylor method of order n Suppose the solution to the initial-value problem has continuous derivatives. If we expand the solution, , in terms of its nth Taylor polynomial about and evaluate at , we obtain

Taylor method of order n (5.15) Successive differentiation of the solution , gives , and, in general, Substituting these results into the nth Taylor polynomial gives (5.16)

Taylor method of order n (5.16) The difference-equation method corresponding to Eq. (5.16) is obtained by deleting the remainder term involving . This method is called the Taylor method of order n. where

Example 1 Example 1 Suppose that we want to apply Taylor’s method of order two and four to the initial-value problem Solution. We must find the first three derivative of

Example 1 The Taylor methods of order two is, consequently,

Example 1

Example 1 Suppose we need to determine an approximation to an intermediate point in the table, for example, at t=1.25. If we use linear interpolation on the Taylor method of order four approximations at t=1.2 and t=1.4,we have

Example 1 To improve the approximation to y(1.25) ,we use cubic Hermite interpolation. This requires approximations to and as well as approximations to and .

Example 1 The cubic Hermite polynomial is 1.2 3.1799640 2.7399640 2.7623405 2.7724321 0.1118825 0.0504580 -0.3071225 1.4 3.7324321 The cubic Hermite polynomial is

If Taylor’s method of order n is used to approximate the solution to with step size h and if , then the local truncation error is