TY - JOUR
T1 - Computing the primary decomposition of zero-dimensional ideals
AU - Monico, Chris
N1 - Funding Information:
I would like to thank the anonymous referees for their valuable input which greatly improved the quality of this manuscript, as well as the Singular group for taking the time to implement the algorithm described here. I was supported by a fellowship from the Center for Applied Mathematics at the University of Notre Dame. This work was also supported in part by NFS grant DMS-00-72383.
PY - 2002/11/1
Y1 - 2002/11/1
N2 - Let K be an infinite perfect computable field and let I ⊆ K[x] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. ln practice, the algorithm generally works in finite fields of large characteristic as well.
AB - Let K be an infinite perfect computable field and let I ⊆ K[x] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. ln practice, the algorithm generally works in finite fields of large characteristic as well.
UR - http://www.scopus.com/inward/record.url?scp=0036851562&partnerID=8YFLogxK
U2 - 10.1006/jsco.2002.0571
DO - 10.1006/jsco.2002.0571
M3 - Article
AN - SCOPUS:0036851562
SN - 0747-7171
VL - 34
SP - 451
EP - 459
JO - Journal of Symbolic Computation
JF - Journal of Symbolic Computation
IS - 5
ER -