research-article

Algorithms for computing triangular decompositions of polynomial systems

Authors:

Marc Moreno MazaAuthors Info & Claims

ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computation

Pages 83 - 90

https://doi.org/10.1145/1993886.1993904

Published: 08 June 2011 Publication History

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.

References

[1]

P. Aubry, D. Lazard, and M. Moreno Maza. On the theories of triangular sets. J. Symb. Comp., 28(1--2):105--124, 1999.

Digital Library

[2]

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.

Digital Library

[3]

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.

Digital Library

[4]

C. Chen and M. Moreno Maza. Algorithms for Computing Triangular Decompositions of Polynomial System. CoRR, 2011.

Digital Library

[5]

C. Chen, M. Moreno Maza, B. Xia, and L. Yang. Computing cylindrical algebraic decomposition via triangular decomposition. In ISSAC'09, pages 95--102, 2009.

Digital Library

[6]

S.C. Chou and X.S. Gao. Solving parametric algebraic systems. In Proc. ISSAC'92, pages 335--341, 1992.

Digital Library

[7]

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.

Digital Library

[8]

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.

Digital Library

[9]

L. Ducos. Optimizations of the subresultant algorithm. Journal of Pure and Applied Algebra, 145:149--163, 2000.

[10]

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.

Digital Library

[11]

É. Hubert. Factorization free decomposition algorithms in differential algebra. J. Symb. Comp., 29(4--5):641--662, 2000.

Digital Library

[12]

M. Kalkbrener. A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comp., 15:143--167, 1993.

Digital Library

[13]

D. Lazard. A new method for solving algebraic systems of positive dimension. Discr. App. Math, 33:147--160, 1991.

Digital Library

[14]

G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity, 19(4):564--596, 2003.

Digital Library

[15]

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.

Digital Library

[16]

B. Mishra. Algorithmic Algebra. Springer-Verlag, 1993.

Digital Library

[17]

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.

[18]

T. Shimoyama and K. Yokoyama. Localization and primary decomposition of polynomial ideals. J. Symb. Comput., 22(3):247--277, 1996.

Digital Library

[19]

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.

[20]

D. K. Wang. The Wsolve package. http://www.mmrc.iss.ac.cn/~dwang/wsolve.txt.

[21]

D. M. Wang. Elimination Methods. Springer, New York, 2000.

[22]

W. T. Wu. A zero structure theorem for polynomial equations solving. MM Research Preprints, 1:2--12, 1987.

[23]

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.

[24]

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.

Cited By

Li XNiu W(2022)Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zerosMathematical Methods in the Applied Sciences10.1002/mma.815845:12(7243-7254)Online publication date: 19-May-2022
https://doi.org/10.1002/mma.8158
Chen C(2020)Chordality Preserving Incremental Triangular Decomposition and Its ImplementationMathematical Software – ICMS 202010.1007/978-3-030-52200-1_3(27-36)Online publication date: 8-Jul-2020
https://doi.org/10.1007/978-3-030-52200-1_3
Li WYuan C(2019)Elimination Theory in Differential and Difference AlgebraJournal of Systems Science and Complexity10.1007/s11424-019-8367-x32:1(287-316)Online publication date: 14-Feb-2019
https://doi.org/10.1007/s11424-019-8367-x
Show More Cited By

Index Terms

Algorithms for computing triangular decompositions of polynomial systems
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms

Recommendations

Triangular decomposition of semi-algebraic systems
ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

Regular 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 computation

Cylindrical 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 computation

The 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

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computation

June 2011

372 pages

ISBN:9781450306751

DOI:10.1145/1993886

General Chair:
Éric Schost
The University of Western Ontario, Canada
,
Program Chair:
Ioannis Z. Emiris
University of Athens, Greece

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISSAC '11

Sponsor:

SIGSAM

ISSAC '11: International Symposium on Symbolic and Algebraic Computation

June 8 - 11, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
87
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li XNiu W(2022)Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zerosMathematical Methods in the Applied Sciences10.1002/mma.815845:12(7243-7254)Online publication date: 19-May-2022
https://doi.org/10.1002/mma.8158
Chen C(2020)Chordality Preserving Incremental Triangular Decomposition and Its ImplementationMathematical Software – ICMS 202010.1007/978-3-030-52200-1_3(27-36)Online publication date: 8-Jul-2020
https://doi.org/10.1007/978-3-030-52200-1_3
Li WYuan C(2019)Elimination Theory in Differential and Difference AlgebraJournal of Systems Science and Complexity10.1007/s11424-019-8367-x32:1(287-316)Online publication date: 14-Feb-2019
https://doi.org/10.1007/s11424-019-8367-x
Chen CMoreno Maza M(2014)An Incremental Algorithm for Computing Cylindrical Algebraic DecompositionsComputer Mathematics10.1007/978-3-662-43799-5_17(199-221)Online publication date: 1-Oct-2014
https://doi.org/10.1007/978-3-662-43799-5_17
Chen CDavenport JMoreno Maza MXia BXiao R(2013)Computing with semi-algebraic setsJournal of Symbolic Computation10.1016/j.jsc.2012.05.01352(72-96)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.jsc.2012.05.013
Strzeboński ATsigaridas Evan der Hoeven Jvan Hoeij M(2012)Univariate real root isolation in multiple extension fieldsProceedings of the 37th International Symposium on Symbolic and Algebraic Computation10.1145/2442829.2442878(343-350)Online publication date: 22-Jul-2012
https://dl.acm.org/doi/10.1145/2442829.2442878
Chen CMoreno Maza M(2012)Algorithms for computing triangular decomposition of polynomial systemsJournal of Symbolic Computation10.1016/j.jsc.2011.12.02347:6(610-642)Online publication date: 1-Jun-2012
https://dl.acm.org/doi/10.1016/j.jsc.2011.12.023
Marcus SMaza MVrbik P(2012)On Fulton's algorithm for computing intersection multiplicitiesProceedings of the 14th international conference on Computer Algebra in Scientific Computing10.1007/978-3-642-32973-9_17(198-211)Online publication date: 3-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-32973-9_17
Maza MVrbik P(2011)Inverting matrices modulo regular chainsACM Communications in Computer Algebra10.1145/2016567.201659045:1/2(129-130)Online publication date: 25-Jul-2011
https://dl.acm.org/doi/10.1145/2016567.2016590
Chen CDavenport JMoreno Maza MXia BXiao RSchost ÉEmiris I(2011)Computing with semi-algebraic sets represented by triangular decompositionProceedings of the 36th international symposium on Symbolic and algebraic computation10.1145/1993886.1993903(75-82)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.1145/1993886.1993903
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents