msolve:一个解决多项式系统的库
msolve: A Library for Solving Polynomial Systems
摘要:
我们提出了一个新的开源C库\texttt{msolve},致力于解决多元多项式系统的零维通过计算机代数方法。\texttt{msolve}的核心算法框架依赖于用于多项式系统求解的基于Gr\“obner基和线性代数的算法。它依赖于Gr\“obner基计算w.r.t.\反字典序的次数,Gr\“obner基到字典序Gr\”obner基的转换和一元多项式的实解.我们详细解释这三个主要步骤的解决过程中实施,我们如何利用\texttt{AVX2}指令处理器和更一般的实施思路,我们付诸实践,以更好地利用这个算法框架的计算能力。我们比较了\texttt{msolve}与领先的计算机代数系统,如\textsc{Magma},\textsc{Maple},\textsc{Singular}在广泛的系统与许多复杂的解决方案,显示\texttt{msolve}可以处理的系统,是遥不可及的计算机代数软件的最先进的。
英文摘要:
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and linear algebra based algorithms for polynomial system solving. It relies on Gr\''obner basis computation w.r.t.\ the degree reverse lexicographical order, Gr\''obner conversion to a lexicographical Gr\''obner basis and real solving of univariate polynomials. We explain in detail how these three main steps of the solving process are implemented, how we exploit \texttt{AVX2} instruction processors and the more general implementation ideas we put into practice to better exploit the computational capabilities of this algorithmic framework. We compare the practical performances of \texttt{msolve} with leading computer algebra systems such as \textsc{Magma}, \textsc{Maple}, \textsc{Singular} on a wide range of systems with finitely many complex solutions, showing that \texttt{msolve} can tackle systems which were out of reach by the computer algebra software state-of-the-art.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。