2012/04/16 by Deeba Afzal, Faira Kanwal, Afzal, Deeba +5
Computer Science · Mathematics · #13P15 (Primary) 68W10 (Secondary) #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #G.4 #I.1.2 #Numerical Methods and Algorithms #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.1204.3442
openalex publication_date 2012/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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öller's algorithm (cf. [Mö93]) of the corresponding ideal in the polynomial ring over the rationals using modular methods, and then apply a solver for univariate polynomials.