These routines execute a classical zero finding numerical algorithm of Richard Brent. The algorithm is executed in four ways, all using the same example of finding a zero of the function f(x) = x*(x*x-2.0d0)-5.0 on the interval [2,3]. Some concepts of Object-Oriented computing are illustrated in the source codes.

Four executables may be generated from the makefile