1Research Scholar,
2Fellow of Institute of Mathematics & Applications (UK), Professor of Mathematics, Head,
*Corresponding author E-mail: yadavinderjeet386@gmail.com
The numerical approximation of non-linear equation f (x) = 2xex + 1 + 2 cos x.2x — 6.2x = 0 is demonstrated using Bisection, Newton and Secant Methods. The goal of the paper is to compare the approaches for finding the root of a non-linear equation in terms of implementation and convergence rate in the interval 1 ≤ x ≤ 2 and demonstrate the numerical solution compared. The Bisection technique converges with a large number of computing iterations and a slow rate of convergence, while the Newton and Secant converge quickly and with a very small error. As a result, numerically approximations answers of the approaches on sample issue suggest that Newton and Secant are absolutely exact and effective than the outcomes obtained through the Bisection technique.
Bisection technique, Newton Raphson technique, Secant technique, Convergence rate, Relative error