3.1.1 GPL (GNU General Public License)    
2.9/5 15


SINGULAR is a computer algebra system for polynomial computations.





SINGULAR is a computer algebra system for polynomial computations in commutative algebra, algebraic geometry, and singularity theory.

Its main computational objects are ideals and modules over a large variety of baserings. The baserings are polynomial rings over a field (eg. finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to an ideal.

It features fast and general implementations for computing Groebner and standard bases, including Buchberger's algorithm and Mora's Tangent Cone algorithm. Its interactive shell and C-like programming language can be extended by libraries written in the SINGULAR programming language.

Here are some key features of "SINGULAR":

· Main computational objects: ideals/modules over very general polynomial rings over various ground fields.
· Large variety of algorithms implemented in kernel (written in C/C++).
· Many more algorithms implemented as SINGULAR libraries.
· Intuitive, C-like programming language.
· Extensive documentation: Manual (info, ps, and html), Publications.
· Available for most hard- and software platforms: Unix (HP-UX, SunOS, Solaris, Linux, AIX), Windows, Macintosh.

What's New in This Release:

· This version is mainly a bugfix release, but it also contains some new features.
· Speed was improved for 64-bit architectures.
· The dmod.lib and perron.lib libraries were added.
· center.lib was improved. ncalg.lib was revised.
· New algorithms were added in primdec.lib.
· An improved version of slimgb was incorporated into groebner.
· The module generator (modgen) was improved.
· The build process was improved to build automatically without patches on 64-bit architectures.
Last updated on March 24th, 2010

#polynomial computations #algebra system #algebraic geometry #SINGULAR #polynomial #computations #algebra

0 User reviews so far.