fsolve, a C++ code which solves systems of nonlinear equations, inspired by the fsolve() function in minpack(), with special interfaces fsolve_bdf2(), fsolve_be() and fsolve_tr() for handling systems associated with implicit ODE solvers of type bdf2, backward Euler, midpoint, or trapezoidal.
The information on this web page is distributed under the MIT license.
fsolve or fsolve_test is available in a C version and a C++ version and a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version and a Python version and an R version.
bisection, a C++ code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.
cpp_ode_solver, a C++ code which solves one or more differential equations (ODE) using a method of a particular order, either explicit or implicit. Some methods require a nonlinear equation solver. Some methods used a fixed stepsize, while others adapt the stepsize based on an error estimate.
minpack, a C++ code which solves systems of nonlinear equations, or the least squares minimization of the residual of linear or nonlinear equations, by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom.
zero_brent, a C++ code which seeks a solution of a scalar nonlinear equation f(x) = 0, by Richard Brent.
zero_laguerre, a C++ code which uses Laguerre's method to find the zero of a function. The method needs first and second derivative information. The method almost always works when the function is a polynomial.
zero_muller, a C++ code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
Original Fortran77 version by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom. This version by John Burkardt.