从优集出发,提出了相对优集的定义及其计算算法.并将其应用到不可约零点分解中,提供了一种新的不可约零点分解算法.从实例计算结果可知,就某些多项式方程组而言,相对于原来已有的算法,使用相对优集修改后,能够很好地进行分解,减少了冗余分支的出现.

Based on U-set, we propose the definition of relative U-set and its algorithm. A new irreducible zero decomposition algorithm is put forward with the relative U-set. From the decomposition results of some examples, IrrCharSerA algorithm, and the modified irreducible decomposition algorithm from IrrCharSer, can decompose the polynomial set efficiently and reduce the redundant branch.