| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Algorithm.GoldenSectionSearch
Synopsis
- phi :: Double
- resphi :: Double
- mid1 :: Double -> Double -> Double
- mid2 :: Double -> Double -> Double
- epsGS :: Double
- goldenSectionSearchMin :: Ord a => Double -> Double -> (Double -> a) -> ArgMin a Double
- goldenSectionSearchMax :: Ord a => Double -> Double -> (Double -> a) -> ArgMax a Double
- goldenSectionSearchMin2 :: Ord a => Double -> Double -> (Double -> Double -> a) -> ArgMin a (Double, Double)
- goldenSectionSearchMax2 :: Ord a => Double -> Double -> (Double -> Double -> a) -> ArgMax a (Double, Double)
Documentation
goldenSectionSearchMin :: Ord a => Double -> Double -> (Double -> a) -> ArgMin a Double Source #
f should be unimodal
>>>goldenSectionSearchMin 0.0 10.0 (\x -> (x-1)^2)Min {getMin = Arg 9.802089785436835e-28 0.9999999999999687}
goldenSectionSearchMax :: Ord a => Double -> Double -> (Double -> a) -> ArgMax a Double Source #
>>>goldenSectionSearchMax 0.0 10.0 (\x -> log x/x)Max {getMax = Arg 0.36787944117144233 2.7182818604248506}