Pari-GP : algdep and lindep routines
The Pari-Gp (Pascal Arithmetic, Grande calculette Programmable) is
a FREE-ware package that does advanced Number Theory calculations and
includes a LLL (from Lenstra-Lenstra-Lovasz) algorithm. Essentially
it does the same as the others but based on a different principle
than that of PSLQ.
The Pari-Gp program (with algdep and lindep) is
known to be fast. It is perfect for small degrees (up to 10-12) and
for Z-linear dependance searchs up to n = 8. It exist on a variety of
systems (Unix, Mac, Window, etc). It is portable and free.
Pari-Gp was written by C. Batut, D. Bernardi, Henri Cohen and M. Olivier
To access ON-LINE for an experiment with
Pari-Gp.
The program was written at the Universite Bordeaux I, France.
Here is a description of Pari-Gp.
Name : Pari/GP
Where : in
France
Also at math.ucla.edu
Mailing lists exist. Contact
pari-users-request@math.uic.edu
or pari-implementors-request@math.uic.edu
Description : PARI/GP is a package which is aimed at efficient
computations in number theory, but also contains a large
number of functions unrelated to number theory. It is
somewhat related to a Computer Algebra System, but is
not really one since it treats symbolic expressions as
mathematical entities such as polynomials, series,
matrices, etc..., and not as expressions per se. However
it is often much faster than other CAS, and contains a
huge number of specific functions not found elsewhere,
essentially for use in number theory. In particular,
and especially so in the present release, there is a
very large package for working in general algebraic
number fields.
Systems : Binaries available for SPARC v7, v8, DEC Alpha, HP-PA.
In the future, Mac (68k and powerPC).
Intel hardware may have unsupported versions.
Version : 1.39a, 19 January 1995
Author : pari@math.u-bordeaux.fr
See also, for a
description of Pari-Gp latest version 1.39a