Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
math-functions Numeric.RootFinding Single Ridders step. It's a bracket of root
RiddersStep :: Double -> Double -> RiddersStepmath-functions Numeric.RootFinding Ridders step. Parameters are bracket for the root
ridders :: RiddersParam -> (Double, Double) -> (Double -> Double) -> Root Doublemath-functions Numeric.RootFinding Use the method of Ridders[Ridders1979] to compute a root of a function. It doesn't require derivative and provide quadratic convergence (number of significant digits grows quadratically with number of iterations). The function must have opposite signs when evaluated at the lower and upper bounds of the search (i.e. the root must be bracketed). If there's more that one root in the bracket iteration will converge to some root in the bracket.
riddersIterations :: (Double, Double) -> (Double -> Double) -> [RiddersStep]math-functions Numeric.RootFinding List of iterations for Ridders methods. See ridders for documentation of parameters
riddersMaxIter :: RiddersParam -> !Intmath-functions Numeric.RootFinding Maximum number of iterations. Default = 100
riddersTol :: RiddersParam -> !Tolerancemath-functions Numeric.RootFinding Error tolerance for root approximation. Default is relative error 4·ε, where ε is machine precision.
-
Subclasses of Monoid A hierarchy of subclasses of Monoid together with their instances for all data structures from base, containers, and text packages.
type
CancellativeMonoid m = (Monoid m, Cancellative m)monoid-subclasses Data.Monoid.Cancellative No documentation available.
type
CommutativeMonoid m = (Monoid m, Commutative m)monoid-subclasses Data.Monoid.Cancellative No documentation available.
type
LeftCancellativeMonoid m = (Monoid m, LeftCancellative m)monoid-subclasses Data.Monoid.Cancellative No documentation available.