Generic regular decompositions for parametric polynomial systems
From MaRDI portal
Publication:905159
DOI10.1007/S11424-015-3015-6zbMATH Open1327.93101arXiv1301.3991OpenAlexW1589985400MaRDI QIDQ905159FDOQ905159
Authors: Zhenghong Chen, Xiaoxian Tang, Bican Xia 
Publication date: 14 January 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Abstract: This paper presents a generalization of our earlier work in [19]. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) variety introduced in [19] 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 [19]. 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 [19] 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.
Full work available at URL: https://arxiv.org/abs/1301.3991
Recommendations
Cites Work
- Title not available (Why is that?)
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Title not available (Why is that?)
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Title not available (Why is that?)
- Elimination methods
- Comprehensive Gröbner bases
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- On the theories of triangular sets
- Comprehensive Triangular Decomposition
- Title not available (Why is that?)
- Computing triangular systems and regular systems
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Algorithms for computing triangular decomposition of polynomial systems
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Title not available (Why is that?)
- Zero decomposition algorithms for systems of polynomial equations
- Generic regular decompositions for generic zero-dimensional systems
Cited In (9)
- Comprehensive Triangular Decomposition
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Properties of regular systems and algorithmic improvements for regular decomposition
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- First order perturbation and local stability of parametrized systems
- Stability of parametric decomposition
- Regular Decompositions
- Solving parametric polynomial systems by RealComprehensiveTriangularize
- Generic regular decompositions for generic zero-dimensional systems
Uses Software
This page was built for publication: Generic regular decompositions for parametric polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905159)
