.png){kind=icon}
.png){kind=icon}
Return
Generic regular decompositions for generic zero-dimensional systems
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-013-5057-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 subresultants. 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 16 and experimented with a number of benchmarks from the literature. Empirical results are also presented to show the good performance of the algorithm.
Keywords:
generic zero-dimensional system
regular-decomposition-unstable variety
parametric triangular decomposition
generic regular decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K