We study the theoretical relationship between these various approaches to triangular sets, namely characteristic set (Ritt, 1932; Wu, 1984a), regular chain and representation of a regular chain.Expand

We propose a new efficient and practical algorithm for computing a set of zero-dimensional systems whose zeros contain at least one point on each semi-algebraically connected component of the studied variety, without any assumption either on the variety (smoothness or compactness for example) or on the system of equations which define it.Expand

This paper presents an algorithm for computing algebraically relative resolvents which enhances an existing algorithm by avoiding the accumulation of superfluous powers in the intermediate computations.Expand

This paper presents methods for zero and ideal decomposition of partial differential polynomial systems and the application of these methods to deal with problems from the local theory of surfaces.Expand

We show that for generating dynamic diagrams automatically the performance of this approach can be enhanced, in terms of stability of numeric computation and quality of generated diagrams, when the used solution formulas of cubic and quartic equations are replaced by newly introduced real solution formulas with inequality constraints.Expand

This paper presents an efficient algorithm called SolvingFuzzySystem, or SFS, for finding real solutions of polynomial systems whose coefficients are fuzzy numbers with finite support and bijective spread functions.Expand

This paper presents an efficient algorithm called SolveFuzzySystem , or SFS , for finding real solutions of polynomial systems whose coefficients are symmetrical L-R fuzzy numbers with bounded support for which the spread functions L and R are bijective.Expand