Application of an unsteady Navier-Stokes solver to transonic turbine design
Explore the source record for details and available documents.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
A multigrid acceleration technique developed for solving the three-dimensional Navier-Stokes equations is used for computing high Mach number flows over configurations of practical interest. An explicit multistage Runge-Kutta type of time-stepping scheme is used as the basic algorithm. Solutions are presented for a spherically blunted cone at Mach 10 and a modified shuttle orbiter at Mach 6. The computed surface heat-transfer distributions are shown to compare favorably with the experimental data. Effect of grid-refinement on computed heat-transfer distributions is also examined to assess the numerical accuracy of the computed solutions. The rapid convergence rate associated with multigrid schemes in previous applications at transonic speeds is observed at the higher Mach number flows investigated here.
A state-of-the-art computer code has been developed that incorporates a modified Runge-Kutta time integration scheme, upwind numerical techniques, multigrid acceleration, and multi-block capabilities (RUMM). A three-dimensional thin-layer formulation of the Navier-Stokes equations is employed. For turbulent flow cases, the Baldwin-Lomax algebraic turbulence model is used. Two different upwind techniques are available: van Leer's flux-vector splitting and Roe's flux-difference splitting. Full approximation multi-grid plus implicit residual and corrector smoothing were implemented to enhance the rate of convergence. Multi-block capabilities were developed to provide geometric flexibility. This feature allows the developed computer code to accommodate any grid topology or grid configuration with multiple topologies. The results shown in this dissertation were chosen to validate the computer code and display its geometric flexibility, which is provided by the multi-block structure.
The popular QR algorithm for solving all eigenvalues of an unsymmetric matrix is reviewed. Among the basic components in the QR algorithm, it was concluded from this study, that the reduction of an unsymmetric matrix to a Hessenberg form (before applying the QR algorithm itself) can be done effectively by exploiting the vector speed and multiple processors offered by modern high-performance computers. Numerical examples of several test cases have indicated that the proposed parallel-vector algorithm for converting a given unsymmetric matrix to a Hessenberg form offers computational advantages over the existing algorithm. The time saving obtained by the proposed methods is increased as the problem size increased.
Explore the source record for details and available documents.
A multigrid-based numerical scheme for solving the Navier-Stokes and Euler equations on block-structured grids is presented for flows over complex aircraft configurations. Self-consistency checks are conducted to ascertain that the multiblock code reproduces previously known solutions from single-block codes by splitting a single-block grid into multiple blocks. The newly-developed multiblock code maintains multigrid performance of an equivalent single-block code.
Explore the source record for details and available documents.
A domain decomposition method for implicit schemes that require significantly less storage and is several times faster than factorization algorithms is proposed. The transient domain decomposition method is an extension of the finite element tearing and interconnecting (FETI) method for the solution of static problems. Serial and parallel performance results obtained using the CRAY Y-MP/8 and the iPSC-860/128 systems demonstrate that the FETI method is superior to both serial and parallel direct methods.
This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A multidimensional kinetic fluctuation-splitting scheme has been developed for the Euler equations. The scheme is based on an N-scheme discretization of the Boltzmann equation at the kinetic level for triangulated Cartesian meshes with a diagonal-adaptive strategy. The resulting Euler scheme is a cell-vertex fluctuation-splitting scheme where fluctuations in the conserved-variable vector Q are obtained as moments of the fluctuation in the Maxwellian velocity distribution function at the kinetic level. Encouraging preliminary results have been obtained for perfect gases on Cartesian meshes with first-order spatial accuracy. The present approach represents an improvement to the well-established dimensionally-split upwind schemes.
Continuing improvement in processing speed has made it feasible to solve the Reynolds-Averaged Navier-Stokes equations for simple three-dimensional flows on advanced workstations. Combining multiple workstations into a network-based heterogeneous parallel computer allows the application of programming principles learned on MIMD (Multiple Instruction Multiple Data) distributed memory parallel computers to the solution of larger problems. An overset-grid flow solution code has been developed which uses a cluster of workstations as a network-based parallel computer. Inter-process communication is provided by the Parallel Virtual Machine (PVM) software. Solution speed equivalent to one-third of a Cray-YMP processor has been achieved from a cluster of nine commonly used engineering workstation processors. Load imbalance and communication overhead are the principal impediments to parallel efficiency in this application.
The Lanczos algorithm for the solution of generalized eigen-problem has been receiving a lot of attention in recent years due to its computational efficiency. The focus of this paper is to develop a Lanczos algorithm which can exploit both the parallel and vector capabilities provided by modern high-performance computers. A partial restoring orthogonality scheme is also developed and incorporated into the basic Lanczos algorithm. The numerical performance in terms of accuracy and efficiency of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of structural problems on multiprocessor supercomputers.
Numerical results obtained with direct simulation Monte Carlo (DSMC) and Navier-Stokes methods are presented for Mach 20 nitrogen flow about a 70-deg blunted cone. The flow conditions simulated are those that can be obtained in existing low-density hypersonic wind tunnels. Three sets of flow conditions are considered with freestream Knudsen numbers ranging from 0.03 to 0.001. The focus is on the wake structure: how does the wake structure change as a function of rarefaction, what are the afterbody levels of heating, and to what limits are continuum models realistic as rarefaction in the wake is progressively increased. Calculations are made with and without an afterbody sting. Results for the afterbody sting are emphasized in anticipation of an experimental study for the current flow conditions and model configuration. The Navier-Stokes calculations were made with and without slip boundary conditions. Comparisons of the results obtained with the two simulation methodologies are made for both flowfield structure and surface quantities.
A new computer program is being developed for doing accurate simulations of compressible viscous flows in complex geometries. The code employs the full compressible Navier-Stokes equations. The eddy viscosity model of Baldwin and Lomax is used to model the effects of turbulence on the flow. A cell centered finite volume discretization is used for all terms in the governing equations. The Advection Upwind Splitting Method (AUSM) is used to compute the inviscid fluxes, while central differencing is used for the diffusive fluxes. A four-stage Runge-Kutta time integration scheme is used to march solutions to steady state, while convergence is enhanced by a multigrid scheme, local time-stepping and implicit residual smoothing. To enable simulations of flows in complex geometries, the code uses composite structured grid systems where all grid lines are continuous at block boundaries (multiblock grids). Example results are shown a flow in a linear cascade, a flow around a circular pin extending between the main walls in a high aspect-ratio channel, and a flow of air in a radial turbine coolant passage.
Explore the source record for details and available documents.
Explore the source record for details and available documents.