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 577 records · Page 32

Generation and adaptation of 3-D unstructured grids for transient problems

Grid generation and adaptive refinement techniques suitable for the simulation of strongly unsteady flows past geometrically complex bodies in 3-D are described. The grids are generated using the advancing front technique. Emphasis is placed not to generate elements that are too small, as this would severely increase the cost of simulations with explicit flow solvers. The grids are adapted to an evolving flowfield using simple h-refinement. A grid change is performed every 5 to 10 timesteps, and only one level of refinement/coarsening is allowed per mesh change.

Loehner, Rainald↗

The fundamentals of adaptive grid movement

Basic grid point movement schemes are studied. The schemes are referred to as adaptive grids. Weight functions and equidistribution in one dimension are treated. The specification of coefficients in the linear weight, attraction to a given grid or a curve, and evolutionary forces are considered. Curve by curve and finite volume methods are described. The temporal coupling of partial differential equations solvers and grid generators was discussed.

Eiseman, Peter R.↗

Three-dimensional adaptive grid generation for body-fitted coordinate system

This report describes a numerical method for generating 3-D grids for general configurations. The basic method involves the solution of a set of quasi-linear elliptic partial differential equations via pointwise relaxation with a local relaxation factor. It allows specification of the grid spacing off the boundary surfaces and the grid orthogonality at the boundary surfaces. It includes adaptive mechanisms to improve smoothness, orthogonality, and flow resolution in the grid interior.

Chen, S. C.↗

GENIE - Generation of computational geometry-grids for internal-external flow configurations

Progress realized in the development of a master geometry-grid generation code GENIE is presented. The grid refinement process is enhanced by developing strategies to utilize bezier curves/surfaces and splines along with weighted transfinite interpolation technique and by formulating new forcing function for the elliptic solver based on the minimization of a non-orthogonality functional. A two step grid adaptation procedure is developed by optimally blending adaptive weightings with weighted transfinite interpolation technique. Examples of 2D-3D grids are provided to illustrate the success of these methods.

Soni, B. K.↗

Generating Three-Dimensional Grids About Anything

Three-Dimensional Grids About Anything by Poisson's Equation (3DGRAPE) computer program designed to make computational grids in or about almost any shape. Generated by solution of Poisson's differential equations in three dimensions. Program automatically finds its own values for inhomogeneous terms giving near-orthogonality and controlled grid-cell height at boundaries. Grids generated applied to both viscous and inviscid aerodynamic problems, and to problems in other areas of fluid dynamics. Written in 100 percent FORTRAN 77.

Sorenson, Reese L.↗

Adaptive Grids For Computations Of Three-Dimensional Flows

Self-adaptive-grid method devised and enhanced for efficient computation of complicated three-dimensional flows. Extension of method developed for two-dimensional flows. Fictitious springs connecting points of computational grid used to determine optimum grid spacing. Each point connected to neighboring points by tension and torsion springs. Stiffnesses of tension springs related to flow-field quantities. Stiffnesses of torsion springs resist departure of grid from orthogonality.

Djomehri, M. Jahed↗

A three-dimensional application with the numerical grid generation code: EAGLE (utilizing an externally generated surface)

Program EAGLE (Eglin Arbitrary Geometry Implicit Euler) is a multiblock grid generation and steady-state flow solver system. This system combines a boundary conforming surface generation, a composite block structure grid generation scheme, and a multiblock implicit Euler flow solver algorithm. The three codes are intended to be used sequentially from the definition of the configuration under study to the flow solution about the configuration. EAGLE was specifically designed to aid in the analysis of both freestream and interference flow field configurations. These configurations can be comprised of single or multiple bodies ranging from simple axisymmetric airframes to complex aircraft shapes with external weapons. Each body can be arbitrarily shaped with or without multiple lifting surfaces. Program EAGLE is written to compile and execute efficiently on any CRAY machine with or without Solid State Disk (SSD) devices. Also, the code uses namelist inputs which are supported by all CRAY machines using the FORTRAN Compiler CF177. The use of namelist inputs makes it easier for the user to understand the inputs and to operate Program EAGLE. Recently, the Code was modified to operate on other computers, especially the Sun Spare4 Workstation. Several two-dimensional grid configurations were completely and successfully developed using EAGLE. Currently, EAGLE is being used for three-dimension grid applications.

Houston, Johnny L.↗

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.↗

Local grid refinement for transonic flow problems

The present use of locally refined Cartesian grids to solve transonic flow problems about three-dimensional aircraft configurations obviates surface-conforming grid generation through an embedding of surface-geometry paneling in the grid. Accurate resolution of flow close to the boundary, and in regions with strong velocity gradients, is achieved via hierarchical local refinement which subdivides a given grid cell into eight cells. Fast and reliable convergence is obtained by combining several preconditioners and damping strategies. Methods are suggested for preclusion of global convergence problems.

Melvin, Robin G.↗

Effect of stiffness characteristics on the response of composite grid-stiffened structures

