zero_itp, a Julia code which finds a zero of a scalar function of a scalar variable, starting from a change of sign interval, using the Interpolate/Truncate/Project (ITP) method, which has faster convergence than the bisection method. a root of f(x) over a change-of-sign interval a <= x <= b.
The information on this web page is distributed under the MIT license.
zero_itp is available in a C version and a C++ version and a Fortran90 version and a Julia version and a MATLAB version and an Octave version and a Python version.
bisection, a Julia code which seeks an solution to the equation f(x)=0, using bisection within a user-supplied change of sign interval [a,b].
regula_falsi, a Julia code which seeks an solution to the equation f(x)=0, using regula falsi within a user-supplied change of sign interval [a,b].
zero_illinois, a Julia code which seeks a solution to the equation f(x)=0 using the Illinois method.
Original Julia code by TheLateKronos. This version by John Burkardt.