Abstract
SINGULAR is a computer algebra system designed to be a power-house for polynomial computations with special features for algebraic geometry and singularity theory.The development of SINGULAR started in 1986, motivated by the question of the existence of complete intersection singularities which are not quasi-homogeneous, but whose Poincare-complex is exact. The existence of such singularities could be shown in 1987 with an implementation of Mora's algorithm on an Atari in Modula-2 [11]. In 1990, SINGULAR was ported to Unix, and a first public-domain distribution followed. The code of SINGULAR was rewritten in C/C++. An interpreted user-level programming language and user-written libraries were added in 1993. With the release of version 1.0 in May 1997, many important features were added, including:• Polynomial factorization• Factorizing Buchberger algorithm• FGLM algorithm• Primary decomposition of ideals• MP links for general and efficient storage and inter-process communicationsThe goal of the poster is to discuss and demonstrate these new features of SINGULAR where, in combination with the posters on MP and MuPAD, special emphasize will be paid to SINGULAR's MP interface and its resulting possibilities and problems.
Index Terms
- Parallelism in MuPAD
Comments