A Robust Bisection Method for Root Finding in C (KEY IJP************910)

• Dr.jyothi.g, Dr.m.dhanashmi, K.bhanu Priya1, P.sarayu, T.sai Durga, N.keerthi, Sk.nasrin, K.divya

Abstract

This is also an iterative method. To find root repeatedly bisect an interval and then selects a subinterval in which a root must lie for further processing. Algorithm is quite simple and robust, only requirement is that initial search interval must encapsulates the actual root