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

用同伦技术求解行列式系统

Solving determinantal systems using homotopy techniques

Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu

摘要:

设$\K$是特征为零的域,$\Kbar$是$\K$的代数闭包.考虑$\K[X\_1,\dots,X\_n]$中的多项式序列$G=(g\_1,\dots,g\_s)$,多项式矩阵$\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times q}$,具有$p \leq q$,以及$\G$中的所有多项式和$\F$的所有$p$ -子式为零的$\KKbar$中的点的代数集合$V\_p(F, G)$。这样的多项式系统自然出现在例如多项式优化,计算几何。我们提供的$V\_p(F, G)$中的孤立点的数量取决于行(分别)的最大程度的界限。柱)的$\F$。接下来,我们设计同伦算法来计算这些点。这些算法利用了定义$V\_p(F, G)$的系统的行列式结构。特别是,算法运行的时间是多项式的孤立点的数量上的界限。

英文摘要:

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times q}$, with $p \leq q$,and the algebraic set $V\_p(F, G)$ of points in $\KKbar$ at which all polynomials in $\G$ and all $p$-minors of $\F$vanish. Such polynomial systems appear naturally in e.g. polynomial optimization, computational geometry.We provide bounds on the number of isolated points in $V\_p(F, G)$ depending on the maxima of the degrees in rows (resp. columns) of $\F$. Next, we design homotopy algorithms for computing those points. These algorithms take advantage of the determinantal structure of the system defining $V\_p(F, G)$. In particular, the algorithms run in time that is polynomial in the bound on the number of isolated points.

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

↑