Physics – Mathematical Physics
Scientific paper
2007-01-07
Lecture Notes in Computer Science (LNCS) 4573, pp. 106-115 ( 2007). Springer
Physics
Mathematical Physics
Scientific paper
The only known constructive factorization algorithm for linear partial differential operators (LPDOs) is Beals-Kartashova (BK) factorization \cite{bk2005}. One of the most interesting features of BK-factorization: at the beginning all the first-order factors are constructed and afterwards the factorization condition(s) should be checked. This leads to the important application area - namely, numerical simulations which could be simplified substantially if instead of computation with one LPDE of order $n$ we will be able to proceed computations with $n$ LPDEs all of order 1. In numerical simulations it is not necessary to fulfill factorization conditions exactly but with some given accuracy, which we call approximate factorization. The idea of the present paper is to look into the feasibility of solving problems of this kind using quantifier elinination by cylindrical algebraic decomposition.
Kartashova Elena
McCallum Scott
No associations
LandOfFree
Quantifier elimination for approximate Beals-Kartashova factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantifier elimination for approximate Beals-Kartashova factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantifier elimination for approximate Beals-Kartashova factorization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370241