SINGULAR
SINGULAR is a Computer Algebra System for polynomial
computations with special emphasis on the needs of commutative algebra,
algebraic geometry, singularity theory, and polynomial system solving.
SINGULAR's main computational objects are ideals and
modules over a large variety of baserings. The baserings are polynomial
rings or localizations thereof over a field (e.g., finite fields, the
rationals, floats, algebraic extensions, transcendental extensions) or
over a
limited set of rings, or over quotient rings with respect to an ideal.
SINGULAR features one of the
fastest and most general implementations of various algorithms for
computing Groebner
resp. standard bases. The implementation includes Buchberger's
algorithm (if the ordering is a wellordering) and Mora's algorithm (if
the
ordering is a tangent cone ordering) as special cases. Furthermore, it
provides polynomial factorization, resultant, characteristic set and
gcd computations, syzygy and free-resolution computations, and many
more related functionalities.
Features include:
- 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
- Emacs user interface
- Large set of libraries
Return
to Geometry Software Home Page
Last Updated Saturday, April 13 2013 @ 05:57 PM EDT
| 
