基于NTL算法库的多元多项式因式分解高效实现

High performance implementation of factoring multivariate polynomials based on NTL

针对多元多项式因式分解困难问题,利用现有因式分解算法,提出了一种基于任意精度计算函数库NTL的高效多元多项式因式分解实现方法HPFMP。介绍了NTL算法库,讨论了如何运用该算法库实现高效的数论与计算代数计算;充分利用具备高效、任意精度大整数、实数的计算数论与计算代数的NTL算法库实现了多元多项式因式分解;与现有代数系统Maple11进行了对比测试,实验结果表明,该实现方法具有更高的效率。

Due to the difficulty of factoring multivariate polynomials, a new implementation of high performance named HPFMF was proposed based on NTL and the existence of faetorization algorithms. The NTL was introduced and how to apply the library to implement the algorithms of number theory and computer algebra was discussed. The factoring multivariate polynomials was successfully designed and implemented. Experimental results show that the method is more efficient than factor in Maple 11 for multivariate polynomials.