Applying Quantifier Elimination to Stability Analysis of Difference Schemes | Zendy

Richard Liška | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Applying Quantifier Elimination to Stability Analysis of Difference Schemes

Author(s) -

Richard Liška

Publication year - 1993

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/36.5.497

Subject(s) - quantifier elimination , stability (learning theory) , von neumann stability analysis , mathematics , partial differential equation , von neumann architecture , algebraic number , decomposition , finite difference , quantifier (linguistics) , algebra over a field , numerical stability , computer science , discrete mathematics , pure mathematics , numerical analysis , mathematical analysis , artificial intelligence , ecology , biology , machine learning

Stability analysis is an important tool for constructing time-stepping finite difference schemes for partial differential equations. This paper describes how von Neumann stability analysis can be reduced to a quantifier elimination problem over the reals. We report our experience in analyzing some difference schemes by using a quantifier elimination package based on the partial cylindricl algebraic decomposition algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research