Changes for version 2.51
- Jun 1 2010
- Jean Connelly found a quartic where $g is greater than $epsilon, but $g**2 isn't. Since it's the squared value that's used in Ferrari's method, we eventually wind up dividing by zero. This is a floating point representation sample that slipped past my tests (which up to now were all based on integers). Changed the check to use $g**2, since that's what we're protecting ourselves from anyway.
- Connelly's case is 0.9216 times an integer coeffecient set. Put the integer version in poly0.t, and then created the floating point tests in the new file polyfp0.t by taking the poly0.t tests and multiplying everything by 0.9216. I'll extend this later.
- Added Dr. Nickall's quartic article to the distribution. Both of his articles are in the subdirectory "reference".
- Apr 19 2010
- Bowed to convention and reversed the order of the Change entries. (And moved an obviously out-of-place Change entry to its proper position).
- Added Dr. Nickall's article to the distribution, with his permission.
- Abandoned backward compatibility with perl version 5.05, which was present despite the 5.6 requirement in Build.PL (I was supporting the module on a very old server). The module now requires version 5.6, which admittedly isn't cutting edge but does allow more modern constructs like 'our'.
Modules
Find the roots of polynomial equations.