THE MOST ON DOCSITY
Find users

Runge Kutta Method, Lecture Notes - Advanced Calculus

Calculus

Post: October 5th, 2011
Description
Second Order Runge-Kutta Method, Computation, Solutions, Forth-order Runge-Kutta Method, Formulation, Multi-step Methods
Second Order Runge-Kutta Method, Computation, Solutions, Forth-order Runge-Kutta Method, Formulation, Multi-step Methods
-
Embed this document

Report Report

Reason:

Send Message

Login or register to download this document!

If you are already registered, login otherwise Register , it just takes 1 minute!

Uploaded by:

deville

deville
Universityuni_5documents_40doc_answ
Embed this document
Get the App
Contents
Runge-Kutta Method Adrian Down April 25, 2006 1 1.1 Second-order Runge-Kutta method Review Last time, we began to develop methods to obtain approximate solutions to the differential equation x = f (t, x(t)) with error of O(h2 ), where h is the ˙ spacing of the mesh used to calculate the approximation. To construct these methods, our goal was to minimize the local truncation error. We saw that, in general, the global truncation error should be one order less in h. Last time, we introduced an approximation that generalized the Modified Euler method. The general form of the expression was, y(t + h) − y(t) = ω1 hF (t) + ω2 hf (t + αh, y(t) + βhF (t)) where F (t) ≡ f (t, y(t)). Our proposal was to choose ω1 , ω2 , α and β such that the local truncation error of the approximation is O(h3 ), from which we expect the desired global truncation error to be O(h2 ). 1.2 Computation We began to evaluate this condition last time by Taylor expanding the function f up to second or..

Docsity.com

Learning becomes social!

Authentication required

This feature is reserved for registered user

Register Login

Docsity.com

Learning becomes social!

Authentication required

Hi!
In order to freely download all the documents on Docsity, please register or login:

Register Login