Numeric.AD.Internal.Sparse

Documentation

newtype Index

Constructors

Index (IntMap Int)

emptyIndex :: Index

addToIndex :: Int -> Index -> Index

indices :: Index -> [Int]

data Sparse a

We only store partials in sorted order, so the map contained in a partial will only contain partials with equal or greater keys to that of the map in which it was found. This should be key for efficiently computing sparse hessians. there are only (n + k - 1) choose k distinct nth partial derivatives of a function with k inputs.

Constructors

Sparse a (IntMap (Sparse a))

Instances

Typeable1 Sparse

Lifted Sparse => Jacobian Sparse

Primal Sparse

Lifted Sparse => Mode Sparse

Lifted Sparse

Data a => Data (Sparse a)

Show a => Show (Sparse a)

vars :: (Traversable f, Num a) => f a -> f (AD Sparse a)

d :: (Traversable f, Num a) => f b -> AD Sparse a -> f a

d' :: (Traversable f, Num a) => f a -> AD Sparse a -> (a, f a)

ds :: (Traversable f, Num a) => f b -> AD Sparse a -> Stream f a

skeleton :: Traversable f => f a -> f Int

spartial :: Num a => [Int] -> Sparse a -> Maybe a

partial :: Num a => [Int] -> Sparse a -> a