Exact Bivariate Polynomial Factorization over Q by Approximation of Roots

作     者：FENG Yong WU Wenyuan ZHANG Jingzhong CHEN Jingwei 

作者机构：Chongqing Key Lab of Automated Reasoning and CognitionChongqing Institute of Green and Intelligent Technology(CIGIT)Chinese Academy of Sciences 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2015年第28卷第1期

页      面：243-260页

核心收录：

学科分类：07[理学] 070102[理学-计算数学] 0701[理学-数学] 

基　　金：partly supported by the National Natural Science Foundation of China under Grant Nos.91118001 and 11170153 the National Key Basic Research Project of China under Grant No.2011CB302400 Chongqing Science and Technology Commission Project under Grant No.cstc2013jjys40001 

主　　题：Factorization of multivariate polynomials interpolation methods minimal polynomial numerical continuation. 

摘      要：Factorization of polynomials is one of the foundations of symbolic *** applications arise in numerous branches of mathematics and other ***,the present advanced programming languages such as C++ and J++,do not support symbolic computation ***,it leads to difficulties in applying factorization in engineering *** this paper,the authors present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational *** proposed method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision *** addition,the numerical computation part often only requires double precision and is easily parallelizable.