This paper presents a parallel multigrid method for computing inviscid and viscous high speed steady-state reactive flows. The governing equations for reactive flow are solved using an explicit multigrid algorithm while treating the chemical source terms in a point implicit manner. The CUSP (Convect
An efficient algorithm for compressible flows with real gases
β Scribed by P. Glaister
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 592 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0271-2091
No coin nor oath required. For personal study only.
β¦ Synopsis
An efficient algorithm is presented for the solution of the Euler equations of gas dynamics with a general convex equation of state. The scheme is based on solving linearized Riemann problems approximately, and in more than one dimension incorporates operator splitting. In particular, only one function evaluation in each computational cell is required by using a local parametrization of the equation of state. The scheme is applied to two standard test problems in gas dynamics for some specimen equations of state.
π SIMILAR VOLUMES
A simple shock-capturing approach to multicomponent flow problems is developed for the compressible Euler equations with a stiffened gas equation of state in multiple space dimensions. The algorithm uses a quasi-conservative formulation of the equations that is derived to ensure the correct fluid mi
## Abstract A dualβtime implicit meshβless scheme is presented for calculation of compressible inviscid flow equations. The Taylor series leastβsquare method is used for approximation of spatial derivatives at each node which leads to a central difference discretization. Several convergence acceler
The present paper reports on a modified pressure implicit predictor-corrector type scheme for solving the flow governing equations, in which a consistent formulation is combined with a multi-grid solver for the pressure correction. In addition a parabolic sublayer (PSL) approach for the treatment of
This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method