Computing Triangular Systems and Regular Systems

A previous algorithm of computing simple systems is modified and extended to compute triangular systems and regular systems from any given polynomial system. The resulting algorithms, based on the computation of subresultant regular subchains, have a simple structure and are efficient in practice. Preliminary experiments indicate that they perform at least as well as some of the known algorithms. Several properties about regular systems are also proved.