Math-305, Numerical Methods & Matrices
Numerical Solution of 1st-Order Initial Value Problems

Dr. Kevin G. TeBeest

 
Here are the formulas for all the methods we studied from Explicit Euler through Classical Runge-Kutta.

Here are the formulas for the Runge–Kutta–Fehlberg Method.

  1. When using the Runge-Kutta-Fehlberg method, what should we do if Explain clearly in a complete and coherent sentence.

  2. Change your Euler method program (see the previous assignment) to make it the Modified Euler method.
    Then use it to solve the same sample problem we solved in class using a stepsize of h = 0.2.

  3. Change your program to make it the Classical Runge–Kutta method.
    Then use it to solve the same sample problem we solved in class using a stepsize of h = 0.2.

  4. Change your program to make it the Runge–Kutta–Fehlberg method.
    In this case also estimate the error at each node.
    Then use the program to solve the same sample problem we solved in class using a stepsize of h = 0.2.

Return to main index