Haskell functions for finding the roots of mathematical functions.
The result of searching for a root of a mathematical function.
The function does not have opposite signs when evaluated at the lower and upper bounds of the search.
The search failed to converge to within the given error tolerance after the given number of iterations.
A root was successfully found.
|-> Root a|
Result of search for a root.
Returns either the result of a search for a root, or the default value if the search failed.
Absolute error tolerance.
|-> (Double, Double)|
Lower and upper bounds for the search.
|-> (Double -> Double)|
Function to find the roots of.
|-> Root Double|
Use the method of Ridders to compute a root of a function.
The function must have opposite signs when evaluated at the lower and upper bounds of the search (i.e. the root must be bracketed).
- Ridders, C.F.J. (1979) A new algorithm for computing a single root of a real continuous function. IEEE Transactions on Circuits and Systems 26:979–980.