BRIJ MOHAN
Life is always Learning
Bisection Method : Approximate the zero for the function f(x)=x^3+2x^2-3x-1 in the interval (1, 2) within an absolute tolerace of 10^-5.
False Position Method : Approximate the zero for the function f(x)=x^3+2x^2-3x-1 in the interval (1, 2) within an absolute tolerace of 10^-5.
Secant Method : Approximate the zero for the function f(x)=x^3+2x^2-3x-1 in the interval (1, 2) within an absolute tolerace of 10^-5.
Newton's Method : Approximate the zero for the function f(x)=x^3+2x^2-3x-1 in the interval (1, 2) within an absolute tolerace of 10^-5.
Gauss-Jacobi Method : Solve the system of equations Ax=b with initial approximation [0, 0 , 0] upto 25 iterations, where
Gauss-Seidel Method : Solve the system of equations Ax=b with initial approximation [0, 0 , 0] upto 25 iterations, where
SOR Method (Successive Over-Relaxation) : Solve the system of equations Ax=b with initial approximation [0, 0 , 0] upto 25 iterations, where
Lagrange's Interpolation : Interpolate the polynomials for the following data
and
Newton Interpolation : Interpolate the polynomials for the following data
and
Doolittle Method : Compute LU Decomposition for the following matrices
Crout Method : Compute LU Decomposition for the following matrices
1/3 - Simpson's Rule : Closed Newton-Cotes Formula for n=2 is known as 1/3 - Simpson's rule. Compute the integration for the function f(x)=x^5+2x^4+x+1 from 1 to 2.
3/8 - Simpson's Rule : Closed Newton-Cotes Formula for n=3 is known as 3/8 - Simpson's rule. Compute the integration for the function f(x)=x^5+2x^4+x+1 from 1 to 2.
