Difference between revisions of "GRAPHING"
Jump to navigation
Jump to search
(Created page with "ghgdsd") |
|||
| Line 1: | Line 1: | ||
| − | + | <div style="font-size:30px">'''RUNGE-KUTTA'''</div><br/> | |
| + | |||
| + | ==Description== | ||
| + | |||
| + | *The Runge-Kutta method is a set of implicit and explicit iterative methods. | ||
| + | *The most widely known method is RK4. | ||
| + | *This function gives the approximate solutions to ordinary differential equations. | ||
| + | |||
| + | ==ZOS== | ||
| + | |||
| + | RUNGEKUTTA(x0,y0,xn,n,f) | ||
| + | |||
| + | x0 - Initial value of x | ||
| + | y0 - Value of y at x0 | ||
| + | xn - Value at which y has to be calculated | ||
| + | n - Number of intermediate values between x0 and xn. | ||
| + | step-length (h) = (xn-x0)/n | ||
| + | |||
| + | *For example, | ||
| + | '''If we have f(x,y(x)) = (dy/dx) = 1-xy. Find y(1).''' | ||
| + | '''where y(0) = 1 with one step''' | ||
Revision as of 12:20, 26 May 2020
RUNGE-KUTTA
Description
- The Runge-Kutta method is a set of implicit and explicit iterative methods.
- The most widely known method is RK4.
- This function gives the approximate solutions to ordinary differential equations.
ZOS
RUNGEKUTTA(x0,y0,xn,n,f)
x0 - Initial value of x y0 - Value of y at x0 xn - Value at which y has to be calculated n - Number of intermediate values between x0 and xn. step-length (h) = (xn-x0)/n
- For example,
If we have f(x,y(x)) = (dy/dx) = 1-xy. Find y(1). where y(0) = 1 with one step