Generic regular decompositions for parametric polynomial systems
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 2151243 (Why is no real title available?)
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- scientific article; zbMATH DE number 1421053 (Why is no real title available?)
- A complete algorithm for automated discovering of a class of inequality-type theorems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Algorithms for computing triangular decomposition of polynomial systems
- Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
- Comprehensive Gröbner bases
- Comprehensive Triangular Decomposition
- Computing triangular systems and regular systems
- Elimination methods
- Generic regular decompositions for generic zero-dimensional systems
- On the theories of triangular sets
- Zero decomposition algorithms for systems of polynomial equations
Cited in
(9)- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Solving parametric polynomial systems by RealComprehensiveTriangularize
- Comprehensive Triangular Decomposition
- Generic regular decompositions for generic zero-dimensional systems
- Regular Decompositions
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Properties of regular systems and algorithmic improvements for regular decomposition
- Stability of parametric decomposition
- First order perturbation and local stability of parametrized systems
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)
