中国剩余算法在多元多项式最大公因式提取中的应用  

The Application of Chinese Remainder Algorithm in the Acquisition of the GreatestCommon Divisor from Multivariate Polynomial

作　　者：杨宁学[1] 诸昌钤[1] 龚晖[1] 

机构地区：[1]西南交通大学计算机与通信工程学院,成都610031

出　　处：《计算机科学》2005年第6期228-229,232,共3页Computer Science

基　　金：教育部世行贷款"高校考试技术手段的改革与实践"(1282C03041)

摘　　要：本文研究了利用中国剩余算法提取多元整系数多项式的最大公因式的算法,首先将多项式通过同态映射进行逐元化简,直至化为一元多项式,并对一元多项式提取最大公因式,然后利用中国剩余算法对一元最大公因式进行逐元反复提升,最后可得到多元多项式的最大公因式。大量的算例表明该算法是求解多元整系数多项式最大公因式的一种有效算法。The application of Chinese Remainder Algorithm to determine the greatest common divisor of multivariate polynomials is studied Using homostasis mapping, a multivariate polynondal is simplified step by step until only one main variable is left, and the greatest common divisor of the single variable polynomial is obtained by the extended Euclid Algorithm. Then, using the Chinese Remainder Algorithm raises the greatest common divisor from one vari- able to the original multivariate until the real greatest common divisor is gotten. It is an efficient algorithm to solve the greatest coanon divisor of multivariate polynomials.

关 键 词：最大公因式 多元多项式 提取 剩余 中国 整系数多项式 一元多项式 应用 同态映射 有效算法 求解 算例 

分 类 号：O151.2[理学—数学] O174.14[理学—基础数学]