Solving via modular methods
Commutative Algebra
2013-06-12 v2
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.
Cite
@article{arxiv.1204.3442,
title = {Solving via modular methods},
author = {Deeba Afzal and Faira Kanwal and Gerhard Pfister and Stefan Steidel},
journal= {arXiv preprint arXiv:1204.3442},
year = {2013}
}
Comments
8 pages