多项式的分解与近似根
Decomposition of polynomials and approximate roots
摘要:
给出了一种欧氏除法定理:给定多项式P(x)和P的一个次数因子d,存在多项式h(x),Q(x),R(x)使得P(x)= h(Q(x))+R(x),其中deg h=d.在一定条件下,h,Q,R是唯一的,Q是P的近似d-根,并给出了计算这种分解的算法。我们应用这些结果来决定一个或多个变量的多项式是否是可分解的。
英文摘要:
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is the approximate d-root of P. Moreover we give an algorithm to compute such a decomposition. We apply these results to decide whether a polynomial in one or several variables is decomposable or not.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。