Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Brent's method
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Implementations== * {{Harvtxt|Brent|1973}} published an [[Algol 60]] implementation. * [[Netlib]] contains a Fortran translation of this implementation with slight modifications. * The [[PARI/GP]] method {{code|solve}} 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 (programming language)|Java]]. * The [[SciPy]] optimize module implements the algorithm in [[Python (programming language)]] * The Modelica Standard Library implements the algorithm in [[Modelica]]. * The {{code|uniroot}} function implements the algorithm in [[R (software)]]. * The {{code|fzero}} 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 [https://www.boost.org/doc/libs/release/boost/math/tools/minima.hpp minima.hpp] with an example [https://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/brent_minima.html locating function minima]. *# Root finding implements the newer TOMS748, a more modern and efficient algorithm than Brent's original, at [https://www.boost.org/doc/libs/release/boost/math/tools/toms748_solve.hpp TOMS748], and [https://www.boost.org/doc/libs/release/libs/math/doc/html/root_finding.html Boost.Math rooting finding] that [https://www.boost.org/doc/libs/release/libs/math/doc/html/math_toolkit/roots_noderiv/bracket_solve.html uses TOMS748 internally] with [https://www.boost.org/doc/libs/release/libs/math/example/root_finding_example.cpp examples]. * The [https://github.com/JuliaNLSolvers/Optim.jl Optim.jl] package implements the algorithm in [[Julia (programming language)]] * The [https://github.com/mentat-collective/emmy Emmy] computer algebra system (written in [[Clojure (programming language)]]) implements a variant of the algorithm designed for univariate function minimization. * [https://www.codeproject.com/Articles/79541/Three-Methods-for-Root-finding-in-C Root-Finding in C#] library hosted in Code Project.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)