Changbo Chen
ABSTRACT
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a weakened notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the RegularChains library in MAPLE, outperforms solvers with similar specifications by several orders of magnitude on sufficiently difficult problems.
- P. Aubry, D. Lazard, and M. Moreno Maza. On the theories of triangular sets. J. Symb. Comp., 28(1--2):105--124, 1999. Google Scholar
Digital Library
- F. Boulier, D. Lazard, F. Ollivier, and M. Petitot. Representation for the radical of a finitely generated differential ideal. In proceedings of ISSAC'95, pages 158--166, 1995. Google ScholarDigital Library
- C. Chen, O. Golubitsky, F. Lemaire, M. Moreno Maza, and W. Pan. Comprehensive Triangular Decomposition, volume 4770 of LNCS, pages 73--101. Springer Verlag, 2007. Google ScholarDigital Library
- C. Chen and M. Moreno Maza. Algorithms for Computing Triangular Decompositions of Polynomial System. CoRR, 2011.Google ScholarDigital Library
- C. Chen, M. Moreno Maza, B. Xia, and L. Yang. Computing cylindrical algebraic decomposition via triangular decomposition. In ISSAC'09, pages 95--102, 2009. Google ScholarDigital Library
- S.C. Chou and X.S. Gao. Solving parametric algebraic systems. In Proc. ISSAC'92, pages 335--341, 1992. Google ScholarDigital Library
- X. Dahan, M. Moreno Maza, É. Schost, W. Wu, and Y. Xie. Lifting techniques for triangular decompositions. In ISSAC'05, pages 108--115. ACM Press, 2005. Google ScholarDigital Library
- J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Proc. EUROCAL 85 Vol. 2, pages 289--290. Springer-Verlag, 1985. Google ScholarDigital Library
- L. Ducos. Optimizations of the subresultant algorithm. Journal of Pure and Applied Algebra, 145:149--163, 2000.Google ScholarCross Ref
- X.-S. Gao, J. Van der Hoeven, Y. Luo, and C. Yuan. Characteristic set method for differential-difference polynomial systems. J. Symb. Comput., 44:1137--1163, 2009. Google ScholarDigital Library
- É. Hubert. Factorization free decomposition algorithms in differential algebra. J. Symb. Comp., 29(4--5):641--662, 2000. Google ScholarDigital Library
- M. Kalkbrener. A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comp., 15:143--167, 1993. Google ScholarDigital Library
- D. Lazard. A new method for solving algebraic systems of positive dimension. Discr. App. Math, 33:147--160, 1991. Google ScholarDigital Library
- G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity, 19(4):564--596, 2003. Google ScholarDigital Library
- X. Li, M. Moreno Maza, and W. Pan. Computations modulo regular chains. In Proc. ISSAC'09, pages 239--246, New York, NY, USA, 2009. ACM Press. Google ScholarDigital Library
- B. Mishra. Algorithmic Algebra. Springer-Verlag, 1993. Google ScholarDigital Library
- M. Moreno Maza. On triangular decompositions of algebraic varieties. Technical Report TR 4/99, NAG Ltd, Oxford, UK, 1999. Presented at the MEGA-2000 Conference, Bath, England.Google Scholar
- T. Shimoyama and K. Yokoyama. Localization and primary decomposition of polynomial ideals. J. Symb. Comput., 22(3):247--277, 1996. Google ScholarDigital Library
- A.J. Sommese, J. Verschelde, and C. W. Wampler. Solving polynomial systems equation by equation. In Algorithms in Algebraic Geometry, pages 133--152. Springer-Verlag, 2008.Google ScholarCross Ref
- D. K. Wang. The Wsolve package. http://www.mmrc.iss.ac.cn/~dwang/wsolve.txt.Google Scholar
- D. M. Wang. Elimination Methods. Springer, New York, 2000.Google Scholar
- W. T. Wu. A zero structure theorem for polynomial equations solving. MM Research Preprints, 1:2--12, 1987.Google Scholar
- L. Yang, X.R. Hou, and B. Xia. A complete algorithm for automated discovering of a class of inequality-type theorems. Science in China, Series F, 44(6):33--49, 2001.Google Scholar
- L. Yang and J. Zhang. Searching dependency between algebraic equations: an algorithm applied to automated reasoning. Technical Report IC/89/263, International Atomic Energy Agency, Miramare, Trieste, Italy, 1991.Google Scholar
Index Terms
- Algorithms for computing triangular decompositions of polynomial systems
Recommendations
Triangular decomposition of semi-algebraic systems
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic ComputationRegular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue: semi-algebraic ...
Computing cylindrical algebraic decomposition via triangular decomposition
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationCylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an arbitrary ...
Computations modulo regular chains
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationThe computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations based on modular methods and fast ...
Comments