arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.04259cs.SC
收藏

一种求截断结式的快速算法

A Fast Algorithm for Computing the Truncated Resultant

Guillaume Moroz, Éric Schost

摘要:

设P和Q是K[x,y]中次数至多为d的两个多项式,其中K是域。用R $\in$ K[x]表示P和Q关于y的结式,给出了在K中计算R mod x^k的一个O~(kd)算术运算的算法,其中O~表示法表示省略了多对数因子。这是对现有算法的改进,现有算法需要在计算R的前k个系数之前在O~(d^3)操作中计算R。

英文摘要:

Let P and Q be two polynomials in K[x, y] with degree at most d, where K is a field. Denoting by R $\in$ K[x] the resultant of P and Q with respect to y, we present an algorithm to compute R mod x^k in O~(kd) arithmetic operations in K, where the O~ notation indicates that we omit polylogarithmic factors. This is an improvement over state-of-the-art algorithms that require to compute R in O~(d^3) operations before computing its first k coefficients.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