roots-0.1.1.2: Root-finding algorithms (1-dimensional)

Safe HaskellSafe-Inferred

Math.Root.Finder.Ridders

Synopsis

Documentation

data RiddersMethod a b Source

Instances

(Floating a, Ord a) => RootFinder RiddersMethod a a 
(Eq a, Eq b) => Eq (RiddersMethod a b) 
(Show a, Show b) => Show (RiddersMethod a b) 

ridders :: (Ord a, Floating a) => (a -> a) -> a -> a -> a -> Either (RiddersMethod a a) aSource

ridders f x1 x2 xacc: attempt to find a root of a function known to lie between x1 and x2, using Ridders' method. The root will be refined till its accuracy is +-xacc. If convergence fails, returns the final state of the search.