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.
Recommendations
Cites work
- A Singular Introduction to Commutative Algebra
- scientific article; zbMATH DE number 3635377 (Why is no real title available?)
- Mapping integers and Hensel codes onto Farey fractions
- On decomposing systems of polynomial equations with finitely many solutions
- Parallelization of modular algorithms
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
Cited in
(5)- Solving word equations modulo partial commutations
- Best solving modal equations
- Usage of modular techniques for efficient computation of ideal operations
- Algorithms for computing triangular decomposition of polynomial systems
- scientific article; zbMATH DE number 1391176 (Why is no real title available?)
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)