Multiple grid and Osher's scheme for the efficient solution of the steady Euler equations (Q1088548)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Multiple grid and Osher's scheme for the efficient solution of the steady Euler equations
scientific article

    Statements

    Multiple grid and Osher's scheme for the efficient solution of the steady Euler equations (English)
    0 references
    0 references
    0 references
    1986
    0 references
    An iterative method is developed for the solution of the steady Euler equations for inviscid flow. The system of hyperbolic conservation laws is discretized by a finite-volume Osher-discretization. The iterative method is a multiple grid (FAS) iteration with symmetric Gauss-Seidel (SGS) as a relaxation method. Initial estimates are obtained by fully multigrid (FMG). In the pointwise relaxation the equations are kept in block-coupled form and local linearization of the equations and the boundary conditions is considered. The efficient formulation of Osher's discretization of the 2-D non-isentropic steady Euler equations and its linearization is presented. The efficiency of FAS-SGS iteration is shown for a transonic model problem. It appears that, for the problem considered, the rate of convergence is almost independent of the gridsize and that for all meshizes the discrete system is solved up to truncation error accuracy in only a few (2 or 3) iteration cycles.
    0 references
    iterative method
    0 references
    steady Euler equations
    0 references
    inviscid flow
    0 references
    hyperbolic conservation laws
    0 references
    finite-volume Osher-discretization
    0 references
    pointwise relaxation
    0 references
    local linearization
    0 references
    boundary conditions
    0 references
    Osher's discretization
    0 references
    non-isentropic steady Euler equations
    0 references
    transonic model problem
    0 references
    rate of convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references