Scientific Computing

This module demonstrates the interval bisection method for solving a
nonlinear equation *f*(*x*) = 0*f* has a change in sign, the interval is successively
halved until the solution has been isolated as accurately as desired.

The user selects a problem either by choosing a preset example or
typing in a desired function *f*(*x*) and initial
interval *a*, *b*]*a*, *b**m* are shown on the plot by labeled hash marks, and corresponding
function values are shown by bullets. In addition, all these values
are shown numerically in the table below. At each iteration, the
length of the interval is halved by taking either *a* =
*m**b* = *m**f*(*m*)

**Reference:** Michael T. Heath, *Scientific Computing,
An Introductory Survey*, 2nd edition, McGraw-Hill, New York,
2002. See Section 5.5.1, especially Algorithm 5.1 and Example 5.7.

**Developers:** Jeffrey Naisbitt and Michael Heath