Quantifier elimination for approximate factorization of linear partial differential operators

被引:0
作者
Kartashova, Elena [1 ]
McCallum, Scott [2 ]
机构
[1] Univ Linz, RISC, A-4040 Linz, Austria
[2] Macquarie Univ, Sydney, NSW, Australia
来源
TOWARDS MECHANIZED MATHEMATICAL ASSISTANTS | 2007年 / 4573卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:106 / +
页数:3
相关论文
共 8 条
[1]   CYLINDRICAL ALGEBRAIC DECOMPOSITION .2. AN ADJACENCY ALGORITHM FOR THE PLANE [J].
ARNON, DS ;
COLLINS, GE ;
MCCALLUM, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :878-889
[2]  
BEALS R, 2005, TMPH, V145, P1510
[3]  
Brown C. W., 2003, SIGSAM Bulletin, V37, P97, DOI 10.1145/968708.968710
[4]  
BUCHBERGER B, 2005, COMMUNICATION
[5]  
Caviness B.F., 1998, Quantifier Elimination and Cylindrical Algebraic Decomposition
[6]   PARTIAL CYLINDRICAL ALGEBRAIC DECOMPOSITION FOR QUANTIFIER ELIMINATION [J].
COLLINS, GE ;
HONG, H .
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 12 (03) :299-328
[7]  
GeorgeE Collins, 1975, AUTOMATA THEORY FORM, P134, DOI [DOI 10.1007/3-540-07407-4_17, DOI 10.1007/3]
[8]  
KARTASHOVA E, 2006, P GIFT 2006 U KARLSR, P225