@inproceedings{a0488f86de4244cfaa765affdb5c0344,

title = "Quantifier elimination for approximate factorization of linear partial differential operators",

abstract = "This paper looks at the feasibility of applying the quantifier elimination program QEPCAD-B to obtain quantifier-free conditions for the approximate factorization of a simple hyperbolic linear partial differential operator (LPDO) of order 2 over some given bounded rectangular domain in the plane. A condition for approximate factorization of such an operator to within some given tolerance over some given bounded rectangular domain is first stated as a quantified formula of elementary real algebra. Then QEPCAD-B is applied to try to eliminate the quantifiers from the formula. While QEPCAD-B required too much space and time to finish its task, it was able to find a partial solution to the problem. That is, it was able to find a nontrivial quantifier-free sufficient condition for the original quantified formula.",

author = "Elena Kartashova and Scott McCallum",

year = "2007",

language = "English",

isbn = "9783540730835",

volume = "4573 LNAI",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "106--115",

editor = "Manuel Kauers and Manfred Kerber and Robert Miner and Wolfgang Windsteiger",

booktitle = "Towards Mechanized Mathematical Assistants - 14th Symposium, Calculemus 2007 - 6th International Conference, MKM 2007, Proceedings",

address = "United States",

note = "14th Symposium on Calculemus 2007 and 6th International Conference on Mathematical Knowledge Management, MKM 2007 ; Conference date: 27-06-2007 Through 30-06-2007",

}