高级检索

    郝建强, 辛小龙. 求解一元多项式最大公因式的结矩阵算法[J]. 华东理工大学学报(自然科学版), 1998, (5): 618-622.
    引用本文: 郝建强, 辛小龙. 求解一元多项式最大公因式的结矩阵算法[J]. 华东理工大学学报(自然科学版), 1998, (5): 618-622.
    Hao Jianqiang *, Xin Xiaolong 1) and Mu Yujie 1). Solving the Greatest Common Factor of One variable Polynomials with Resultant Matrix[J]. Journal of East China University of Science and Technology, 1998, (5): 618-622.
    Citation: Hao Jianqiang *, Xin Xiaolong 1) and Mu Yujie 1). Solving the Greatest Common Factor of One variable Polynomials with Resultant Matrix[J]. Journal of East China University of Science and Technology, 1998, (5): 618-622.

    求解一元多项式最大公因式的结矩阵算法

    Solving the Greatest Common Factor of One variable Polynomials with Resultant Matrix

    • 摘要: 应用结矩阵和结多项式性质,引入结最小多项式和标准结基解矩阵等概念,探讨了结矩阵、结多项式与求解一元多项式最大公因式的关系。给出一种求解一无多项式的最大公因式新方法,该方法仅利用结矩阵便可求得多项式的最大公因式。

       

      Abstract: By applying the property of resultant matrix and resultant polynomials and introducing to concepts of resultant minimum polynomials etc.the relations among resultant matrix,resultant polynomials and the greatest common factor of one variable polynomials to be solved are studied. A new method to solve the greatest common factor of one variable polynomials is proposed.Only the resultant matrix is needed to solve the greatest common factor of polynomials in this method.

       

    /

    返回文章
    返回