Search NASASearch

Engineering topics

Janus, J. Mark

Publications and source records attributed to Janus, J. Mark.

Predicting Flutter and Forced Response in Turbomachinery

TURBO-AE is a computer code that enables detailed, high-fidelity modeling of aeroelastic and unsteady aerodynamic characteristics for prediction of flutter, forced response, and blade-row interaction effects in turbomachinery. Flow regimes that can be modeled include subsonic, transonic, and supersonic, with attached and/or separated flow fields. The three-dimensional Reynolds-averaged Navier-Stokes equations are solved numerically to obtain extremely accurate descriptions of unsteady flow fields in multistage turbomachinery configurations. Blade vibration is simulated by use of a dynamic-grid-deformation technique to calculate the energy exchange for determining the aerodynamic damping of vibrations of blades. The aerodynamic damping can be used to assess the stability of a blade row. TURBO-AE also calculates the unsteady blade loading attributable to such external sources of excitation as incoming gusts and blade-row interactions. These blade loadings, along with aerodynamic damping, are used to calculate the forced responses of blades to predict their fatigue lives. Phase-lagged boundary conditions based on the direct-store method are used to calculate nonzero interblade phase-angle oscillations; this practice eliminates the need to model multiple blade passages, and, hence, enables large savings in computational resources.

VanZante, Dale E.

TIGER: Turbomachinery interactive grid generation

A three dimensional, interactive grid generation code, TIGER, is being developed for analysis of flows around ducted or unducted propellers. TIGER is a customized grid generator that combines new technology with methods from general grid generation codes. The code generates multiple block, structured grids around multiple blade rows with a hub and shroud for either C grid or H grid topologies. The code is intended for use with a Euler/Navier-Stokes solver also being developed, but is general enough for use with other flow solvers. TIGER features a silicon graphics interactive graphics environment that displays a pop-up window, graphics window, and text window. The geometry is read as a discrete set of points with options for several industrial standard formats and NASA standard formats. Various splines are available for defining the surface geometries. Grid generation is done either interactively or through a batch mode operation using history files from a previously generated grid. The batch mode operation can be done either with a graphical display of the interactive session or with no graphics so that the code can be run on another computer system. Run time can be significantly reduced by running on a Cray-YMP.

Soni, Bharat K.

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark

A simple time-accurate turbomachinery algorithm with numerical solutions of an uneven blade count configuration

The present computer algorithm for the time-accurate flow analysis of rotating turbomachines is based on the finite-volume method and employs a high-resolution approximate Riemann solver for interface flux definitions and an implicit numerical scheme that possesses apparent unconditional stability. Block-block interfaces, including dynamic ones, are treated in such a way as to mimic interior block communication. The turbomachine configurations treated by way of illustration are 8-8-bladed and 11-9-bladed versions of a contrarotating unducted fan engine.

Janus, J. Mark

Improved 3-D turbomachinery CFD algorithm

The building blocks of a computer algorithm developed for the time-accurate flow analysis of rotating machines are described. The flow model is a finite volume method utilizing a high resolution approximate Riemann solver for interface flux definitions. This block LU implicit numerical scheme possesses apparent unconditional stability. Multi-block composite gridding is used to orderly partition the field into a specified arrangement. Block interfaces, including dynamic interfaces, are treated such as to mimic interior block communication. Special attention is given to the reduction of in-core memory requirements by placing the burden on secondary storage media. Broad applicability is implied, although the results presented are restricted to that of an even blade count configuration. Several other configurations are presently under investigation, the results of which will appear in subsequent publications.

Janus, J. Mark

Advanced 3-D viscous SSME turbine rotor stator CFD algorithms

Current Space Shuttle Main Engine (SSME) high pressure fuel turbopump problems have generated a desire to analyze the flow field of rotating machinery. The status of Computational Fluid Dynamics (CFD) has reached the point that soon the capability to solve unsteady three-dimensional viscous flow fields will be at hand. The work presented involves upgrading the computational efficiency of an operational three-dimensional algorithm. The modifications include algorithm development, algorithm approximation and acceleration, and special coding optimizations. The overall result of these modifications has reduced processing time by nearly 80%.

Janus, J. Mark