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

用CAD投影中的GCD计算构造较少的开胞

Constructing Fewer Open Cells by GCD Computation in CAD Projection

Jingjun Han, Liyun Dai, Bican Xia

摘要:

提出了一种基于柱形代数分解(CAD)的投影算子。新算子计算由不同CAD投影顺序产生的投影因子集的交集。换句话说,它计算由不同CAD投影阶数产生的相同变量中的投影多项式的gcd。我们证明了新算子仍然保证从最高维数的每个连通分支中至少得到一个样本点,因此,可以用来检验多项式的半定性。虽然新方法的复杂度仍然是双指数的,但在许多情况下,新算子确实产生更小的投影因子集和更少的开放单元。利用该方法编制的程序,有效地解决了现有工具难以解决的多项式半定性检验问题。

英文摘要:

A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the intersection of projection factor sets produced by different CAD projection orders. In other words, it computes the gcd of projection polynomials in the same variables produced by different CAD projection orders. We prove that the new operator still guarantees obtaining at least one sample point from every connected component of the highest dimension, and therefore, can be used for testing semi-definiteness of polynomials. Although the complexity of the new method is still doubly exponential, in many cases, the new operator does produce smaller projection factor sets and fewer open cells. Some examples of testing semi-definiteness of polynomials, which are difficult to be solved by existing tools, have been worked out efficiently by our program based on the new method.

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

↑