Algorithms for the Euler and Navier-Stokes equations for supercomputers
Read Online

Algorithms for the Euler and Navier-Stokes equations for supercomputers

  • 948 Want to read
  • ·
  • 20 Currently reading

Published by National Aeronautics and Space Administration, Langley Research Center in Hampton, Va .
Written in English


  • Algorithms.,
  • Euler"s numbers.,
  • Navier-Stokes equations.

Book details:

Edition Notes

StatementEli Turkel.
SeriesICASE report -- no. 85-11., NASA contractor report -- 172543., NASA contractor report -- NASA CR-172543.
ContributionsLangley Research Center., Institute for Computer Applications in Science and Engineering.
The Physical Object
Pagination1 v.
ID Numbers
Open LibraryOL17667541M

Download Algorithms for the Euler and Navier-Stokes equations for supercomputers


The steady state Euler and Navier-Stokes equations are considered for both compressible and incompressible flow. Methods are found for accelerating the convergence to a steady state. This acceleration is based on preconditioning the system so that it is no longer time consistent. In order that the acceleration technique be scheme-independent, this preconditioning is done at the differential Cited by: 3. Algorithms for the Euler and Navier-Stokes equations for supercomputers by E. Turkel, unknown edition. Get this from a library! Algorithms for the Euler and Navier-Stokes equations for supercomputers. [E Turkel; Langley Research Center.; Institute for Computer Applications in Science and Engineering.].   Efficient and robust algorithms for solution of the adjoint compressible Navier-Stokes equations with applications International Journal for Numerical Methods in Fluids, Vol. 60, No. 4 Implicit Weighted Essentially Nonoscillatory Schemes with Antidiffusive Flux for Compressible Viscous Flows.

3. Equation of state Although the Navier-Stokes equations are considered the appropriate conceptual model for fluid flows they contain 3 major approximations: Simplified conceptual models can be derived introducing additional assumptions: incompressible flow Conservation of mass (continuity) Conservation of momentum Difficulties. Ryo Kanamaru, Optimality of logarithmic interpolation inequalities and extension criteria to the Navier–Stokes and Euler equations in Vishik spaces, Journal of Evolution Equations, /s, (). the mathematics of the Navier–Stokes (N.–S.) equations of incompressible flow and the algorithms that have been developed over the past 30 years for solving them. This author is thoroughly convinced that some background in the mathematics of the N.–S. equations is . Computational fluid dynamics (CFD) is a branch of fluid mechanics that uses numerical analysis and data structures to analyze and solve problems that involve fluid ers are used to perform the calculations required to simulate the free-stream flow of the fluid, and the interaction of the fluid (liquids and gases) with surfaces defined by boundary conditions.

  A Gridless-Finite Volume Hybrid Algorithm for Euler Equations Chinese Journal of Aeronautics, Vol. 19, No. 4 Spectral difference method for unstructured grids I: Basic formulation. Navier–Stokes equations: theory and numerical analysis / by Roger Temam. p. cm. Discretization of Stokes equations (II) 45 5. Numerical algorithms 91 6. The penalty method 98 purpose of the book: the Euler equations and the compressible Navier-Stokes equa-tions. It is suggested to the reader to peruse this appendix before reading the.   In this paper, the direct and adjoint global modes are found using the low Mach number (LMN) formulation of the Navier–Stokes equations,.Starting from the non-dimensionalized fully-compressible Navier–Stokes equations, each variable is expressed in a form similar to p = p (0) + γMa 2 p (1) + ⋯, where p is the non-dimensional pressure. The Mach number, Ma, and the ratio of specific. 1. The Euler and Navier-Stokes Equations 2. An Implicit Finite-Di erence Algorithm for the Euler and Navier-Stokes Equations 3. Generalized Curvilinear Coordinate Transformation 4. Thin-Layer Approximation 5. Spatial Di erencing 6. Implicit Time Marching and the Approximate Factorization Algorithm 7. Boundary Conditions 1.