Coupled solution of the steady compressible Navier-Stokes equations and the \(\kappa -\varepsilon\) turbulence equations with a multigrid method. (English) Zbl 0869.76053
Summary: A relaxation method for the steady turbulent compressible Navier-Stokes equations is developed. The flow equations are fully coupled to the turbulence equations. The principles of the method are illustrated for three different \(k-\varepsilon\) models. The relaxation method can be used in multigrid form. Multigrid results are given for one turbulence model on a flat plate test case.
MSC:
| 76M20 | Finite difference methods applied to problems in fluid mechanics |
| 76N10 | Existence, uniqueness, and regularity theory for compressible fluids and gas dynamics |
| 76F10 | Shear flows and turbulence |
References:
| [1] | Dick, E., Multigrid solution of steady Euler equations based on polynomial flux-difference splitting, Internat. J. Numer. Methods Heat Fluid Flow, 1, 51-62 (1991) |
| [2] | Dimitriadis, K. P.; Leschziner, M. A., Multilevel convergence acceleration for viscous and turbulent transonic flows computed with a cell-vertex method, (Mandel, J.; etal., Proceedings 4th Copper Mountain Conference on Multigrid Methods (1989), SIAM: SIAM Philadelphia, PA), 130-148 |
| [3] | Gerolymos, G. A., Implicit multiple-grid solution of the compressible Navier-Stokes equations using \(k\)−\(ε\) turbulence closure, AIAA J., 28, 1707-1717 (1990) |
| [4] | Jespersen, D. C., A multigrid method for the Euler equations, AIAA-83-0124 (1983) |
| [5] | Lien, F. S.; Leschziner, M. A., Multigrid acceleration for recirculating and turbulent flows computed with a non-orthogonal, collocated finite-volume scheme, Comput. Methods Appl. Mech. Engrg., 118, 351-371 (1994) · Zbl 0848.76062 |
| [6] | Mavriplis, D. J.; Martinelli, L., Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model, Internat. J. Numer. Methods Fluids, 18, 887-914 (1994) · Zbl 0800.76290 |
| [7] | Morrison, J. H., A compressible Navier-Stokes solver with two-equation and Reynolds stress turbulence closure models, NASA Contractor Report 4440 (1992) |
| [8] | Patel, V. C.; Rodi, W.; Scheuerer, G., Turbulence models for near-wall and low Reynolds number flows: a review, AIAA J., 23, 1308-1319 (1984) |
| [9] | Savill, A. M., A synthesis of T3 test case predictions, (Pironneau, O.; etal., Numerical Simulation of Unsteady Flows and Transition to Turbulence (1992), Cambridge University Press: Cambridge University Press Cambridge), 404-442 |
| [10] | Sieger, K.; Schulz, A.; Crawford, M. E.; Wittig, S., Comparitive study of low-Reynolds number \(k\)−\(ε\) turbulence models for predicting heat transfer along turbine blades with transition, (Proceedings International Symposium on Heat Transfer in Turbomachinery. Proceedings International Symposium on Heat Transfer in Turbomachinery, Athens (1992)) |
| [11] | Steelant, J.; Pattijn, S.; Dick, E., Smoothing properties of different preconditioners for Navier-Stokes equations, (Proceedings 3rd Eccomas CFD Conference. Proceedings 3rd Eccomas CFD Conference, Paris (1996)) · Zbl 0896.76073 |
| [12] | Vandromme, D.; Ha Minh, H., About the coupling of turbulence closure models with averaged Navier-Stokes equations, J. Comput. Phys., 65, 386-409 (1986) · Zbl 0627.76065 |
| [13] | D. Vandromme, Turbulence modeling for compressible flows and implementation in Navier-Stokes solvers, VKI-LS 1991-02.; D. Vandromme, Turbulence modeling for compressible flows and implementation in Navier-Stokes solvers, VKI-LS 1991-02. |
| [14] | Yang, Z.; Shih, T. H., New time scale based \(k\)−\(ε\) model for near-wall turbulence, AIAA J., 31, 1191-1198 (1993) · Zbl 0800.76162 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
