Sciweavers

20 search results - page 2 / 4
» Triangular Decomposition of Semi-algebraic Systems
Sort
View
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
14 years 1 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
AAECC
2004
Springer
63views Algorithms» more  AAECC 2004»
13 years 6 months ago
Computation of the Decomposition Group of a Triangular Ideal
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
I. Abdeljaouad-Tej, Sébastien Orange, Gu&ea...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie