arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.6039cs.SC
收藏

多项式方程组的快速线性代数解法

Polynomial Systems Solving by Fast Linear Algebra

Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault

摘要:

多项式系统求解是数学中的经典问题,有着广泛的应用。这使得它的复杂性成为计算机科学中的一个基本问题。根据上下文,解决有不同的含义。为了坚持最一般的情况下,我们考虑的解决方案,其中一个可以很容易地恢复精确的解决方案或认证的近似。在一般假设下,这样的表示由系统的字典序Gröbner基给出,并且由一组单变量多项式组成。计算字典序格罗布纳基的最著名算法是$\widetilde{O}(d^{3n})$算术运算,其中$n$是变量的数量,$d$是输入系统中方程的最大次数。符号$\widetilde{O}$意味着我们忽略$n$中的多项式因子。我们表明,这种复杂性可以降低到$\widetilde{O}(d^{ωn})$,其中$2 \leq ω< 2.3727$是指数的两个密集矩阵相乘的复杂性。因此,当输入多项式系统是通用的或达到Bézout界时,求解多项式系统的复杂性从$\widetilde{O}(D^3)$降低到$\widetilde{O}(D^ω)$,其中$D$是系统的解的数量。为了实现这一结果,我们提出了新的算法,依赖于快速线性代数。当方程的次数一致有界时,我们提出了一个确定性算法。在无界的情况下,我们提出了一个拉斯维加斯算法。

英文摘要:

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to stick to the most general case, we consider a representation of the solutions from which one can easily recover the exact solutions or a certified approximation of them. Under generic assumption, such a representation is given by the lexicographical Gröbner basis of the system and consists of a set of univariate polynomials. The best known algorithm for computing the lexicographical Gröbner basis is in $\widetilde{O}(d^{3n})$ arithmetic operations where $n$ is the number of variables and $d$ is the maximal degree of the equations in the input system. The notation $\widetilde{O}$ means that we neglect polynomial factors in $n$. We show that this complexity can be decreased to $\widetilde{O}(d^{ωn})$ where $2 \leq ω< 2.3727$ is the exponent in the complexity of multiplying two dense matrices. Consequently, when the input polynomial system is either generic or reaches the Bézout bound, the complexity of solving a polynomial system is decreased from $\widetilde{O}(D^3)$ to $\widetilde{O}(D^ω)$ where $D$ is the number of solutions of the system. To achieve this result we propose new algorithms which rely on fast linear algebra. When the degree of the equations are bounded uniformly by a constant we propose a deterministic algorithm. In the unbounded case we present a Las Vegas algorithm.

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

↑