A study of the effect of stiffness discontinuities and structural parameters on the response of continuous-filament grid-stiffened flat panels is presented. The buckling load degradation due to manufacturing-introduced stiffener discontinuities associated with a filament cut-and-add approach at the stiffener intersections is investigated. The degradation of buckling resistance in isogrid flat panels subjected to uni-axial compression and combined axial compression and shear loading conditions and induced damage is quantified using FEM. The combined loading case is the most critical one. Nonsolid stiffener cross sections, such as a foam-filled blade or hat with a 0-deg dominant cap, result in grid-stiffened structures that are structurally very efficient for wing and fuselage applications. The results of a study of the ability of grid-stiffened structural concepts to enhance the effective Poisson's ratio of a panel are presented. Grid-stiffened concepts create a highly effective Poisson's ratio, which can produce large camber deformations for certain elastic tailoring applications.

Ambur, Damodar R.↗

Parallel unstructured grid generation

A parallel unstructured grid generation algorithm is presented and implemented on the Hypercube. Different processor hierarchies are discussed, and the appropraite hierarchies for mesh generation and mesh smoothing are selected. A domain-splitting algorithm for unstructured grids which tries to minimize the surface-to-volume ratio of each subdomain is described. This splitting algorithm is employed both for grid generation and grid smoothing. Results obtained on the Hypercube demonstrate the effectiveness of the algorithms developed.

Loehner, Rainald↗

Photofabricated Wire-Grid Polarizers

Freestanding metallic grids for use as polarizers for electromagnetic radiation at millimeter and submillimeter wavelengths made by simple modification of designs of freestanding square- and nearly-square cell metallic grids, according to proposal. Cross wires provide mechanical support, but distance between cross wires made greater than one wavelength so cross wires have little effect on polarizing characteristics of grid. Possible to fabricate grids commercially for frequencies up to several terahertz.

Siegel, Peter H.↗

More About Generating Three-Dimensional Grids About Anything

Report presents additional details of mathematical basis and potential applications of method of generating three-dimensional grids fitted to bodies having arbitrary, complicated shapes. Grids used in finite-difference or finite-volume computations of flows around bodies. Grid-generation method involves numerical solutions of Poisson's equations described in "Generating Three-Dimensional Grids About Anything" (ARC-12620).

Sorenson, Reese L.↗

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗

Application of three-dimensional Bezier patches in grid generation

Bezier and B-spline patches are popular tools in surface modeling. With these methods, a surface is represented by the tensor product of univariate approximations. The extension of this concept to three dimensions is obvious and can be applied to the problem of grid generation. This report will demonstrate how three dimensional patches can be used in solid modeling and in the generation of grids. Examples will be given demonstrating the ability to generate three dimensional grids directly from a wire frame without having to first set up the boundary surfaces. Many geometric grid properties can be imposed by the proper choice of the control net.

Mastin, C. Wayne↗

S3D: An interactive surface grid generation tool

S3D, an interactive software tool for surface grid generation, is described. S3D provides the means with which a geometry definition based either on a discretized curve set or a rectangular set can be quickly processed towards the generation of a surface grid for computational fluid dynamics (CFD) applications. This is made possible as a result of implementing commonly encountered surface gridding tasks in an environment with a highly efficient and user friendly graphical interface. Some of the more advanced features of S3D include surface-surface intersections, optimized surface domain decomposition and recomposition, and automated propagation of edge distributions to surrounding grids.

Luh, Raymond Ching-Chung↗

Recent enhancements to the GRIDGEN structured grid generation system

Significant enhancements are being implemented into the GRIDGEN3D, multiple block, structured grid generation software. Automatic, point-to-point, interblock connectivity will be possible through the addition of the domain entity to GRIDBLOCK's block construction process. Also, the unification of GRIDGEN2D and GRIDBLOCK has begun with the addition of edge grid point distribution capability to GRIDBLOCK. The geometric accuracy of surface grids and the ease with which databases may be obtained is being improved by adding support for standard computer-aided design formats (e.g., PATRAN Neutral and IGES files). Finally, volume grid quality was improved through addition of new SOR algorithm features and the new hybrid control function type to GRIDGEN3D.

Steinbrenner, John P.↗

Singularity classification as a design tool for multiblock grids

A major stumbling block in interactive design of 3-D multiblock grids is the difficulty of visualizing the design as a whole. One way to make this visualization task easier is to focus, at least in early design stages, on an aspect of the grid which is inherently easy to present graphically, and to conceptualize mentally, namely the nature and location of singularities in the grid. The topological behavior of a multiblock grid design is determined by what happens at its edges and vertices. Only a few of these are in any way exceptional. The exceptional behaviors lie along a singularity graph, which is a 1-D construct embedded in 3-D space. The varieties of singular behavior are limited enough to make useful symbology on a graphics device possible. Furthermore, some forms of block design manipulation that appear appropriate to the early conceptual-modeling phase can be accomplished on this level of abstraction. An overview of a proposed singularity classification scheme and selected examples of corresponding manipulation techniques is presented.

Jones, Alan K.↗