One-dimensional Root-Finding

Classes implementing algorithms for finding the roots of a one-dimensional function. More...

Collaboration diagram for One-dimensional Root-Finding:

Classes
class	ROOT::Math::BrentRootFinder
	Class for finding the root of a one dimensional function using the Brent algorithm. More...
class	ROOT::Math::IRootFinderMethod
	Interface for finding function roots of one-dimensional functions. More...
class	ROOT::Math::RootFinder
	User Class to find the Root of one dimensional functions. More...
class	ROOT::Math::GSLRootFinder
	Base class for GSL Root-Finding algorithms for one dimensional functions which do not use function derivatives. More...
class	ROOT::Math::GSLRootFinderDeriv
	Base class for GSL Root-Finding algorithms for one dimensional functions which use function derivatives. More...
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::FalsePos
	False Position algorithm based on linear interpolation. 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::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...
class	ROOT::Math::GSLRootFdFSolver
	Root-Finder with derivatives implementation class using GSL. More...
class	ROOT::Math::GSLRootFSolver
	Root-Finder implementation class using GSL. More...

Enumerations
enum	ROOT::Math::RootFinder::EType {   ROOT::Math::RootFinder::kBRENT, ROOT::Math::RootFinder::kGSL_BISECTION, ROOT::Math::RootFinder::kGSL_FALSE_POS, ROOT::Math::RootFinder::kGSL_BRENT,   ROOT::Math::RootFinder::kGSL_NEWTON, ROOT::Math::RootFinder::kGSL_SECANT, ROOT::Math::RootFinder::kGSL_STEFFENSON }

Detailed Description

Classes implementing algorithms for finding the roots of a one-dimensional function.

Various implementation esists in MathCore and MathMore The user interacts with a proxy class ROOT::Math::RootFinder which creates behing the chosen algorithms which are implemented using the ROOT::Math::IRootFinderMethod interface

Enumeration Type Documentation

enum ROOT::Math::RootFinder::EType

Enumerator
kBRENT
kGSL_BISECTION
kGSL_FALSE_POS
kGSL_BRENT
kGSL_NEWTON
kGSL_SECANT
kGSL_STEFFENSON

Definition at line 92 of file RootFinder.h.