The Apache Commons Team is pleased to announce the availability of
version 1.1 of "Apache Commons Numbers".
Apache Commons Numbers provides number types and utilities.
Changes in this version include:
New features:
o NUMBERS-70: Add a user guide.
o NUMBERS-190: Add a Bill of Materials (BOM) to aid in dependency management
when referencing multiple Apache Commons Numbers artifacts. The BOM
should be used to ensure all imported artifacts are compatible.
o NUMBERS-181: Updated support for the beta functions. "RegularizedBeta": Added
the complement and derivative of the regularized beta function.
Added "IncompleteBeta" and "Beta" classes.
Functionality is ported from the Boost C++ library.
o NUMBERS-180: "GammaRatio": Compute the ratio of two gamma functions.
o NUMBERS-177: "Erfcx": Compute a scaled complementary error function:
erfcx(z) = erfc(z) * exp(z*z).
o NUMBERS-175: "GeneralizedContinuedFraction": A continued fraction class to
compute using a generator. Allows evaluation of continued fractions from
a regular series where coefficients can be computed iteratively from the
previous coefficients.
Fixed Bugs:
o NUMBERS-185: "Precision": Allow Precision.compareTo using a maxUlps to be
used for sorting. This corrects handling of NaN comparisons.
o NUMBERS-182: "LogBeta": Avoid overflow for tiny arguments.
o "BrentSolver": Avoid overflow creating the initial value between the
lower and upper.
o NUMBERS-173: "ContinuedFraction": Set a minimum bound on the relative error
epsilon. Prevents an infinite loop when the epsilon is zero.
o "FactorialDouble": Prevent caching values that are infinite. The
cache will support factorials up to 170.
o NUMBERS-170: "RegularizedBeta": Detect edge cases for arguments that can be
evaluated by exploiting properties of the regularized beta function.
o NUMBERS-168: "BrentSolver": Identify brackets with small objective values.
o Fix wrong javadoc. Thanks to Arturo Bernal.
Changes:
o NUMBERS-184: "Precision": Reduce number of operations in Precision.equals
using a maxUlps.
o NUMBERS-183: Improve the binomial coefficient classes. Avoid recursive method
calls. Avoid overflow for BinomialCoefficientDouble for large results
close to infinity. Use precomputed factorials and the LogBeta function
for efficiency.
o NUMBERS-178: "Factorial/FactorialDouble": Tabulate all factorials with exact
64-bit double representations of n! up to n=170. This change deprecates
the FactorialDouble class and removes obsolete caching functionality.
o NUMBERS-176: "ContinuedFraction": Update to use a shared implementation with
GeneralizedContinuedFraction.
o NUMBERS-174: "Gamma/LogGamma/RegularizedGamma": Update the gamma function
implementations to increase accuracy and support for extreme values.
Functionality is ported from the Boost C++ library.
o NUMBERS-172: "Erf/Erfc": Use a rational function approximation accurate to
53-bits of precision. This replaces the use of the regularized gamma
functions P and Q and increases accuracy at extreme limits of the
function. Execution speed is improved.
Functionality is ported from the Boost C++ library.
o NUMBERS-171: "InverseErfc": Support full range of [0, 2]. This lowers the
supported minimum value from 2^-53 to double min value. Execution speed
is improved. Functionality is ported from the Boost C++ library.
Historical list of changes:
https://commons.apache.org/proper/commons-numbers/changes-report.html
For complete information on Apache Commons Numbers, including instructions on
how to submit bug reports, patches, or suggestions for improvement, see the
Apache Commons Numbers website:
https://commons.apache.org/proper/commons-numbers/
Distribution packages can be downloaded from
http://commons.apache.org/proper/commons-numbers/download_numbers.cgi
When downloading, please verify signatures using the KEYS file
available at
https://www.apache.org/dist/commons/KEYS
The Apache Commons Team
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
