IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v42y1996i4p629-638.html
   My bibliography  Save this article

Stability analysis by quantifier elimination

Author

Listed:
  • Steinberg, Stanly
  • Liska, Richard

Abstract

Stability is one of the important properties of time-stepping numerical schemes that are used to approximate partial differential equations. Stability can be analyzed using Von Neumann stability analysis which is a Fourier method. The analysis results in the Von Neumann stability condition which is transformed into a set of universally quantified polynomial inequalities. The universally quantified variables are eliminated by the quantifier elimination using the cylindrical algebraic decomposition algorithm. The resulting stability condition is a set of analytic inequalities which place constraints on the parameters of the numerical scheme. All the stages of the analysis are done using symbolic computation.

Suggested Citation

  • Steinberg, Stanly & Liska, Richard, 1996. "Stability analysis by quantifier elimination," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 42(4), pages 629-638.
  • Handle: RePEc:eee:matcom:v:42:y:1996:i:4:p:629-638
    DOI: 10.1016/S0378-4754(96)00039-0
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475496000390
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/S0378-4754(96)00039-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Banshchikov, Andrej & Bourlakova, Larissa, 2001. "Computer algebra and problems of motion stability," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 57(3), pages 161-174.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:42:y:1996:i:4:p:629-638. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.