Results for “grid codes” — Page 15

NASA NTRS1993

A comprehensive comparison of turbulence models in the far wake

In the present study, the far wake was examined numerically using an implicit, upwind, finite-volume, compressible Navier-Stokes code. The numerical grid started at 500 equivalent circular cylinder diameters in the wave, and extended to 4000 equivalent diameters. By concentrating only on the far wake, the numerical difficulties and fine mesh requirements near the wake-generating body were eliminated. At the time of this writing, results for the K-epsilon and K-omega turbulence models at low Mach number have been completed and show excellent agreement with previous incompressible results and far-wake similarity solutions. The code is presently being used to compare the performance of various other turbulence models, including Reynolds stress models and the new anisotropic two-equation turbulence models being developed at NASA Langley. By increasing our physical understanding of the deficiencies and limits of these models, it is hoped that improvements to the universality of the models can be made. Future plans include examination of two-dimensional momentumless wakes as well.

Cimbala, John M.↗

NASA NTRS1995

An Extended Lagrangian Method

A unique formulation of describing fluid motion is presented. The method, referred to as 'extended Lagrangian method,' is interesting from both theoretical and numerical points of view. The formulation offers accuracy in numerical solution by avoiding numerical diffusion resulting from mixing of fluxes in the Eulerian description. The present method and the Arbitrary Lagrangian-Eulerian (ALE) method have a similarity in spirit-eliminating the cross-streamline numerical diffusion. For this purpose, we suggest a simple grid constraint condition and utilize an accurate discretization procedure. This grid constraint is only applied to the transverse cell face parallel to the local stream velocity, and hence our method for the steady state problems naturally reduces to the streamline-curvature method, without explicitly solving the steady stream-coordinate equations formulated a priori. Unlike the Lagrangian method proposed by Loh and Hui which is valid only for steady supersonic flows, the present method is general and capable of treating subsonic flows and supersonic flows as well as unsteady flows, simply by invoking in the same code an appropriate grid constraint suggested in this paper. The approach is found to be robust and stable. It automatically adapts to flow features without resorting to clustering, thereby maintaining rather uniform grid spacing throughout and large time step. Moreover, the method is shown to resolve multi-dimensional discontinuities with a high level of accuracy, similar to that found in one-dimensional problems.

Liou, Meng-Sing↗

NASA NTRS1998

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Frink, Neal T.↗

NASA NTRS1998

Tetrahedral Finite-Volume Solutions to the Navier-Stokes Equations on Complex Configurations

A review of the algorithmic features and capabilities of the unstructured-grid flow solver USM3Dns is presented. This code, along with the tetrahedral grid generator, VGRIDns, is being extensively used throughout the U.S. for solving the Euler and Navier-Stokes equations on complex aerodynamic problems. Spatial discretization is accomplished by a tetrahedral cell-centered finite-volume formulation using Roe's upwind flux difference splitting. The fluxes are limited by either a Superbee or MinMod limiter. Solution reconstruction within the tetrahedral cells is accomplished with a simple, but novel, multidimensional analytical formula. Time is advanced by an implicit backward-Euler time-stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one-equation model, which is coupled with a wall function to reduce the number of cells in the near-wall region of the boundary layer. The issues of accuracy and robustness of USM3Dns Navier-Stokes capabilities are addressed for a flat-plate boundary layer, and a full F-16 aircraft with external stores at transonic speed.

Frink, N. T.↗

NASA NTRS1997

The Volume Grid Manipulator (VGM): A Grid Reusability Tool

This document is a manual describing how to use the Volume Grid Manipulation (VGM) software. The code is specifically designed to alter or manipulate existing surface and volume structured grids to improve grid quality through the reduction of grid line skewness, removal of negative volumes, and adaption of surface and volume grids to flow field gradients. The software uses a command language to perform all manipulations thereby offering the capability of executing multiple manipulations on a single grid during an execution of the code. The command language can be input to the VGM code by a UNIX style redirected file, or interactively while the code is executing. The manual consists of 14 sections. The first is an introduction to grid manipulation; where it is most applicable and where the strengths of such software can be utilized. The next two sections describe the memory management and the manipulation command language. The following 8 sections describe simple and complex manipulations that can be used in conjunction with one another to smooth, adapt, and reuse existing grids for various computations. These are accompanied by a tutorial section that describes how to use the commands and manipulations to solve actual grid generation problems. The last two sections are a command reference guide and trouble shooting sections to aid in the use of the code as well as describe problems associated with generated scripts for manipulation control.

