Deciding Ellipticity by Quantifier Elimination
Co-author(s): Andreas Weber
Reference: Computer Algebra in Scientific Computing - CASC 2003, V.G. Ghanza, E.W. Mayr, E.V. Vorozhtsov (eds.), TU München 2003, pp. 347-355
Description: We discuss how ellipticity of a (possibly overdetermined) linear system of partial differential equations can be decided using quantifier elimination. Our definition of ellipticity is based on the weighted principal symbol introduced by Douglis and Nirenberg. Thus part of the decision procedure is to check whether appropriate weights exist. We present a concrete implementation using MuPAD and Redlog (a quantifier elimination package for Reduce): in the computer algebra system MuPAD we generate a logical formula the truth of which is then decided by Redlog.
Compressed Postscript File: Compressed Postscript (163 kB)
PDF File: PDF (203 kB)
Home, Last update: Fri Aug 24 09:21:10 2007