Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Grids”

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.

At least 811 records · Page 45

3D automatic Cartesian grid generation for Euler flows

We describe a Cartesian grid strategy for the study of three dimensional inviscid flows about arbitrary geometries that uses both conventional and CAD/CAM surface geometry databases. Initial applications of the technique are presented. The elimination of the body-fitted constraint allows the grid generation process to be automated, significantly reducing the time and effort required to develop suitable computational grids for inviscid flowfield simulations.

Melton, John E.↗

Single block three-dimensional volume grids about complex aerodynamic vehicles

This paper presents an alternate approach for the generation of volumetric grids for supersonic and hypersonic flows about complex configurations. The method uses parametric two-dimensional block-face grid definitions, within the framework of GRIDGEN2D. The incorporation of a face decomposition reduces complex surfaces to simple shapes. These simple shapes are recombined to obtain the final face definition. The advantages of this method include the reduction of overall grid generation time through the use of vectorized computer code, the elimination of generating matching block faces, and simplified boundary conditions.

Alter, Stephen J.↗

Generalized Smagorinsky model for anisotropic grids

The paper revises the Smagorinsky subgrid model to properly account for grid anisotropy on the basis of energy equilibrium considerations in isotropic turbulence. For moderate resolution anisotropies, Deardorff's (1970) estimate involving an equivalent grid scale Delta(eq) = (Delta1 Delta2 Delta3) exp 1/3 is given a rigorous basis. It is argued that the results obtained should be used in conjunction with the dynamic model of Germano et al. (1991) whenever the anisotropy of the test filter differs significantly from that of the basic grid.

Scotti, Alberto↗

Numerical simulation of a powered-lift landing, tracking flow features using overset grids, and simulation of high lift devices on a fighter-lift-and-control wing

Attached as appendices to this report are documents describing work performed on the simulation of a landing powered-lift delta wing, the tracking of flow features using overset grids, and the simulation of flaps on the Wright Patterson Lab's fighter-lift-and-control (FLAC) wing. Numerical simulation of a powered-lift landing includes the computation of flow about a delta wing at four fixed heights as well as a simulated landing, in which the delta wing descends toward the ground. Comparison of computed and experimental lift coefficients indicates that the simulations capture the qualitative trends in lift-loss encountered by thrust-vectoring aircraft operating in ground effect. Power spectra of temporal variations of pressure indicate computed vortex shedding frequencies close to the jet exit are in the experimentally observed frequency range; the power spectra of pressure also provide insights into the mechanisms of lift oscillations. Also, a method for using overset grids to track dynamic flow features is described and the method is validated by tracking a moving shock and vortices shed behind a circular cylinder. Finally, Chimera gridding strategies were used to develop pressure coefficient contours for the FLAC wing for a Mach no. of 0.18 and Reynolds no. of 2.5 million.

Chawla, Kalpana↗

Software systems used for unstructured grid generation at NASA Langley

These viewgraphs provide an overview of grid generation system for 3D configurations (Euler Grids) and grid generators of viscous and inviscid flow, solution adaptive for steady and unsteady flow. The five systems presented are VGRID, FELISA, TETRA, NGP, and TGRID.

Michael J Bockelie↗

Dynamic mesh adaption for triangular and tetrahedral grids

The following topics are discussed: requirements for dynamic mesh adaption; linked-list data structure; edge-based data structure; adaptive-grid data structure; three types of element subdivision; mesh refinement; mesh coarsening; additional constraints for coarsening; anisotropic error indicator for edges; unstructured-grid Euler solver; inviscid 3-D wing; and mesh quality for solution-adaptive grids. The discussion is presented in viewgraph form.

Rupak Biswas↗

The 3D Euler solutions using automated Cartesian grid generation

Viewgraphs on 3-dimensional Euler solutions using automated Cartesian grid generation are presented. Topics covered include: computational fluid dynamics (CFD) and the design cycle; Cartesian grid strategy; structured body fit; grid generation; prolate spheroid; and ONERA M6 wing.

John E Melton↗

Accuracy assessment for grid adaptation

Viewgraphs on accuracy assessment for grid adaptation are presented. Topics covered include: uniform refinement, grid convergence, adapted grids, oblique shock wave, supersonic flow, and sonic flow.

Gary P Warren↗

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗

High energy collimating fine grids for HESP program

There is a need to develop fine pitch x-ray collimator grids as an enabling technology for planned future missions. The grids consist of an array of thin parallel strips of x-ray absorbing material, such as tungsten, with pitches ranging from 34 microns to 2.036 millimeters. The grids are the key components of a new class of spaceborne instruments known as 'x-ray modulation collimators.' These instruments are the first to produce images of celestial sources in the hard x-ray and gamma-ray spectral regions.

Eberhard, Carol D.↗

Parallel grid generation algorithm for distributed memory computers

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Moitra, Stuti↗

Prediction of Undsteady Flows in Turbomachinery Using the Linearized Euler Equations on Deforming Grids

