roots- Root-finding algorithms (1-dimensional)

Safe HaskellSafe-Inferred




data InverseQuadratic a b Source


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

inverseQuadratic :: RealFloat a => (a -> a) -> a -> a -> a -> Either (InverseQuadratic a a) aSource

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