Fortran Programming
Numerical Methods
- Bisection Method
- Regula Falsi (False Position)
- Newton Raphson Method
- Secant method
- Newton Raphson – Non-Linear Equations
- Gauss Elimination Method
- Gauss Elimination Method (With Pivoting)
- Gauss Jordan Method
- Gauss Elimination – Determinant
- Gauss Jordan – Inverse Matrix
- Lagrange Interpolation
- Newton Divided Interpolation
- Newton Forward Interpolation
- Least Square Fitting
- Trapezoidal Rule
- Simpson 1/3rd Rule
- Simpson 3/8 Rule
- Euler’s Method
- Euler’s Modified Method
- Runge Kutta’s (2nd Order)
- Runge Kutta’s (4th Order)
Fortran CodePROGRAM euler_modified_method IMPLICIT NONE REAL::x0=0,y0=-1,x,x1,f,h,y1,y2 x1=x0 y1=y0 PRINT *,'====================================================' PRINT *,"Program for Euler’s modified method [www.BottomScience.com]" PRINT *,'====================================================' PRINT *,'Step size (h)?' READ(*,*)h PRINT *,'value?' READ(*,*)x PRINT *,x1,y1 DO WHILE (x1<x) y2=y1+(h*f(x1,y1)) !Modification y2=y1+(0.5*h)*(f(x1,y1)+f(x1+h,y2)) PRINT *,x1+h,y2 x1=x1+h y1=y2 END DO END PROGRAM REAL function f(x1,y1) REAL::x1,y1 f=-2*(x1)-y1 return end function |
Fortran Programming
Numerical Methods
- Bisection Method
- Regula Falsi (False Position)
- Newton Raphson Method
- Secant method
- Newton Raphson – Non-Linear Equations
- Gauss Elimination Method
- Gauss Elimination Method (With Pivoting)
- Gauss Jordan Method
- Gauss Elimination – Determinant
- Gauss Jordan – Inverse Matrix
- Lagrange Interpolation
- Newton Divided Interpolation
- Newton Forward Interpolation
- Least Square Fitting
- Trapezoidal Rule
- Simpson 1/3rd Rule
- Simpson 3/8 Rule
- Euler’s Method
- Euler’s Modified Method
- Runge Kutta’s (2nd Order)
- Runge Kutta’s (4th Order)