Oberwolfach References on Mathematical Software

SINGULAR

Summary

SINGULAR is a Computer Algebra system for polynomial computations in commutative algebra, algebraic geometry, and singularity theory. SINGULAR‘s main computational objects are ideals and modules over a large variety of baserings. The baserings are polynomial rings over a field (e.g., finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to an ideal. SINGULAR features fast and general implementations for computing Groebner and standard bases, including e.g. Buchberger’s algorithm and Mora’s Tangent Cone algorithm. Furthermore, it provides polynomial factorizations, resultant, characteristic set and gcd computations, syzygy and free-resolution computations, and many more related functionalities. Based on an easy-to-use interactive shell and a C-like programming language, SINGULAR‘s internal functionality is augmented and user-extendible by libraries written in the SINGULAR programming language. A general and efficient implementation of communication links allows SINGULAR to make its functionality available to other programs.

Authors

Gert-Martin Greuel, Gerhard Pfister, Hans Schönemann

Vendor

Centre for Computer Algebra, University of Kaiserslautern

Links

Status

projectstatus   officially approved by the authors

Available via

Operating Systems

Programming Languages

License

GPL

Technical Category

Specialized system

Download pdf description

Contact and Support: it@mfo.de, Imprint/Impressum

 

Valid XHTML 1.0 Transitional CSS is´valid!