20 search results - page 2 / 4 » Triangular Decomposition of Semi-algebraic Systems |
118
Voted
SNSC
2001
Springer
15 years 8 months ago
2001
Springer
132
Voted
CASC
2007
Springer
15 years 10 months ago
2007
Springer
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...
115
click to vote
AAECC
2004
Springer
15 years 3 months ago
2004
Springer
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...
130
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...