Implicit upwind solution algorithms for three-dimensional unstructured meshes

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxat...

Full description

Saved in:
Bibliographic Details
Published in:AIAA journal 1993-05, Vol.31 (5), p.801-805
Main Author: Batina, John T
Format: Article
Language:English
Subjects:
420400 - Engineering- Heat Transfer & Fluid Flow
990200 - Mathematics & Computers
Aerodynamics
ALGORITHMS
COMPUTERIZED SIMULATION
COMPUTERS
CRAY COMPUTERS
DIFFERENTIAL EQUATIONS
ENGINEERING
EQUATIONS
Exact sciences and technology
Fluid dynamics
FLUID FLOW
Fundamental areas of phenomenology (including applications)
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
General theory
MATHEMATICAL LOGIC
MESH GENERATION
PARALLEL PROCESSING
Physics
PROGRAMMING
SIMULATION
STEADY FLOW
TIME DEPENDENCE
TRANSONIC FLOW
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using a mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.
ISSN:0001-1452
1533-385X
DOI:10.2514/3.11685