Interface  Description 

Uniroot 
A rootfinding algorithm is a numerical algorithm for finding a value x such that f(x) = 0, for a given function f.

Class  Description 

BisectionRoot 
The bisection method repeatedly bisects an interval and then selects a subinterval in which a
root must lie for further processing.

BrentRoot 
Brent's rootfinding algorithm combines superlinear convergence with reliability of bisection.

HalleyRoot 
Halley's method is an iterative root finding method for a univariate function
with a continuous second derivative, i.e., a C^{2} function.

NewtonRoot 
The NewtonRaphson 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 xintercept of this tangent line
(which is easily done with elementary algebra).

Exception  Description 

NoRootFoundException 
This is the
Exception thrown when it fails to find a root. 
Copyright © 20102016 Numerical Method Incorporation Limited. All Rights Reserved.