Skip to main content

Part of the book series: Notes on Numerical Fluid Mechanics (NNFM) ((NNFM,volume 35))

Summary

Different approaches for accelerating the convergence of explicit methods for solving the compressible Navier-Stokes equations were investigated. It was found that some of these, combined with the proper multi-grid procedure, can lead to efficient means of solving the Navier-Stokes equations for high speed flows. The findings will be demonstrated on several numerical examples.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Jameson, A., Schmidt, W., and Turkel, E., “Numerical Solutions of the Euler Equations by Finite—Volume Methods Using Runge—Kutta Time—Stepping Schemes”, AIAA Paper 81–1259, June 1981.

    Google Scholar 

  2. Rossow, C.—C., “Flux—Balance Splitting — A New Approach for a Cell Vertex Upwind Scheme”, Proceedings of the 12th International Conference on Numerical Methods in Fluid Dynamics, Oxford, England, July 1990.

    Google Scholar 

  3. Radespiel, R., and Kroll, N., “ A Multigrid Scheme with Semicoarsening for Accurate Computations of Viscous Flows”, Proceedings of the 12th International Conference on Numerical Methods in Fluid Dynamics, Oxford, England, July 1990.

    Google Scholar 

  4. von Lavante, E., El-Miligui, A., Cannizaro, F. and Warda, H.A., “Simple Explicit Upwind Schemes for Solving Compressible Flows”, Proceedings of the 8th GAMM Conference on Numerical Methods in Fluid Mechanics, Vieweg, 1990.

    Google Scholar 

  5. Eberle, A., Schmatz, M.A., and Bissinger, N.C.,“Generalized Flux-Vectors for Hypersonic Shock-Capturing”, AIAA Paper 90–0390, january 1990.

    Google Scholar 

  6. Roe, P.L., “ Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes”, Journal of Comp. Physics, Vol. 43, 1981, pp. 357–372.

    Article  MathSciNet  ADS  MATH  Google Scholar 

  7. Lerat, A., “Implicit Methods of Second-Order Accuracy for the Euler Equations”, AIAA Journal, Vol. 23, January 1985, pp. 33–40.

    Article  MathSciNet  ADS  MATH  Google Scholar 

  8. Turkel, E., Swanson, R.C., Vatsa, V.N. and White, J.A., “Multigrid for Hypersonic Viscous Two-and Three-Dimensional Flows”, AIAA Paper presented at the 10th CFD Conference, Honolulu, Hawaii, June 24–26, 1991.

    Google Scholar 

  9. Cheung, S., Cheer, A., Hafez, M. and Flores, J., “Convergence Acceleration of Viscous and Inviscid Hypersonic Flow Calculations”, AIAA Journal, Vol. 29, No. 8, August 1991, pp. 1214–1222.

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Fachmedien Wiesbaden

About this paper

Cite this paper

von Lavante, E., Grönner, J. (1992). Semiimplicit Schemes for Solving the Navier-Stokes Equations. In: Vos, J.B., Rizzi, A., Ryhming, I.L. (eds) Proceedings of the Ninth GAMM-Conference on Numerical Methods in Fluid Mechanics. Notes on Numerical Fluid Mechanics (NNFM), vol 35. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-13974-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-663-13974-4_24

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-528-07635-1

  • Online ISBN: 978-3-663-13974-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics