Scribd
Upload
22 views

Runge-Kutta Method - Numeric Method

Deriv Trading

Uploaded by

into.mafi
Copyright
© © All Rights Reserved
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
22 views

Runge-Kutta Method - Numeric Method

Deriv Trading

Uploaded by

into.mafi
Copyright
© © All Rights Reserved
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

4/12/2017 Runge­Kutta Method ­ Numeric Method

Search this site

Home About Numerical Methods > Ordinary Differential Equations


About Numerical Methods >
Curve Fitting
Numerical Differentiation
Runge‐Kutta Method
Numerical Integration
Ordinary Differential Equations
The Euler method uses the first order Taylor series to
Partial Differential Equations
Roots of Equations find the next value of the ordinary differential
System of Linear Equations
equation. Therefore, this method is not very accurate.
System of Nonlinear Equations
Company To achieve higher accuracy, Runge­Kutta method
Contact us employs higher order terms of the Taylor series in its
Products
Engineering Software
approximation. For example the second order Runge­
Numeric Basic Kutta method uses the Taylor series up to he second
Services
Engineering Design
order term.
Engineering Simulation
Software Design
Sitemap

where,

Using the mathematical relations, it can be


demonstrated that the above equation can be written
in the following form:

where,

http://www.numericmethod.com/About­numerical­methods/ordinary­differential­equations/runge­kutta­method 1/4
4/12/2017 Runge­Kutta Method ­ Numeric Method

A1, A2, P1 and Q11 are some constant which can be


obtained from following system of equations:

It is clear that the number of unknowns are more than


the number of equations. Therefore, a series of
solution can be found for these constants.
For A1 = A2 = ½ and P1 = Q11 = 1 the general
Runge­Kutta method is transformed to the following
form:

This method is known as Heun’s method with single


corrector.
For A1 =0, A2 = 1 and P1 = Q11 = ½ the general
Runge­Kutta method can be written as follows:

This method is known as improved polygon method.

http://www.numericmethod.com/About­numerical­methods/ordinary­differential­equations/runge­kutta­method 2/4
4/12/2017 Runge­Kutta Method ­ Numeric Method

For A1 =1/3, A2 = 2/3 and P1 = Q11 = ¾, the


Ralston’s method can be obtained:

The order of all above methods is O(h2). The


algorithm of the Heun’s method can written as
follows:

Step 1: Choose initial point (x0,y0) and end point xn.


Step 2: For i=1 to n do steps 3,6.
Step 3: xi = x0 + ih.
Step 4: k1 = f(xi­1 , yi­1).
Step 5: k2 = f(xi , yi­1 + hk1).
Step 6: yi = yi­1 + h(k1 + k2)/2.
Step 5: End.

Ordinary Differential Equations

(Source Code in
C++)
o Euler
Method

o Runge­Kutta Method

http://www.numericmethod.com/About­numerical­methods/ordinary­differential­equations/runge­kutta­method 3/4
4/12/2017 Runge­Kutta Method ­ Numeric Method

Comments

Sign in | Report Abuse | Print Page | Powered By Google Sites

http://www.numericmethod.com/About­numerical­methods/ordinary­differential­equations/runge­kutta­method 4/4

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