1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
{-# OPTIONS #-}
-----------------------------------------------------------------------------
{- |
Module : Numeric.GSL.Differentiation
Copyright : (c) Alberto Ruiz 2006
License : GPL-style
Maintainer : Alberto Ruiz (aruiz at um dot es)
Stability : provisional
Portability : uses ffi
Numerical differentiation.
<http://www.gnu.org/software/gsl/manual/html_node/Numerical-Differentiation.html#Numerical-Differentiation>
From the GSL manual: \"The functions described in this chapter compute numerical derivatives by finite differencing. An adaptive algorithm is used to find the best choice of finite difference and to estimate the error in the derivative.\"
-}
-----------------------------------------------------------------------------
module Numeric.GSL.Differentiation (
derivCentral,
derivForward,
derivBackward
) where
import Foreign.C.Types
import Foreign.Marshal.Alloc(malloc, free)
import Foreign.Ptr(Ptr, FunPtr, freeHaskellFunPtr)
import Foreign.Storable(peek)
import Data.Packed.Internal(check,(//))
import System.IO.Unsafe(unsafePerformIO)
derivGen ::
CInt -- ^ type: 0 central, 1 forward, 2 backward
-> Double -- ^ initial step size
-> (Double -> Double) -- ^ function
-> Double -- ^ point where the derivative is taken
-> (Double, Double) -- ^ result and error
derivGen c h f x = unsafePerformIO $ do
r <- malloc
e <- malloc
fp <- mkfun (\y _ -> f y)
c_deriv c fp x h r e // check "deriv"
vr <- peek r
ve <- peek e
let result = (vr,ve)
free r
free e
freeHaskellFunPtr fp
return result
foreign import ccall "gsl-aux.h deriv"
c_deriv :: CInt -> FunPtr (Double -> Ptr () -> Double) -> Double -> Double
-> Ptr Double -> Ptr Double -> IO CInt
{- | Adaptive central difference algorithm, /gsl_deriv_central/. For example:
> > let deriv = derivCentral 0.01
> > deriv sin (pi/4)
>(0.7071067812000676,1.0600063101654055e-10)
> > cos (pi/4)
>0.7071067811865476
-}
derivCentral :: Double -- ^ initial step size
-> (Double -> Double) -- ^ function
-> Double -- ^ point where the derivative is taken
-> (Double, Double) -- ^ result and absolute error
derivCentral = derivGen 0
-- | Adaptive forward difference algorithm, /gsl_deriv_forward/. The function is evaluated only at points greater than x, and never at x itself. The derivative is returned in result and an estimate of its absolute error is returned in abserr. This function should be used if f(x) has a discontinuity at x, or is undefined for values less than x. A backward derivative can be obtained using a negative step.
derivForward :: Double -- ^ initial step size
-> (Double -> Double) -- ^ function
-> Double -- ^ point where the derivative is taken
-> (Double, Double) -- ^ result and absolute error
derivForward = derivGen 1
-- | Adaptive backward difference algorithm, /gsl_deriv_backward/.
derivBackward ::Double -- ^ initial step size
-> (Double -> Double) -- ^ function
-> Double -- ^ point where the derivative is taken
-> (Double, Double) -- ^ result and absolute error
derivBackward = derivGen 2
{- | conversion of Haskell functions into function pointers that can be used in the C side
-}
foreign import ccall "wrapper" mkfun:: (Double -> Ptr() -> Double) -> IO( FunPtr (Double -> Ptr() -> Double))
|
