近似GCD的广义伴随矩阵
Generalized companion matrix for approximate GCD
摘要:
我们研究了一元近似GCD问题的一个变体,其中一个多项式f(x)的系数是精确已知的,而第二个多项式g(x)的系数可能是扰动的。我们的方法依赖于描述商环C[x]=(f)上的乘法算子的矩阵的性质。特别地,乘法矩阵的零空间的结构包含了关于GCD(f; g)的所有基本信息。此外,乘法矩阵表现出位移结构,使我们能够设计一个快速算法近似GCD计算的二次复杂度w.r.t.多项式次数
英文摘要:
We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]=(f). In particular, the structure of the null space of the multiplication matrix contains all the essential information about GCD(f; g). Moreover, the multiplication matrix exhibits a displacement structure that allows us to design a fast algorithm for approximate GCD computation with quadratic complexity w.r.t. polynomial degrees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。