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)
REAL function f(x1)
REAL::x1
f=0.2+(25*x1)-200*(x1**2)+675*(x1**3)-900*(x1**4)+400*(x1**5)
RETURN
END FUNCTION
PROGRAM simpson13
IMPLICIT NONE
INTEGER::i,n
REAL::x0,xn,h,s,f
PRINT *,'================'
PRINT *,'SIMPSON 1/3RD'
PRINT *,'================'
PRINT *,'Enter value of lower limit a?'
READ(*,*)x0
PRINT *,'Enter value of upper limit b?'
READ(*,*)xn
PRINT *,'Number of subintervals?'
READ(*,*)n
IF (MOD(n,2)==0) THEN
h=(xn-x0)/n
s=f(x0)+f(xn)+4*f(x0+h)
DO i=3,n-1,2
s=s+(4*f(x0+(i*h)))+(2*f(x0+(i-1)*h))
END DO
s=(h*s)/3
PRINT *,"Value of integral is",s
ELSE
PRINT *,"Number of interval is not even"
END IF
END PROGRAM
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)