A linearized Euler solver for calculating unsteady flows in turbomachinery blade rows due to both incident gusts and blade motion is presented. The model accounts for blade loading, blade geometry, shock motion, and wake motion. Assuming that the unsteadiness in the flow is small relative to the nonlinear mean solution, the unsteady Euler equations can be linearized about the mean flow. This yields a set of linear variable coefficient equations that describe the small amplitude harmonic motion of the fluid. These linear equations are then discretized on a computational grid and solved using standard numerical techniques. For transonic flows, however, one must use a linear discretization which is a conservative linearization of the non-linear discretized Euler equations to ensure that shock impulse loads are accurately captured. Other important features of this analysis include a continuously deforming grid which eliminates extrapolation errors and hence, increases accuracy, and a new numerically exact, nonreflecting far-field boundary condition treatment based on an eigenanalysis of the discretized equations. Computational results are presented which demonstrate the computational accuracy and efficiency of the method and demonstrate the effectiveness of the deforming grid, far-field nonreflecting boundary conditions, and shock capturing techniques. A comparison of the present unsteady flow predictions to other numerical, semi-analytical, and experimental methods shows excellent agreement. In addition, the linearized Euler method presented requires one or two orders-of-magnitude less computational time than traditional time marching techniques making the present method a viable design tool for aeroelastic analyses.

Clark, William S.↗

On automating domain connectivity for overset grids

An alternative method for domain connectivity among systems of overset grids is presented. Reference uniform Cartesian systems of points are used to achieve highly efficient domain connectivity, and form the basis for a future fully automated system. The Cartesian systems are used to approximated body surfaces and to map the computational space of component grids. By exploiting the characteristics of Cartesian Systems, Chimera type hole-cutting and identification of donor elements for intergrid boundary points can be carried out very efficiently. The method is tested for a range of geometrically complex multiple-body overset grid systems.

Chiu, Ing-Tsau↗

Automatic computation of Euler-marching and subsonic grids for wing-fuselage configurations

Algebraic procedures are described for the automatic generation of structured, single-block flow computation grids for relatively simple configurations (wing, fuselage, and fin). For supersonic flows, a quasi two-dimensional grid for Euler-marching codes is developed, and some sample results in graphical form are included. A type of grid for subsonic flow calculation is also described. The techniques are algebraic and are based on a generalization of the method of transfinite interpolation.

Barger, Raymond L.↗

Stability and error estimation for Component Adaptive Grid methods

Component adaptive grid (CAG) methods for solving hyperbolic partial differential equations (PDE's) are discussed in this paper. Applying recent stability results for a class of numerical methods on uniform grids. The convergence of these methods for linear problems on component adaptive grids is established here. Furthermore, the computational error can be estimated on CAG's using the stability results. Using these estimates, the error can be controlled on CAG's. Thus, the solution can be computed efficiently on CAG's within a given error tolerance. Computational results for time dependent linear problems in one and two space dimensions are presented.

Oliger, Joseph↗

The development and application of the self-adaptive grid code, SAGE

The multidimensional self-adaptive grid code, SAGE, has proven to be a flexible and useful tool in the solution of complex flow problems. Both 2- and 3-D examples given in this report show the code to be reliable and to substantially improve flowfield solutions. Since the adaptive procedure is a marching scheme the code is extremely fast and uses insignificant CPU time compared to the corresponding flow solver. The SAGE program is also machine and flow solver independent. Significant effort was made to simplify user interaction, though some parameters still need to be chosen with care. It is also difficult to tell when the adaption process has provided its best possible solution. This is particularly true if no experimental data are available or if there is a lack of theoretical understanding of the flow. Another difficulty occurs if local features are important but missing in the original grid; the adaption to this solution will not result in any improvement, and only grid refinement can result in an improved solution. These are complex issues that need to be explored within the context of each specific problem.

Davies, Carol B.↗

Criteria for evaluation of grid generation systems

Many CFD grid generation systems are in use nationally, but few comparative studies have been performed to quantify their relative merits. A study was undertaken to systematically evaluate and select the best CFD grid generation codes available. Detailed evaluation criteria were established as the basis for the evaluation conducted. Descriptions of thirty-four separate criteria, grouped into eight general categories are provided. Benchmark test cases, developed to test basic features of selected codes, are described in detail. Scoring guidelines were generated to establish standards for measuring code capabilities, ensuring uniformity of ratings, and minimizing personal bias among the three code evaluators. Ten candidate codes were identified from government, industry, universities, and commercial software companies. A three phase evaluation was conducted. In Phase 1, ten codes identified were screened through conversations with code authors and other industry experts. Seven codes were carried forward into a Phase 2 evaluation in which all codes were scored according to the predefined criteria. Two codes emerged as being significantly better than the others: RAGGS and GRIDGEN. Finally, these two codes were carried forward into a Phase 3 evaluation in which complex 3-D multizone grids were generated to verify capability.

Ascoli, Edward P.↗

Spectral methods on arbitrary grids

Stable and spectrally accurate numerical methods are constructed on arbitrary grids for partial differential equations. These new methods are equivalent to conventional spectral methods but do not rely on specific grid distributions. Specifically, we show how to implement Legendre Galerkin, Legendre collocation, and Laguerre Galerkin methodology on arbitrary grids.

Carpenter, Mark H.↗