Quantifier elimination for approximate Beals-Kartashova factorization
| dc.creator | Kartashova, Elena | |
| dc.creator | McCallum, Scott | |
| dc.date | 2007-01-07 | |
| dc.date.accessioned | 2026-07-07T08:02:20Z | |
| dc.date.available | 2026-07-07T08:02:20Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math-ph/0701019 | |
| dc.identifier | http://arxiv.org/abs/math-ph/0701019 | |
| dc.identifier | Lecture Notes in Computer Science (LNCS) 4573, pp. 106-115 ( 2007). Springer | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/129205 | |
| dc.subject | Mathematical Physics | |
| dc.subject | Analysis of PDEs | |
| dc.title | Quantifier elimination for approximate Beals-Kartashova factorization | |
| dc.type | text |