roots- Root-finding algorithms (1-dimensional)

Safe HaskellSafe-Inferred




data Dekker a b Source


(Fractional a, Ord a, Real b, Fractional b, Ord b) => RootFinder Dekker a b 
(Eq a, Eq b) => Eq (Dekker a b) 
(Show a, Show b) => Show (Dekker a b) 

dekker :: RealFloat a => (a -> a) -> a -> a -> a -> Either (Dekker a a) aSource

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