Improvements in the Bisection Method of finding roots of an equation
Chetan Chhabra
Abstract
Chetan Chhabra
Abstract
Bisection Method is one of the simplest methods in numerical analysis to find the roots of a non-linear equation. It is based on Intermediate Value Theorem. The algorithm proposed in this paper predicts the optimal interval in which the roots of the function may lie and then applies the bisection method to converge at the root within the tolerance range defined by the user. This algorithm also calculates another root of the equation, if that root lies just outside the range of the interval found.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Bisection Method is one of the simplest methods in numerical analysis to find the roots of a non-linear equation. It is based on Intermediate Value Theorem. The algorithm proposed in this paper predicts the optimal interval in which the roots of the function may lie and then applies the bisection method to converge at the root within the tolerance range defined by the user. This algorithm also calculates another root of the equation, if that root lies just outside the range of the interval found.
Key concepts: Bisection method, Bisection, Range (aeronautics), Root (linguistics), Interval (graph theory), Mathematics, Root-finding algorithm, Function (biology)