arXiv · 1204.3442
Solving via modular methods
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.
Explore related subjects
Keep this discovery
Deeba Afzal, Faira Kanwal, Gerhard Pfister, Stefan Steidel. 2012-04-16. Solving via modular methods. https://arxiv.org/abs/1204.3442
Cite the original work for its findings. Save a collection to share your selection of sources.