Uses of Interface
com.numericalmethod.suanshu.analysis.root.univariate.Uniroot

Packages that use Uniroot

Package	Description
com.numericalmethod.suanshu.analysis.root.univariate

Uses of Uniroot in com.numericalmethod.suanshu.analysis.root.univariate

Classes in com.numericalmethod.suanshu.analysis.root.univariate that implement Uniroot

Modifier and Type	Class and Description
class	BisectionRoot The bisection method repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing.
class	BrentRoot Brent's root-finding algorithm combines super-linear convergence with reliability of bisection.
class	HalleyRoot Halley's method is an iterative root finding method for a univariate function with a continuous second derivative, i.e., a C2 function.
class	NewtonRoot The Newton-Raphson method is as follows: one starts with an initial guess which is reasonably close to the true root, then the function is approximated by its tangent line (which can be computed using the tools of calculus), and one computes the x-intercept of this tangent line (which is easily done with elementary algebra).