Difference between revisions of "CoCoA:CoCoA 3"
From ApCoCoAWiki
(page created... can anybody add more information? ;)) |
(→About) |
||
Line 1: | Line 1: | ||
== About == | == About == | ||
− | CoCoA 3 was developed | + | CoCoA 3 was developed from 1995 (first release) to 2000. |
== Sub versions == | == Sub versions == |
Revision as of 20:57, 27 June 2005
About
CoCoA 3 was developed from 1995 (first release) to 2000.
Sub versions
- CoCoA 3.0b (1995)
- CoCoA 3.02b (1996)
- CoCoA 3.3 (1997)
- CoCoA 3.4 (March 1998)
- CoCoA 3.5 (July 1998)
- CoCoA 3.6 (December 1998)
- CoCoA 3.7 (June 1999)
Main Developers
- Antonio Capani
- Gianfranco Niesi
Features
CoCoA 3.0b:
- portability (90% of the system is independent of the platform)
- programmability (CoCoAL language)
- arbitrary precision for integer and rational numbers
CoCoA 3.3 Main new features:
- interactive Gröbner framework;
- new algorithms for minimal free resolutions;
- packages;
- new I/O management (devices).
CoCoA 3.4 Main new features:
- ring maps;
- improvement of CoCoAL language;
- univariate factorization over Z;
- computation of toric ideals;
- online help.
CoCoA 3.5 Main new features:
- improvement of CoCoAL language;
- new memory management (simpler way to access variables of different rings);
- autoloading and autoinitializing of packages;
- univariate factorization over Z, Q, and Z/pZ for p prime;
- an updated online help system and an html manual;
- new packages from contributors (integer programming, special varieties, radical).
CoCoA 3.6 Main new features:
- a new package for computations with ideals of points;
- faster computation of Hilbert functions and Poincare series (the POINCARE panel is now unnecessary and so has been disabled);
- a new version of the package for computing radicals of ideals (which now works in greater generality);
- the possibility to have a system-wide Unix/Linux installation.
CoCoA 3.7 Main new features:
- Multivariate factorization over the integers;
- utility functions for modules/vectors (IsTerm, LM, LPP, LPos, Monomials/IsToPos..);
- faster computation of operations on ideals (intersections, saturations,...);
- faster computation of the determinant of matrices with integer entries
- new packages from contributors (algmorph, galois).
A full description of the architecture of CoCoA 3 is presented in the Capani's Ph.D. Thesis (gzipped postscript format).