Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- incbeta :: (Floating a, Ord a) => a -> a -> a -> a
- beta :: (Floating a, Ord a) => a -> a -> a
- regbeta :: (Floating a, Ord a) => a -> a -> a -> a
- bessel1 :: (Floating a, Ord a) => a -> a -> a
- gamma :: (Floating a, Ord a) => a -> a
- gammaln :: (Floating a, Ord a) => a -> a
- agm :: (Ord a, Floating a) => a -> a -> a
- completeElliptic :: (Ord a, Floating a) => a -> a
- fcdf :: (Floating a, Ord a) => a -> a -> a -> a
- chisqcdf :: (Floating a, Ord a) => a -> a -> a
- tcdf :: (Floating a, Ord a) => a -> a -> a
Documentation
Incomplete beta function, \(|z|\leq 1\)
Calculated with \(B(z;a,b)=\displaystyle\frac{z^a}{a}{}_2F_1(a, 1-b; a+1; z)\)
Since: 0.1.1.0
beta :: (Floating a, Ord a) => a -> a -> a Source #
\(B(x, y) = \displaystyle\frac{\Gamma(x)\Gamma(y)}{\Gamma(x+y)}\)
This uses gammaln
under the hood to extend its domain somewhat.
Since: 0.1.1.0
Regularized beta function, \(|z|\leq 1\)
\(I(z;a,b) = \displaystyle\frac{B(z;a,b)}{B(a,b)}\)
Bessel functions of the first kind, \( J_\alpha(x)\).
Since: 0.1.3.0
\(\text{log} (\Gamma(z))\)
Lanczos approximation. This is exactly the approach described in Press, William H. et al. Numerical Recipes, 3rd ed., extended to work on negative real numbers.
Since: 0.1.1.0
completeElliptic :: (Ord a, Floating a) => a -> a Source #
Complete elliptic integral of the first kind
Since: 0.1.4.0
Since: 0.1.2.0