Generic regular decompositions for parametric polynomial systems

This paper presents a generalization of the authors’ earlier work. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) variety introduced in the authors’ previous work for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU varieties of parametric systems simultaneously on the basis of the algorithm for generic zero-dimensional systems proposed in the authors’ previous work. Then the solutions of any parametric system can be represented by the solutions of finitely many regular systems and the decomposition is stable at any parameter value in the complement of the associated RDU variety of the parameter space. The related definitions and the results presented in the authors’ previous work are also generalized and a further discussion on RDU varieties is given from an experimental point of view. The new algorithm has been implemented on the basis of DISCOVERER with Maple 16 and experimented with a number of benchmarks from the literature.

[1]  M. M. Maza On Triangular Decompositions of Algebraic Varieties , 2000 .

[2]  Bican Xia,et al.  Generic regular decompositions for generic zero-dimensional systems , 2012, Science China Information Sciences.

[3]  佐藤 洋祐,et al.  特集 Comprehensive Grobner Bases , 2007 .

[4]  Michael Kalkbrener,et al.  A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..

[5]  Dongming Wang ZERO DECOMPOSITION ALGORITHMS FOR SYSTEMS OF POLYNOMIAL EQUATIONS , 2000 .

[6]  Dongming Wang,et al.  Computing Triangular Systems and Regular Systems , 2000, J. Symb. Comput..

[7]  Jianliang Tang,et al.  Complete Solution Classification for the Perspective-Three-Point Problem , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  S. Chou Mechanical Geometry Theorem Proving , 1987 .

[9]  Bican Xia,et al.  A complete algorithm for automated discovering of a class of inequality-type theorems , 2001, Science in China Series F Information Sciences.

[10]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[11]  Katsusuke Nabeshima,et al.  A speed-up of the algorithm for computing comprehensive Gröbner systems , 2007, ISSAC '07.

[12]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[13]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[14]  Tomás Recio,et al.  Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems , 2006, Automated Deduction in Geometry.

[15]  Changbo Chen,et al.  Algorithms for computing triangular decomposition of polynomial systems , 2012, J. Symb. Comput..

[16]  Changbo Chen,et al.  Comprehensive Triangular Decomposition , 2007, CASC.

[17]  Changbo Chen,et al.  Computing with semi-algebraic sets represented by triangular decomposition , 2011, ISSAC '11.

[18]  Akira Suzuki,et al.  An alternative approach to comprehensive Gröbner bases , 2002, ISSAC '02.

[19]  Xiang-Gen Xia,et al.  Phase detection based range estimation with a dual-band robust Chinese remainder theorem , 2013, Science China Information Sciences.

[20]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[21]  Xiao-Shan Gao,et al.  Solving parametric algebraic systems , 1992, ISSAC '92.

[22]  Volker Weispfenning,et al.  Comprehensive Gröbner Bases , 1992, J. Symb. Comput..

[23]  Changbo Chen,et al.  Triangular decomposition of semi-algebraic systems , 2013, J. Symb. Comput..

[24]  Yao Sun,et al.  A new algorithm for computing comprehensive Gröbner systems , 2010, ISSAC.

[25]  Marc Moreno Maza,et al.  On the Theories of Triangular Sets , 1999, J. Symb. Comput..

[26]  Bican Xia,et al.  DISCOVERER: a tool for solving semi-algebraic systems , 2007, ACCA.

[27]  Yang Lu Searching dependency between algebraic equations: an algorithm applied to automated reasoning , 1994 .

[28]  Akira Suzuki,et al.  A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases , 2006, ISSAC '06.

[29]  Dongming Wang,et al.  Elimination Methods , 2001, Texts and Monographs in Symbolic Computation.

[30]  Dongming Wang Elimination Practice - Software Tools and Applications , 2004 .