Package | Description |
---|---|
org.hipparchus.analysis.solvers |
Root finding algorithms, for univariate real functions.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractPolynomialSolver
Base class for solvers.
|
class |
AbstractUnivariateDifferentiableSolver
Provide a default implementation for several functions useful to generic
solvers.
|
class |
AbstractUnivariateSolver
Base class for solvers.
|
class |
BaseSecantSolver
Base class for all bracketing Secant-based methods for root-finding
(approximating a zero of a univariate real function).
|
class |
BisectionSolver
Implements the
bisection algorithm for finding zeros of univariate real functions.
|
class |
BracketingNthOrderBrentSolver
This class implements a modification of the Brent algorithm.
|
class |
BrentSolver
This class implements the
Brent algorithm for finding zeros of real univariate functions.
|
class |
IllinoisSolver
Implements the Illinois method for root-finding (approximating
a zero of a univariate real function).
|
class |
LaguerreSolver
Implements the
Laguerre's Method for root finding of real coefficient polynomials.
|
class |
MullerSolver
This class implements the
Muller's Method for root finding of real univariate functions.
|
class |
MullerSolver2
This class implements the
Muller's Method for root finding of real univariate functions.
|
class |
NewtonRaphsonSolver
Implements
Newton's Method for finding zeros of real univariate differentiable
functions.
|
class |
PegasusSolver
Implements the Pegasus method for root-finding (approximating
a zero of a univariate real function).
|
class |
RegulaFalsiSolver
Implements the Regula Falsi or False position method for
root-finding (approximating a zero of a univariate real function).
|
class |
RiddersSolver
Implements the
Ridders' Method for root finding of real univariate functions.
|
class |
SecantSolver
Implements the Secant method for root-finding (approximating a
zero of a univariate real function).
|
Copyright © 2016-2022 CS GROUP. All rights reserved.