Scribd
Upload
316 views4 pages

5.6 Multistep Methods (Cont'd) Example. Derive Adams-Bashforth Two-Step Explicit Method: Solve The IVP

The document discusses numerical methods for solving initial value problems (IVPs), including multistep methods like Adams-Bashforth. It derives the Adams-Bashforth two-step explicit method and discusses its local truncation error. It also discusses predictor-corrector methods, which combine explicit and implicit methods, such as a fourth-order predictor-corrector method combining Runge-Kutta, Adams-Bashforth, and Adams-Moulton. It defines consistency and convergence for numerical methods and shows Euler's method is both consistent and convergent. Finally, it discusses the stability of numerical methods and a theorem relating consistency, convergence, and stability.

Uploaded by

crazybobblaskey
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
316 views4 pages

5.6 Multistep Methods (Cont'd) Example. Derive Adams-Bashforth Two-Step Explicit Method: Solve The IVP

The document discusses numerical methods for solving initial value problems (IVPs), including multistep methods like Adams-Bashforth. It derives the Adams-Bashforth two-step explicit method and discusses its local truncation error. It also discusses predictor-corrector methods, which combine explicit and implicit methods, such as a fourth-order predictor-corrector method combining Runge-Kutta, Adams-Bashforth, and Adams-Moulton. It defines consistency and convergence for numerical methods and shows Euler's method is both consistent and convergent. Finally, it discusses the stability of numerical methods and a theorem relating consistency, convergence, and stability.

Uploaded by

crazybobblaskey
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

5.6 Multistep Methods(contd) Example.

Derive Adams-Bashforth two-step explicit method: Solve the IVP: ( ) over Integrate ) ( Use ( approximate ( ). ( ) ( ( ))

( )

) to form interpolating polynomial ( ) [ ( ( ( ) ) ( (

( ) (by Newton backward difference (Page 129)) to ( ) ( ( ( ) ( ) ))] ) ( )) )

) where and the backward difference ( Consequently, Adams-Bashforth two-step explicit method is: ( Local Truncation Error. If ( ) solves the IVP ( ( the local truncation error is ( ) ( ) ( ) ( ) ( ) ) ) ) ( ( ) ) ( ) )

( ) )

and

))

( ))

NOTE: the local truncation error of a m-step explicit step is ( the local truncation error of a m-step implicit step is (

Predictor-Corrector Method Motivation: (1) Solve the IVP Solution: The three-step Adams-Moulton method is ( ) by the three-step Adams-Moulton method. ( ) ( ) can be solved by Newtons method. However, this can be quite computationally expensive. (2) combine explicit and implicit methods. 4th order Predictor-Corrector Method (we will combine 4th order Runge-Kutta method + 4th order 4-step explicit Adams-Bashforth method + 4th order three-step Adams-Moulton implicit method) Step 1: Use 4th order Runge-Kutta method to compute Step 2: For (a) Predictor sub-step. Use 4th order 4-step explicit Adams-Bashforth method to compute a predicated value ( ) ( ) ( ) ( )

(b) Correction sub-step. Use 4th order three-step Adams-Moulton implicit method to compute a correction (the approximation at time step) ( ) ( ) ( ) ( )

5.10 Stability Consistency and Convergence Definition. A one-step difference equation with local truncation error ( ) ( ) is said to be consistent if

Definition. A one-step difference equation is said to be convergent if ( ) where ( ) is the exact solution and is the approximate solution.

( ) ( ) ( ) ( ) be continuous and satisfy a Lipschitz Example. To solve . Let condition with Lipschitz constant . Show that Eulers method is consistent and convergent. Solution: ( ) ( ) Thus Eulers method is consistent. By Theorem 5.9, ( ) ( ) Thus Eulers method is convergent. The rate of convergence of Eulers method is ( ) [
( ( ) )

( )

Stability Motivation: How does round-off error affect approximation? To solve IVP method. Suppose is the round-off error associated with each step. ( Then ( ) ( )[
( )

( )

by Eulers

)
( )

. Here )

Stability: small changes in the initial conditions produce correspondingly small changes in the subsequent approximations. Convergence of One-Step Methods ( Theorem. Suppose the IVP form

( )

is approximated by a one-step difference method in the

Suppose also that

exists and ( {(

( ) ) is continuous with a Lipschitz condition in )

with constant

on

then

(1) The method is stable; (2) The method is convergent if and only if it is consistent: ( ) ( ) (3) If exists s.t. ( ) ( ) when then ( )

( )

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy