The CAD Conundrum: Lex-Least vs Order

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)(2020)

引用 0|浏览6
暂无评分
摘要
This paper is part of our ongoing research and collaboration on understanding the relations between CAD algorithms, equational constraints and curtains. Our previous work manages to circumvent the curtain problem in the single equational constraint by taking advantage of the Lex-least valuation (even in the presence of curtains). That method however fails to take full advantage of multiple equational constraints. In this paper we provide further clarification of McCallum's work to validate the use of restricted projection operator at 2 levels. We also discuss the close relationship between order invariant and lex-least invariant CAD's.
更多
查看译文
关键词
Cylindrical Algebraic Decomposition,Equational Constraints,Lex-Least Invariance,Order Invariance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要