ROOT 6.13/01 Reference Guide |
Classes | |
class | ROOT::Math::Roots::Bisection |
Roots::Bisection Bisection algorithm, simplest algorithm for bracketing the roots of a function, but slowest one. More... | |
class | ROOT::Math::Roots::Brent |
Brent-Dekker algorithm which combines an interpolation strategy with the bisection algorithm See the GSL manual for more information. More... | |
class | ROOT::Math::Roots::FalsePos |
False Position algorithm based on linear interpolation. More... | |
class | ROOT::Math::Roots::Newton |
a Newton algorithm, which computes the derivative at each iteration See the GSL manual for more information More... | |
class | ROOT::Math::Roots::Secant |
Secant algorithm, simplified version of Newton method, which does not require the derivative at every step. More... | |
class | ROOT::Math::Roots::Steffenson |
Steffenson method, providing the fastes convergence. More... | |
Namespaces | |
ROOT | |
Namespace for new ROOT classes and functions. | |
ROOT::Math | |
ROOT::Math::Roots | |
Root-Finding Algorithms. | |