Changelog for math-functions-0.3.4.4
Changes in 0.3.4.4
- Support for future versions of GHC. Monoid and Monad instances now have canonical form
Changes in 0.3.4.3
-
Support for
QuickCheck >= 2.14. Test no longer fail -
Support for GHC<8.0 dropped
Changes in 0.3.4.2
- Fixed crash in
invIncompleteBeta(#68) for some inputs initial approximation was computed incorrectly.
Changes in 0.3.4.1
- Precision of
incompleteGammaimproved.
Changes in 0.3.4.0
- Dependency on
vector-th-unboxis dropped. All instances are written by hand now.
Changes in 0.3.3.0
-
New implementation for
logGamma. Now it's precise within 2 ulps at full range including zeros at 1 and 2. -
Bug with precision loss of
invErffor parameters near zero is fixed. -
Fixed loss of precision in bundled
erfnear zero. (Affect primarily GHCJS) -
factorialfor now uses lookup table -
logFactorialis optimized a bit (less number of terms is used) -
m_sqrt_epsconstant added. -
Module
Numeric.SpecFunctions.Internalis exposed. -
Many improvements for test suite. Tables of expected function values are generated with mpmath, error estimates improved. Test suite itself is migrated to
tastyfromtest-framework.
Changes in 0.3.2.1
- Fixes build on windows for GHC<8.0
Changes in 0.3.2.0
-
GHCJS is now supported
-
Flag
system-expm1is set to true by default. Only affects GHC<8.0
Changes in 0.3.1.0
-
Exported data types for iteration steps in root finding
-
Defaults for root finding algorithm are documented
Changes in 0.3.0.2
- Fix license field in cabal file
Changes in 0.3.0.0
-
SemigroupandMonoidinstances added for data types fromNumeric.Sum -
API for finding roots of real functions reworked. 1) All algorithm parameters are now tweakable. 2) Functions for getting list of iterations added.
-
FoldableandTraversableinstances forRootwere added.
Changes in 0.2.1.0
-
log1pandexpm1are simply reexported fromGHC.Float. They're methods ofFloatingtype class. -
On windows
expm1is implemented in pure haskell for older GHCs.
Changes in 0.2.0.0
- Bug fixes and documentation tweaks
Changes in 0.2.0.0
-
logGammanow uses Lancsoz approximation and same aslogGammaL. Old implementation oflogGammamoved toNumeric.SpecFunctions.Extra.logGammaAS245. -
Precision of
logGammafor z<1 improved. -
New much more precise implementation for
incompleteGamma -
Dependency on
erfpackage dropped.erfanderfcjust do direct calls to C. -
Numeric.SpecFunctions.expm1added -
Numeric.SpecFunctions.log1pmxadded. -
logGammaCorrectionexported inNumeric.SpecFunctions.Extra. -
Module
Numeric.Seriesadded for working with infinite sequences, series summation and evaluation of continued fractions. -
Module
statistics: Statistics.Math.RootFindingcopied toNumeric.RootFinding. Instances forbinaryandaesondropped. -
Root-finding using Newton-Raphson added
-
Numeric.MathFunctions.Comparison.ulpDeltaadded. It calculates signed distance between two doubles. -
Other bug fixes.
Changes in 0.1.7.0
-
Module
statistics: Statistics.Function.Comparisonmoved toNumeric.MathFunctions.Comparison. Old implementation ifwithincompared negative numbers incorrectly. -
addUlpsandulpDistanceadded toNumeric.MathFunctions.Comparison. -
relativeErrorandeqRelErradded toNumeric.MathFunctions.Comparison. -
Precision of
logFactorialis slightly improved.
Changes in 0.1.6.0
-
logChooseadded for calculation of logarithm of binomial coefficient -
chooseExactandlogChooseFastadded -
sincadded
Changes in 0.1.5.3
- Fix for test suite on 32bit platform
Changes in 0.1.5
- Numeric.Sum: new module adds accurate floating point summation.
Changes in 0.1.4
-
logFactorial type is genberalized. It accepts any
Integraltype -
Evaluation of polynomials using Horner's method where coefficients are store in lists added
Changes in 0.1.3
-
Error function and its inverse added.
-
Digamma function added
-
Evaluation of polynomials using Horner's method added.
-
Crash bug in the inverse incomplete beta fixed.