Package org.hipparchus.analysis.solvers
Root finding algorithms, for univariate real functions.

Interface Summary Interface Description BaseUnivariateSolver<F extends UnivariateFunction> Interface for (univariate real) rootfinding algorithms.BracketedRealFieldUnivariateSolver<T extends CalculusFieldElement<T>> Interface for(univariate real) rootfinding algorithms
that maintain a bracketed solution.BracketedUnivariateSolver<F extends UnivariateFunction> Interface for(univariate real) rootfinding algorithms
that maintain a bracketed solution.PolynomialSolver Interface for (polynomial) rootfinding algorithms.UnivariateDifferentiableSolver Interface for (univariate real) rootfinding algorithms.UnivariateSolver Interface for (univariate real) rootfinding algorithms. 
Class Summary Class Description AbstractPolynomialSolver Base class for solvers.AbstractUnivariateDifferentiableSolver Provide a default implementation for several functions useful to generic solvers.AbstractUnivariateSolver Base class for solvers.BaseAbstractUnivariateSolver<F extends UnivariateFunction> Provide a default implementation for several functions useful to generic solvers.BaseSecantSolver Base class for all bracketing Secantbased methods for rootfinding (approximating a zero of a univariate real function).BisectionSolver Implements the bisection algorithm for finding zeros of univariate real functions.BracketedRealFieldUnivariateSolver.Interval<T extends CalculusFieldElement<T>> An interval of a function that brackets a root.BracketedUnivariateSolver.Interval An interval of a function that brackets a root.BracketingNthOrderBrentSolver This class implements a modification of the Brent algorithm.BrentSolver This class implements the Brent algorithm for finding zeros of real univariate functions.FieldBracketingNthOrderBrentSolver<T extends CalculusFieldElement<T>> This class implements a modification of the Brent algorithm.IllinoisSolver Implements the Illinois method for rootfinding (approximating a zero of a univariate real function).LaguerreSolver Implements the Laguerre's Method for root finding of real coefficient polynomials.MullerSolver This class implements the Muller's Method for root finding of real univariate functions.MullerSolver2 This class implements the Muller's Method for root finding of real univariate functions.NewtonRaphsonSolver Implements Newton's Method for finding zeros of real univariate differentiable functions.PegasusSolver Implements the Pegasus method for rootfinding (approximating a zero of a univariate real function).RegulaFalsiSolver Implements the Regula Falsi or False position method for rootfinding (approximating a zero of a univariate real function).RiddersSolver Implements the Ridders' Method for root finding of real univariate functions.SecantSolver Implements the Secant method for rootfinding (approximating a zero of a univariate real function).UnivariateSolverUtils Utility routines forUnivariateSolver
objects. 
Enum Summary Enum Description AllowedSolution The kinds of solutions that a(bracketed univariate real) rootfinding algorithm
may accept as solutions.BaseSecantSolver.Method Secantbased rootfinding methods.