Math::Polynomial::Solve, version 2.65, 16 December 2012.
------------------------------------------------------------------------
>>> <<<
>>>NOTE: FUNCTIONS set_hessenberg() AND get_hessenberg() ARE DEPRECATED.<<<
>>> ---------------- ---------------- <<<
>>> YOU WILL GET MESSAGES TO THAT EFFECT IN CODE. THE FUNCTIONS WILL <<<
>>> BE REMOVED WITH THE FORTHCOMING VERSION 2.70. <<<
>>> <<<
>>>The function poly_option() replaces them. See the documentation for <<<
>>>more details. <<<
>>> <<<
This package provides a set of functions that find the roots of
polynomials up to degree 4 using the classical methods; a function
for solving polynomials of any degree by an implementation of the
QR Hessenberg algorithm; and functions that implement Sturm's
sequence for counting the number of real, unique roots in a range.
These functions can be exported by name or by tag (:classical, :numeric,
:sturm, and :utility). The utility tag exports the functions that
are used internally and which previously were private to the module.
See the documentation for more information.
Using the classical methods, the cubic may be solved by the method
described by R. W. D. Nickalls, "A New Approach to solving the cubic:
Cardan's solution revealed," The Mathematical Gazette, 77, 354-359, 1993.
Dr. Nickalls has made his paper available at
.
The solution for the quartic is based on Ferrari's method, as described
in the web page Karl's Calculus Tutor,
.
INSTALLATION:
The usual way. Unpack the archive:
gzip -d Math-Polynomial-Solve-2.65.tar.gz
tar xvf Math-Polynomial-Solve-2.65.tar
Go into the resulting directory, and type:
perl Build.PL
Build
Run the tests:
Build test
Install the module:
Build install
Copyright (c) 2010 John M. Gamble. All rights reserved. This program is
free software; you can redistribute it and/or modify it under the same
terms as Perl itself.