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

多次齐次多项式系统求解的位复杂性及其在多项式极小化中的应用

Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization

Mohab Safey El Din, Eric Schost

摘要:

多齐次多项式系统出现在许多应用中。我们提供位复杂性估计解决这些问题,最多一些额外的其他因素,是二次的解决方案的数量和线性的高度的输入系统下的一些通用性假设。这些假设基本上意味着所研究的系统的雅可比矩阵在解集处具有最大秩,并且该解集是有限的。该算法是概率的,并提供了概率分析。接下来,我们将这些结果应用到优化问题的线性映射的实迹的代数集。在一些通用性假设下,我们提供了解决这个多项式最小化问题的位复杂度估计。

英文摘要:

Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input system under some genericity assumptions. The assumptions essentially imply that the Jacobian matrix of the system under study has maximal rank at the solution set and that this solution set if finite. The algorithm is probabilistic and a probability analysis is provided. Next, we apply these results to the problem of optimizing a linear map on the real trace of an algebraic set. Under some genericity assumptions, we provide bit complexity estimates for solving this polynomial minimization problem.

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

↑