Alter, Stephen J.↗

NASA NTRS1995

Development of numerical methods for overset grids with applications for the integrated Space Shuttle vehicle

Algorithms and computer code developments were performed for the overset grid approach to solving computational fluid dynamics problems. The techniques developed are applicable to compressible Navier-Stokes flow for any general complex configurations. The computer codes developed were tested on different complex configurations with the Space Shuttle launch vehicle configuration as the primary test bed. General, efficient and user-friendly codes were produced for grid generation, flow solution and force and moment computation.

Chan, William M.↗

DOE OSTI2020

Rendezvous algorithms for large-scale modeling and simulation

Rendezvous algorithms encode a communication pattern that is useful when processors sending data do not know who the receiving processors should be, or vice versa. The idea is to define an intermediate decomposition where datums from different sending processors can ”rendezvous” to perform a computation, in a manner that both the senders and eventual receivers of the results can identify the appropriate rendezvous processor. Though they were originally designed for interpolating between overlaid grids with independent parallel decompositions (Plimpton et al., 2004), we have recently found rendezvous algorithms useful for a variety of operations in particle- or grid-based simulation codes when running large problems on large numbers of processors. In particular, we show they can perform well when a load-balanced intermediate decomposition is randomized and not spatial, requiring all-to-all communication to move data between processors. In this case rendezvous algorithms leverage the large bisection communication bandwidths which parallel machines provide. We describe how rendezvous algorithms work in a scientific computing context and give specific examples for molecular dynamics and Direct Simulation Monte Carlo codes which result in dramatic performance improvements versus simpler algorithms which do not scale as well. We explain how a generic rendezvous algorithm can be implemented, and also point out similarities with the MapReduce paradigm popularized by Google and Hadoop.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

Assessing the quality of curvilinear coordinate meshes by decomposing the Jacobian matrix

An algebraic decomposition of the Jacobian matrix which relates physical and computational variables is presented. This invertible decomposition parameterizes the mesh by the physically intuitive qualities of cell orientation, cell orthogonality, cell volume, and cell aspect ratio. The decomposition can be used to analyze numerically generated curvilinear coordinate meshes and to assess the contribution of the mesh to the truncation error for any specific differential operator and algorithm. This is worked out in detail for Laplace's equation in nonconservative and conservative forms. The analysis is applied to the solution of the full potential code TAIR, showing grid plots, carpet plots, and truncation error for a NACA 0012 airfoil.

Kerlick, G. D.↗

NASA NTRS1991

Implementation of control point form of algebraic grid-generation technique

The control point form (CPF) provides explicit control of physical grid shape and grid spacing through the movement of the control points. The control point array, called a control net, is a space grid type arrangement of locations in physical space with an index for each direction. As an algebraic method CPF is efficient and works well with interactive computer graphics. A family of menu-driven, interactive grid-generation computer codes (TURBO) is being developed by using CPF. Key features of TurboI (a TURBO member) are discussed and typical results are presented. TurboI runs on any IRIS 4D series workstation.

Choo, Yung K.↗

NASA NTRS1992

The NASA-IGES geometry data visualizer

NIGESview, an interactive software tool for reading, viewing, and translating geometry data available in the Initial Graphics Exchange Specification (IGES) format, is described. NIGESview is designed to read a variety of IGES entities, translate some of the entities, graphically view the data, and output a file in a specific IGES format. The software provides a modern graphical user interface and is designed in a modular fashion so developers can utilize all or part of the code in their grid generation software for computational fluid dynamics.

Blake, Matthew W.↗

NASA NTRS1992

A computational design system for rapid CFD analysis

A computation design system (CDS) is described in which these tools are integrated in a modular fashion. This CDS ties together four key areas of computational analysis: description of geometry; grid generation; computational codes; and postprocessing. Integration of improved computational fluid dynamics (CFD) analysis tools through integration with the CDS has made a significant positive impact in the use of CFD for engineering design problems. Complex geometries are now analyzed on a frequent basis and with greater ease.

Ascoli, E. P.↗

NASA NTRS1991

