Math::Polynomial objects represent polynomials in one variable, i.e. expressions built with finitely many additions, subtractions and multiplications of the variable and some constants. A standard way of writing down a polynomial in one variable is a...

new Create a new zero polynomial and return it to the caller. copy OBJREF Perform a deep copy of the polynomial object referenced by OBJREF. monOrder monOrder STRING Return the current monomial ordering. If an argument is passed, it is assigned as th...

This package supplies a set of functions that find the roots of polynomials, along with some utility functions. Roots will be either real or of type Math::Complex. Functions making use of the Sturm sequence are also available, letting you find the nu...

This module is a layer on top of the basic routines in the cephes math library to handle polynomials. In the following, a Math::Cephes::Polynomial object is created as my $p = Math::Cephes::Polynomial->new($arr_ref); where $arr_ref is a reference to ...

This is a few lines of code to format "Math::Polynomial" objects as strings in Horner form. It uses parentheses to group terms for multiplications by x rather than powering. Program Code Horner form is quite good for computer evaluation. If you adjus...

Math::Polynomial::ModInt is a subclass of Math::Polynomial for modular integer coefficient spaces. It adds domain-specific methods and stringification options to the base class. Notably, it implements a bijection from unsigned integers to polynomials...

This package extends Math::Polynomial, so each instance polynomial created by this modules is a subclass of Math::Polynomial. The Chebyshev polynomials of the first kind are orthogonal with respect to the weight function 1/sqrt(1-x^2). The first Cheb...

This small extension of Math::Polynomial adds a constructor for cyclotomic polynomials and a factoring algorithm for rational polynomials of the form *x^n-1*. Cyclotomic polynomials are monic irreducible polynomials with integer coefficients that are...

This package extends Math::Polynomial, so each instance polynomial created by this modules is a subclass of Math::Polynomial. The Chebyshev polynomials of the second kind are orthogonal with respect to the weight function sqrt(1-x^2). The first Cheby...

Math::Polynomial::Multivariate is a Perl class representing polynomials in any number of variables. It provides a set of operations defined for these polynomials, like addition, multiplication, evaluation, variable substitution, etc., as well as attr...

This module provides several different set order relations for modular integer polynomials. They are given as (read-only) variables so that they can be used as name argument for the perl builtin *sort* operator. These variables are at the same time o...

Man, if that synopsis don't say it all, what can I possibly add? :-) OK, as mentioned above, this is a fun project. The plan, not necessarily all implemented at the first release, is to provide many kinds of operations on the polynomials that intimid...

Defines hashes which represent mathematical functions, such as the fibonacci sequence, factorials, etc... Functions can be expressed in a manner which a math or physics student might find a bit more familiar. It also automatically employs memoization...

This module extends PDL with more advanced mathematical functions than provided by standard Perl. All the functions have one input pdl, and one output, unless otherwise stated. Many of the functions are linked from the system maths library or the Cep...

This module will generate various Pseudorandom Binary Sequences (PRBS). This module creates a iterator object, and you can use that object to generate the sequence one value at a time, or *en masse*. The generated sequence is a series of 0s and 1s wh...

This module extends PDLA with more advanced mathematical functions than provided by standard Perl. All the functions have one input pdl, and one output, unless otherwise stated. Many of the functions are linked from the system maths library or the Ce...

What! Yet another module to manipulate polynomials!! No, don't worry, there is a good reason for this one ;) I needed (for my work at a large financial institution) a robust way to compute the internal rate of return (IRR) of various cashflows. An IR...