Search Java Classes and Packages
#Com.numericalmethod.suanshu.analysis.root.univariate Classes and Interfaces - 6 results found.
| Name | Description | Type | Package | Framework |
| BisectionRoot | The bisection method repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. | Class | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |
| BrentRoot | Brent's root-finding algorithm combines super-linear convergence with reliability of bisection. | Class | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |
| HalleyRoot | Halley's method is an iterative root finding method for a univariate function with a continuous second derivative, i. | Class | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |
| 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 | Class | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |
| NoRootFoundException | This is the Exception thrown when it fails to find a root. | Class | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |
| Uniroot | A root-finding algorithm is a numerical algorithm for finding a value x such that f(x) = 0, for a given function f. | Interface | com.numericalmethod.suanshu.analysis.root.univariate | SuanShu |