Skip to main content
Log in

Quantifier elimination supported proofs in the numerical treatment of fluid flows

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

During the analysis of numerical methods for fluid flows some properties of numerical methods as stability or monotonicity can be stated as quantified problems and proved by quantifier elimination. A case study demonstrating such proofs is presented. The study shows that the stability region of the central scheme for advection-diffusion equation with Runge–Kutta time discretization is much bigger than classical stability region.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brown, C.W.: QEPCAD B—a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 37(4), 97–108 (2003). http://www.cs.usna.edu/~qepcad/B/QEPCAD.html

  2. Brown, C.W.: SLFQ—simplifying large formulas with QEPCAD B (2005). http://www.cs.usna.edu/~qepcad/SLFQ/Home.html

  3. Collins, G.E.: Quantifier elimination in the elementary theory of real closed fields by cylindrical algebraic decomposition, vol. 33. In: Lecture Notes in Computer Science, pp. 134–183. Springer, Berlin (1975)

  4. Collins G.E. and Hong H. (1991). Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comp. 12(3): 299–328

    Article  MATH  MathSciNet  Google Scholar 

  5. Dolzmann, A., Seidl, A., Sturm, T.: REDLOG User Manual edn 3.0 (2004). http://www.fmi.uni-passau.de/~seidl/publications/DSS04b.pdf

  6. Hong, H.: Improvements in cad-based quantifier elimination. Ph.D. thesis, The Ohio State University (1990)

  7. Hong H., Liska R. and Steinberg S. (1997). Testing stability by quantifier elimination. J. Symbolic Comput. 24(2): 161–187

    Article  MATH  MathSciNet  Google Scholar 

  8. Ratschan, S.: Approximate quantified constraint solving (AQCS) (2000). http://www.mpi-sb.mpg.de/~ratschan/AQC. Software Package

  9. Ratschan, S.: Continuous first-order constraint satisfaction. In: Proceedings of artificial intelligence and symbolic computation, LNCS. Springer, Berlin (2002)

  10. Sladek, I.: Mathematical modelling and numerical solution of some 2d- and 3d-cases of atmoshperic boundary layer flow. Ph.D. thesis, Czech Technical University in Prague (2005)

  11. Strikwerda J. (1989). Finite Difference Schemes and Partial Differential Equations. Wadsworth, Belmont

    MATH  Google Scholar 

  12. Strzebonski A. (2000). Solving systems of strict polynomial inequalities. J. Symbolic Comput. 29(3): 471–480

    Article  MATH  MathSciNet  Google Scholar 

  13. Swanson, R.C., Turkel, E.: Multistage schemes with multigrid for euler and Navier–Stokes equations. Tech. Rep. 3631 NASA

  14. Weispfenning V. (1997). Quantifier elimination for real algebra—the quadratic case and beyond. Appl. Algebra Eng. Commun. Comput. 8(2): 85–101

    Article  MATH  MathSciNet  Google Scholar 

  15. Yanami, H., Anai, H.: Development of SyNRAC. In: Lecture Notes in Computer Science, 3516, pp. 602–610. Springer, Berlin (2005)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Richard Liska.

Additional information

This work was supported in part by the Czech Ministry of Education projects MSM 6840770010 and LC06052.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liska, R., Váchal, P. Quantifier elimination supported proofs in the numerical treatment of fluid flows. AAECC 18, 575–582 (2007). https://doi.org/10.1007/s00200-007-0057-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-007-0057-6

Keywords

Navigation