Singular in framework for polynomial computations
Singular is a specialized computer algebra system for polynomial computations. The kernel implements a variety of Gröbner base-type algorithms, algorithms to compute free resolutions of ideals, combinatorial algorithms for computations of invariants from standard bases and algorithms for numerical solving of polynomial systems. The author presents the advantages with Singular in having fast, specialized tools in a framework for polynomial computations and flexible communication links. Several implementation techniques used in singular are discussed. The second part of the paper presents the fast and flexible communication links. For the entire collection see [Zbl 1008.00013].
- SINGULAR: A computer algebra system for singularity theory, algebraic geometry and commutative algebra
- The polymake interface in Singular and its applications
- 21 years of SINGULAR experiments in mathematics
- scientific article; zbMATH DE number 2151198
- Extending Singular with new types and algorithms
- On an implementation of standard bases and syzygies in SINGULAR
- scientific article; zbMATH DE number 1262421 (Why is no real title available?)
- Singular functions of polynomial matrices
- New bounds on quotient polynomials with applications to exact division and divisibility testing of sparse polynomials
- A new bound on cofactors of sparse polynomials
This page was built for publication: Singular in framework for polynomial computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418127)