An effective implementation of symbolic–numeric cylindrical algebraic decomposition for quantifier elimination

With many applications in engineering and scientific fields, quantifier elimination (QE) has received increasing attention. Cylindrical algebraic decomposition (CAD) is used as a basis for a general QE algorithm. In this paper we present an effective symbolic–numeric cylindrical algebraic decomposit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 479; s. 43 - 69
Hlavní autoři: Iwane, Hidenao, Yanami, Hitoshi, Anai, Hirokazu, Yokoyama, Kazuhiro
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.04.2013
Témata:
Cylindrical algebraic decomposition
Quantifier elimination
Symbolic–numeric computation
Quantifier elimination
Cylindrical algebraic decomposition
Symbolic–numeric computation
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With many applications in engineering and scientific fields, quantifier elimination (QE) has received increasing attention. Cylindrical algebraic decomposition (CAD) is used as a basis for a general QE algorithm. In this paper we present an effective symbolic–numeric cylindrical algebraic decomposition (SNCAD) algorithm for QE incorporating several new devices, which we call “quick tests”. The simple quick tests are run beforehand to detect an unnecessary procedure that might be skipped without violating the correctness of results and they thus considerably reduce the computing time. The effectiveness of the SNCAD algorithm is examined in a number of experiments including practical engineering problems, which also reveal the quality of the implementation. Experimental results show that our implementation has significantly improved efficiency compared with our previous work.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.10.020