Implementation of control point form of algebraic grid-generation technique

The control point form (CPF) provides explicit control of physical grid shape and grid spacing through the movement of the control points. The control point array, called a control net, is a space grid type arrangement of locations in physical space with an index for each direction. As an algebraic method CPF is efficient and works well with interactive computer graphics. A family of menu-driven, interactive grid-generation computer codes (TURBO) is being developed by using CPF. Key features of TurboI (a TURBO member) are discussed and typical results are presented. TurboI runs on any IRIS 4D series workstation.

Choo, Yung K.↗

NASA NTRS1993

MEDUSA - An overset grid flow solver for network-based parallel computer systems

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.

Smith, Merritt H.↗

NASA NTRS1996

Development of an Automatic Differentiation Version of the FPX Rotor Code

The ADIFOR2.0 automatic differentiator is applied to the FPX rotor code along with the grid generator GRGN3. The FPX is an eXtended Full-Potential CFD code for rotor calculations. The automatic differentiation version of the code is obtained, which provides both non-geometry and geometry sensitivity derivatives. The sensitivity derivatives via automatic differentiation are presented and compared with divided difference generated derivatives. The study shows that automatic differentiation method gives accurate derivative values in an efficient manner.

Hu, Hong↗

NASA NTRS1999

Viscous Design of TCA Configuration

The goal in this effort is to redesign the baseline TCA configuration for improved performance at both supersonic and transonic cruise. Viscous analyses are conducted with OVERFLOW, a Navier-Stokes code for overset grids, using PEGSUS to compute the interpolations between overset grids. Viscous designs are conducted with OVERDISC, a script which couples OVERFLOW with the Constrained Direct Iterative Surface Curvature (CDISC) inverse design method. The successful execution of any computational fluid dynamics (CFD) based aerodynamic design method for complex configurations requires an efficient method for regenerating the computational grids to account for modifications to the configuration shape. The first section of this presentation deals with the automated regridding procedure used to generate overset grids for the fuselage/wing/diverter/nacelle configurations analysed in this effort. The second section outlines the procedures utilized to conduct OVERDISC inverse designs. The third section briefly covers the work conducted by Dick Campbell, in which a dual-point design at Mach 2.4 and 0.9 was attempted using OVERDISC; the initial configuration from which this design effort was started is an early version of the optimized shape for the TCA configuration developed by the Boeing Commercial Airplane Group (BCAG), which eventually evolved into the NCV design. The final section presents results from application of the Natural Flow Wing design philosophy to the TCA configuration.

Krist, Steven E.↗

NASA NTRS1999

Analysis and Multipoint Design of the TCA Concept

The goal in this effort is to analyze the baseline TCA concept at transonic and supersonic cruise, then apply the natural flow wing design concept to obtain multipoint performance improvements. Analyses are conducted with OVERFLOW, a Navier-Stokes code for overset grids, using PEGSUS to compute the interpolations between the overset grids.

Krist, Steven E.↗

NASA NTRS1999

Viscous Analysis of Ref. H Based Wing/Bodies

Computations have been performed on the baseline Reference H wing/body configuration, as well as the Wing 704 configuration, an optimized wing and fuselage combination derived from Ref. H through automated optimization. The parabolized Navier-Stokes solver UPS was employed with viscous terms in two directions in an effort to understand the source and level of potential viscous/inviscid interactions. The paper briefly describes the UPS code and the grids used to obtain the solutions before the discussion of results. Results of these computations indicate that viscous/inviscid interaction can contribute increments to both the pressure- and friction-related drag. Computations were performed for wind tunnel conditions-1.675% scale models at a Reynolds number of 4 million per foot. Turbulent flow results were obtained using the Baldwin-Lomax algebraic turbulence model and were compared with laminar flow results. The laminar flow fields were used to obtain upper bounds on potential interaction effects.

Lawrence, Scott L.↗

NASA NTRS1999

Analysis and Multipoint Design of the TCA Concept

The goal in this effort is to analyze the baseline TCA concept at transonic and supersonic cruise, then apply the natural flow wing design concept to obtain multipoint performance improvements. Analyses are conducted with OVERFLOW, a Navier-Stokes code for overset grids, using PEGSUS to compute the interpolations between the overset grids.

Krist, Steven E.↗