V. G. Ganzha, E. W. Mayr und E. V. Vorozhtsov (Editoren)
In proceedings of Computer Algebra in Scientific Computing (CASC'03), Sept. 2003
Abstract
We show how ellipticity of partial differential systems in the sense of Douglis and Nirenberg can be decided algorithmically by quantifier elimination on real closed fields. A concrete implementation based on MuPAD and Redlog is presented.
Bibtex
@INPROCEEDINGS{seiler-2003-deciding,
author = {Seiler, W. M. and Weber, Andreas},
editor = {Ganzha, V. G. and Mayr, E. W. and Vorozhtsov, E. V.},
title = {Deciding Ellipticity by Quantifier Elimination},
booktitle = {Computer Algebra in Scientific Computing (CASC'03)},
year = {2003},
month = sep,
abstract = {We show how ellipticity of partial differential systems in the sense of Douglis and Nirenberg can be
decided algorithmically by quantifier elimination on real closed fields. A concrete implementation
based on MuPAD and Redlog is presented.}
}