Decomposing algebraic varieties (Q4946083)

In a previous article [\textit{D. Wang}, Comput. Aided Geom. Des. 9, No. 6, 471-484 (1992; Zbl 0776.14014)], the author studied algorithms for decomposing an algebraic variety into its unmixed or irreducible components by using the method of characteristic sets (and Gröbner bases). Here, the author replaces the characteristic set method in these algorithms by two other elimination methods using triangular sets. One method is based on ideas of Seidenberg and has been developed by the author earlier [\textit{D. Wang}, J. Symb. Comput. 16, No. 2, 83-114 (1993; Zbl 0803.13016)], while the other uses subresultant regular subchains, which the author studied in J. Symb. Comput. 25, No. 3, 295-314 (1998; Zbl 0913.12008). Experimental results are given that show that these new methods are faster than the characteristic set method in most of the examples tested. For the entire collection see [Zbl 0929.00067].