Generic regular decompositions for generic zero-dimensional systems

DOI10.1007/S11432-013-5057-5zbMATH Open1423.68617arXiv1208.6112OpenAlexW2043491727MaRDI QIDQ2335932FDOQ2335932

Authors: Xiaoxian Tang, Bican Xia, Zhenghong Chen 

Publication date: 18 November 2019

Published in: Science China Information Sciences (Search for Journal in Brave)

Abstract: Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm is proposed for computing a generic regular decomposition and the associated RDU variety of a given generic zero-dimensional system simultaneously. The solutions of the given system can be expressed by finitely many zero-dimensional regular chains if the parameter value is not on the RDU variety. The so called weakly relatively simplicial decomposition plays a crucial role in the algorithm, which is based on the theories of subresultant chains. Furthermore, the algorithm can be naturally adopted to compute a non-redundant Wu's decomposition and the decomposition is stable at any parameter value that is not on the RDU variety. The algorithm has been implemented with Maple 15 and experimented with a number of benchmarks from the literature. Empirical results are also presented to show the good performance of the algorithm.

Full work available at URL: https://arxiv.org/abs/1208.6112

Recommendations

• Generic regular decompositions for parametric polynomial systems
• Regular Decompositions
• Zero decomposition with multiplicity for zero-dimensional polynomial systems
• scientific article; zbMATH DE number 1860738
• Properties of regular systems and algorithmic improvements for regular decomposition

zbMATH Keywords

generic regular decompositionregular-decomposition-unstable varietygeneric zero-dimensional systemparametric triangular decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10)

Cites Work

• 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
• A new algorithm for computing comprehensive Gröbner systems
• Comprehensive Triangular Decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• An elementary approach to subresultants theory.
• Computing triangular systems and regular systems
• Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner 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
• Title not available (Why is that?)

Cited In (3)

• Generic regular decompositions for parametric polynomial systems
• Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems
• Regular Decompositions

Uses Software

• Epsilon
• Maple
• PGB
• DISCOVERER

This page was built for publication: Generic regular decompositions for generic zero-dimensional systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335932)