【摘要】 本文提出了一种不必预先分解升列为不可约于列而克服所谓“可约性困难”的方法．由于使用了吴除法及子结式计算，我们也称这种方法为ＷＲ分解算法．更多还原

【Abstract】 In this paper, we present a method, with which ascending chains need not be factorized beforehand, to overcome the so-called "reducibility difficulty".Employing Wu’s division and sub-resultant computations,we call it WR decomposition algorithm.更多还原