Solving via modular methods

From MaRDI portal



Abstract: In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using M"oller's algorithm (cf. [M"o93]) of the corresponding ideal in the polynomial ring over the rationals using modular methods, and then apply a solver for univariate polynomials.






Describes a project that uses

Uses Software






This page was built for publication: Solving via modular methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455092)