Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid generation”

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 199 records · Page 11

A Framework for Parallel Unstructured Grid Generation for Complex Aerodynamic Simulations

A framework for parallel unstructured grid generation targeting both shared memory multi-processors and distributed memory architectures is presented. The two fundamental building-blocks of the framework consist of: (1) the Advancing-Partition (AP) method used for domain decomposition and (2) the Advancing Front (AF) method used for mesh generation. Starting from the surface mesh of the computational domain, the AP method is applied recursively to generate a set of sub-domains. Next, the sub-domains are meshed in parallel using the AF method. The recursive nature of domain decomposition naturally maps to a divide-and-conquer algorithm which exhibits inherent parallelism. For the parallel implementation, the Master/Worker pattern is employed to dynamically balance the varying workloads of each task on the set of available CPUs. Performance results by this approach are presented and discussed in detail as well as future work and improvements.

Zagaris, George↗

Grid generation on surfaces in 3 dimensions

The development of a surface grid generation algorithm was initiated. The basic adaptive movement technique of mean-value-relaxation was extended from the viewpoint of a single coordinate grid over a surface described by a single scalar function to that of a surface more generally defined by vector functions and covered by a collection of smoothly connected grids. Within the multiconnected assemblage, the application of control was examined in several instances.

Eiseman, Peter R.↗

Multiblock grid generation with automatic zoning

An overview will be given for multiblock grid generation with automatic zoning. We shall explore the many advantages and benefits of this exciting technology and will also see how to apply it to a number of interesting cases. The technology is available in the form of a commercial code, GridPro(registered trademark)/az3000. This code takes surface geometry definitions and patterns of points as its primary input and produces high quality grids as its output. Before we embark upon our exploration, we shall first give a brief background of the environment in which this technology fits.

Eiseman, Peter R.↗

Grid generation and adaptation for the Direct Simulation Monte Carlo Method

A grid generation and adaptation procedure based on the method of transfinite interpolation is incorporated into the Direct Simulation Monte Carlo Method of Bird. In addition, time is advanced based on a local criterion. The resulting procedure is used to calculate steady flows past wedges and cones. Five chemical species are considered. In general, the modifications result in a reduced computational effort. Moreover, preliminary results suggest that the simulation method is time step dependent if requirements on cell sizes are not met.

Olynick, David P.↗

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

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

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

Parameterization in Grid Generation

The distribution of grid points for calculating the solution of partial differential equations is chosen so as to include consideration of truncation error, stability, and the resolution of the solution near boundary layers and shocks. It is important to specify the distribution of points along a grid line. The problem of distributing points along a curve is considered. It is assumed that the curve is defined parametrically. The objective is to select a set of parameter values so that the corresponding points on the curves are properly distributed. The distribution is based on some intrinsic property of the curve such as arc length or curvature.

Mastin, C. W.↗

Recent advances in unstructured grid generation program VGRID3D

A program for the generation of unstructured grids over complex configurations, VGRID3D, is described. The grid elements (triangles on the surfaces and tetrahedra in the field) are generated starting from the surface boundaries towards the interior of the computational domain using the Advancing Front Method.

Parikh, Paresh↗

Computing Aerodynamic Performance of a 2D Iced Airfoil: Blocking Topology and Grid Generation

The ice accrued on airfoils can have enormously complicated shapes with multiple protruded horns and feathers. In this paper, several blocking topologies are proposed and evaluated on their ability to produce high-quality structured multi-block grid systems. A transition layer grid is introduced to ensure that jaggedness on the ice-surface geometry do not to propagate into the domain. This is important for grid-generation methods based on hyperbolic PDEs (Partial Differential Equations) and algebraic transfinite interpolation. A 'thick' wrap-around grid is introduced to ensure that grid lines clustered next to solid walls do not propagate as streaks of tightly packed grid lines into the interior of the domain along block boundaries. For ice shapes that are not too complicated, a method is presented for generating high-quality single-block grids. To demonstrate the usefulness of the methods developed, grids and CFD solutions were generated for two iced airfoils: the NLF0414 airfoil with and without the 623-ice shape and the B575/767 airfoil with and without the 145m-ice shape. To validate the computations, the computed lift coefficients as a function of angle of attack were compared with available experimental data. The ice shapes and the blocking topologies were prepared by NASA Glenn's SmaggIce software. The grid systems were generated by using a four-boundary method based on Hermite interpolation with controls on clustering, orthogonality next to walls, and C continuity across block boundaries. The flow was modeled by the ensemble-averaged compressible Navier-Stokes equations, closed by the shear-stress transport turbulence model in which the integration is to the wall. All solutions were generated by using the NPARC WIND code.

Chi, X.↗

Algebraic grid generation about wing-fuselage bodies

An algebraic procedure for the generation of boundary-fitted grids about wing-fuselage configurations is presented. A wing-fuselage configuration is specified by cross sections and mathematically represented by Coons' patches. A configuration is divided into sections so that several grid blocks that either adjoin each other or partially overlap each other can be generated. Each grid has six exterior surfaces that map into a computational cube. Grids are first determined on the six boundary surfaces and then in the interior. Grid curves that are on the surface of the configuration are derived from the intersection of planes with the Coons' patch definition. Single-valued functions relating approximate arc lengths along the grid curves to a computational coordinate define the distribution of grid points. The two-boundary technique and transfinite interpolation are used to determine the boundary surface grids that are not on the configuration, and transfinite interpolation with linear blending functions is used to determine the interior grid.

Smith, R. E.↗

User's guide to PMESH: A grid-generation program for single-rotation and counterrotation advanced turboprops

A detailed operating manual is presented for a grid generating program that produces 3-D meshes for advanced turboprops. The code uses both algebraic and elliptic partial differential equation methods to generate single rotation and counterrotation, H or C type meshes for the z - r planes and H type for the z - theta planes. The code allows easy specification of geometrical constraints (such as blade angle, location of bounding surfaces, etc.), mesh control parameters (point distribution near blades and nacelle, number of grid points desired, etc.), and it has good runtime diagnostics. An overview is provided of the mesh generation procedure, sample input dataset with detailed explanation of all input, and example meshes.

Warsi, Saif A.↗

Automatic mesh-point clustering near a boundary in grid generation with elliptic partial differential equations

Elliptic partial differential equations are used to generate a smooth grid that permits a one-to-one mapping in such a way that mesh lines of the same family do not cross. Problems that arise due to lack of clustering at crucial points or intersections of mesh lines at highly acute angles, are examined and various forcing or source terms are used (to correct the problems) that are either compatible with the maximum principle or are so locally controlled that mesh lines do not intersect. Attention is given to various schematics of unclustered grids and grid detail about (highly cambered) airfoils.

Steger, J. L.↗

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

Three-dimensional elliptic grid generation technique with application to turbomachinery cascades

Described is a numerical method for generating 3-D grids for turbomachinery computational fluid dynamic codes. The basic method is general and involves the solution of a quasi-linear elliptic partial differential equation via pointwise relaxation with a local relaxation factor. It allows specification of the grid point distribution on the boundary surfaces, the grid spacing off the boundary surfaces, and the grid orthogonality at the boundary surfaces. A geometry preprocessor constructs the grid point distributions on the boundary surfaces for general turbomachinery cascades. Representative results are shown for a C-grid and an H-grid for a turbine rotor. Two appendices serve as user's manuals for the basic solver and the geometry preprocessor.

Chen, S. C.↗