Singular in framework for polynomial computations

From MaRDI portal





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].





Describes a project that uses

Uses Software






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)