−3 is approached rapidly: b9 = −3 + 6·10−8 and b10 = −3 − 3·10−15. (Correct : Iter 9 : f(s) = −1.4 × 10−7, Iter 10 : f(s) = 6.96 × 10−12) Implementations published an Algol 60 implementation. Netlib contains a Fortran translation of this implementation with slight modifications. The PARI/GP method implements the method. Other implementations of the algorithm (in C++, C, and Fortran) can be found in the Numerical Recipes books. The Apache Commons Math library implements the algorithm in Java. The SciPy optimize module implements the algorithm in Python (programming language) The Modelica Standard Library implements the algorithm in Modelica. The function implements the algorithm in R (software). The function implements the algorithm in MATLAB. The Boost (C++ libraries) implements two algorithms based on Brent's method in C++ in the Math toolkit: Function minimization at minima.hpp with an example locating function minima. Root finding implements the newer TOMS748, a more modern and efficient algorithm than Brent's original, at TOMS748, and Boost.Math rooting finding that uses TOMS748 internally with examples. The Optim.jl package implements the algorithm in Julia (programming language) The SICMUtils computer algebra system (written in Clojure (programming language)) implements a variant of the algorithm designed for univariate function minimization. Root-Finding in C# library hosted in Code Project. References Further reading External links zeroin.f at Netlib. module brent in C++ (also C, Fortran, Matlab) by John Burkardt GSL implementation. Boost C++ implementation. Python (Scipy) implementation Root-finding algorithms