Paper Contents
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
Copyright
Copyright © 2023 Dr.Jyothi.G, Dr.M.Dhanashmi, K.Bhanu Priya1, P.Sarayu, T.Sai Durga, N.Keerthi, SK.Nasrin, K.Divya. This is an open access article distributed under the Creative Commons Attribution License.
Paper ID:
IJPREMS30900008910
ISSN:
2321-9653
Publisher:
ijprems