n个一元多项式的最大公因式的矩阵求法

Several matrix work-out solutions to one yuan polynomial greatest common divisor

高等代数中求最大公因式的方法一般是利用辗转相除法 ,每次求出两个多项式的最大公因式 ,利用矩阵一次可求出若干个多项式的最大公因式。

In higher algebra, the way to work out greatest common divisor is generally by division algorithm, and each time it works out two polynomial greatest common divisors. The paper discusses how matrix works out several polynomial greatest common divisors each time.