An improved upwnd finite volume relaxation method for high speed viscous flows

An improved upwind relaxation algorithm for the Navier-Stokes equations is presented, and results are given from the application of the method to two test problems, including (1) a shock/boundary layer interaction on a flat plate (M[sub [infinity]] =2.0) and (2) a high-speed inlet (M[sub [infinity]]...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational physics 1992-03, Vol.99:1
Hauptverfasser: Taylor, A.C. III, Ng, Wing-Fai, Walters, R.W.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An improved upwind relaxation algorithm for the Navier-Stokes equations is presented, and results are given from the application of the method to two test problems, including (1) a shock/boundary layer interaction on a flat plate (M[sub [infinity]] =2.0) and (2) a high-speed inlet (M[sub [infinity]] = 5.0). The technique is restricted to high-speed (i.e., supersonic/hypersonic) viscous flows. The new algorithm depends on a partitioning of the global domain into regions or sub-domains, where a relatively thin [open quotes]elliptic[close quotes] region is identified near each solid wall boundary, and the remainder of the flowfield is identified to be a single larger [open quotes]hyperbolic[close quotes] (i.e., hyperbolic/parabolic in the stream-wise direction) region. A direct solution procedure by lower/upper factorization is applied to the elliptic region(s), the results of which are then coupled to a standard line Gauss-Seidel relaxation sweep across the entire domain in the primary flow direction. In the first test problem, the new algorithm reduced total run times as much as 75% when compared to the standard alternating forward/backward vertical line Gauss-Seidel (VLGS) algorithm, whereas in the second test problem, a total savings as high as 20% was achieved. Essentially all of this improvement occurred only after the initial transient in the solution was overcome. However, in the second test problem, a significant improvement in the computational performance of the standard forward/backward VLGS algorithm was noted when overcoming the initial transient simply by converting from the use of conserved variables to primitive variables in the spatial discretization and linearization of all terms. 22 refs., 11 figs.
ISSN:0021-9991
1090-2716
DOI:10.1016/0021-9991(92)90283-5