Fixed Point Iteration Method

This method is also known as direct substitution method or method of iteration or method of fixed iteration.It is applicable if the equation f(x) = 0 can be expressed as x=g(x).If x0 id the initial approximation to the root, then the next approximation to the root is given by,       x1=g(x0)and the next iteration will […]

Continue Reading

Newton-Raphson Method

    Newton-Raphson Method       Also you may interested: False Position Method  Bisection Method   Also known as successive substitution method. Algorithm 1.      Assign an initial value to x say x0. 2.      Evaluate f (x0) and f’(x0) 3.      Compute x1 =x0 –f(x0)/f’(x0) 4.      If f(x1) =0 then x1, is the required root & stop […]

Continue Reading

Bisection Method || numerical Method

Also you may interested:  Newton-Raphson Method  False Position Method This method is known as Bolzano method, bracketing method, binary chopping method or half interval method. Suppose we are given the continuous function f(x) in the interval [p, q] and we want to find root of the equation f(x)=0 by bisection method. The process is described […]

Continue Reading