BISECTION METHOD: Solving Polynomial Equation
According to
this article at Wikipedia,
The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing.
...
The method is applicable when we wish to solve the equation f(x) = 0 for the real variable x, where f is a continuous function defined on an interval [a, b] and f(a) and f(b) have opposite signs. In this case a and b are said to bracket a root since, by the intermediate value theorem, the f must have at least one root in the interval (a, b).
The following program finds
a root of the
polynomial equation
f(x) = 0, by bisection method.
BISECTION METHOD: Solving Polynomial Equations.
Enter the coefficients of the equation in the box below,
using commas to separate them, starting with the LOWEST.
As an example, the coefficients of the polynomial equation
x3 -4x - 9 = 0 have been entered for you. Change them.
(Do not enter any extra spaces.)
No comments:
Post a Comment