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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Pyramidal Image-Processing Code For Hexagonal Grid

Algorithm based on processing of information on intensities of picture elements arranged in regular hexagonal grid. Called "image pyramid" because image information at each processing level arranged in hexagonal grid having one-seventh number of picture elements of next lower processing level, each picture element derived from hexagonal set of seven nearest-neighbor picture elements in next lower level. At lowest level, fine-resolution of elements of original image. Designed to have some properties of image-coding scheme of primate visual cortex.

Watson, Andrew B.↗
NASA NTRS1989

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

Dynamic grid refinement for partial differential equations on parallel computers

The fast adaptive composite grid method (FAC) is an algorithm that uses various levels of uniform grids to provide adaptive resolution and fast solution of PDEs. An asynchronous version of FAC, called AFAC, that completely eliminates the bottleneck to parallelism is presented. This paper describes the advantage that this algorithm has in adaptive refinement for moving singularities on multiprocessor computers. This work is applicable to the parallel solution of two- and three-dimensional shock tracking problems.

Mccormick, S.↗
NASA NTRS1990

Calculation of shocked one-dimensional flows on abruptly changing grids by mathematical programming

Cell-centered finite differences on cells of an arbitrarily spaced grid are presently used to discretize the steady-state inviscid and nearly inviscid Burgers' equations for steady-state shocked flow in a quasi-one-dimensional nozzle. The everdetermined system of nonlinear algebraic equations thus obtained is solved by a procedure which minimizes a weighted sum of the residuals' absolute values. Numerical solutions for both viscous and inviscid problems are accurate and nonoscillatory, on grids whose abrupt mesh lengths refinements are as great as a factor of 10,000.

Lavery, John E.↗
NASA NTRS1988

Three-dimensional zonal grids about arbitrary shapes by Poisson's equation

A method for generating 3-D finite difference grids about or within arbitrary shapes is presented. The 3-D Poisson equations are solved numerically, with values for the inhomogeneous terms found automatically by the algorithm. Those inhomogeneous terms have the effect near boundaries of reducing cell skewness and imposing arbitrary cell height. The method allows the region of interest to be divided into zones (blocks), allowing the method to be applicable to almost any physical domain. A FORTRAN program called 3DGRAPE has been written to implement the algorithm. Lastly, a method for redistributing grid points along lines normal to boundaries will be described.

Sorenson, Reese L.↗
NASA NTRS1988

Surface grid generation for complex three-dimensional geometries

An outline is presented for the creation of surface grids from primitive geometry data such as obtained from CAD/CAM systems. The general procedure is applicable to any geometry including full aircraft with wing, nacelle, and empennage. When developed in an interactive graphics environment, a code base on this procedure is expected to substantially improve the turn around time for generating surface grids on complex geometries. Results are shown for a general hypersonic airplane geometry.

Luh, Raymond Ching-Chung↗
NASA NTRS1988

Patch structured surface grid with dynamic curvature clustering

The numerical technique developed by Eiseman (1985) to generate surface grids with lines clustered in areas of greater curvature is described and demonstrated. This approach combines the direct active use of surface curvature with a mean-value relaxation scheme and multigrid methods; it permits an arbitrary number of patches to be organized in a single integer array based on a patch number, an edge number, and a boundary-condition index. Grids for typical CFD applications are presented and briefly characterized.

Wang, YI↗
NASA NTRS1988

Discretization formulas for unstructured grids

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formula in cartesian coordinates for the Laplacian operator, first derivative operators and the function for unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator are shown to agree with the Taylor series approach on a global average. In addition, a simple algorithm is presented to determine the Voronoi (finite difference) area of an unstructured grid.

Baumeister, Kenneth J.↗
NASA NTRS1989

TDFAC - A composite grid method for time dependent problems

This paper presents the Fast Adaptive Composite Grid Method for Time Dependent Problems (TDFAC), a local grid refinement scheme for nonlinear, time dependent partial differential equations. The method is presented in a one dimensional setting to illustrate the basic features and components. Computational results which show the effectiveness of TDFAC as a computational tool are also included.

Heroux, Michael↗
NASA NTRS1990

Two and three dimensional grid generation by an algebraic homotopy procedure

An algebraic method for generating two- and three-dimensional grid systems for aerospace vehicles is presented. The method is based on algebraic procedures derived from homotopic relations for blending between inner and outer boundaries of any given configuration. Stable properties of homotopic maps have been exploited to provide near-orthogonality and specified constant spacing at the inner boundary. The method has been successfully applied to analytically generated blended wing-body configurations as well as discretely defined geometries such as the High-Speed Civil Transport Aircraft. Grid examples representative of the capabilities of the method are presented.

Moitra, Anutosh↗
NASA NTRS1990

Application of a new adaptive grid for aerodynamic analysis of shock containing single jets

A fast and robust solution-adaptive grid generation method has been developed for the three-dimensional numerical analysis of shock containing supersonic jets. The adaptive grid algorithm, which is based on the equidistribution principle and the alternate direction method, has been fully integrated with the space marching scheme developed by Abdol-Hamid (1989). The capability of the approach proposed here is illustrated by numerical solutions for circular, square, and elliptic jet plumes.

Pao, S. Paul↗
NASA NTRS1990

Three-dimensional compressible jet-in-crossflow calculations using improved viscosity models and adapted grid

Previous calculations of jet-in-crossflow problems have been sensitive to the turbulence and artificial viscosity models and to the grid. Consequently, the eddy viscosity model in the PARC3D code was modified to consider the turbulent jet by switching from the Baldwin-Lomax (1978) model to an axisymmetric jet model. A modified artificial viscosity model has been utilized and evaluated in this study as well. The new model includes cell size scaling and a directional dependence in the coefficients. Computational results from PARC3D demonstrate the effects of the viscosity models on the pressure distribution fore and aft of the jet and the ability of the adaptive grid scheme to adjust to the three-dimensional gradients around the jet.

Lytle, John K.↗
NASA NTRS1991

Semiautomatic Design Of Zonal Computational Grids

EZGrid is knowledge-based computer program semiautomatically generating zonal computational grids for use in numerical simulations of two-dimensional flows. Zoning necessary because of limitations imposed by size of available computer memory and by topological complexity of typical flow field. Complexity and amount of required memory reduced by dividing flow field into zones, within each of which computational grid refined only to extent necessary to resolve local high gradients. Developed to speed and systematize zoning.

Vogel, Alison Andrews↗
NASA NTRS1991

Using Multiple Grids To Compute Flows

Paper discusses decomposition of global grids into multiple patched and/or overlaid local grids in computations of fluid flow. Such "domain decomposition" particularly useful in computation of flows about complicated bodies moving relative to each other; for example, flows associated with rotors and stators in turbomachinery and rotors and fuselages in helicopters.

Rai, Man Mohan↗
NASA NTRS1991

Generation Of Surface Grids From Data Points

Computational procedure generates grids on complicated three-dimensional surfaces from sets of data points that lie on and specify those surfaces. Starting with grouping of possibly sparse surface points into lines and/or patches, procedure involves interpolation within and blending of lines and/or patches and possibly redistribution and reassembly of patches to obtain finished system of zonal patch grids that match at boundaries between them. Procedure semiautomated via computer program that performs all steps except selection of patches and interpolation points, left to discretion of user.

Luh, Raymond Ching-Chung↗
NASA NTRS1990

Grid generation and flow computation about a Martian entry vehicle

A number of vehicles are currently being proposed for a manned mission to Mars. One of these vehicles has a modified blunt-nosed cone configuration. Experimental results were obtained for this vehicle in 1968. They show lift-over-drag ratios comparable to those needed for Mars entry. Computations are performed to verify the earlier results and to further describe the flight characteristics of this vehicle. An analytical method is used to define the surface of this vehicle. A single-block volume grid is generated around the vehicle using the algebraic Two-Boundary Grid Generation algorithm (TBGG) and transfinite interpolation. Euler solutions are then obtained from a Langley Aerodynamic Upward Relaxation Algorithm (LAURA) at Mach 6.0 and angles of attack of 0, 6, and 12 deg. The lift coefficient determined from the LAURA code agree very well with the experimental results. The drag and pitching moment coefficients, however, are underestimated by the code since viscous effects are not considered. Contour plots of the flowfield show no evidence of separation for angles of attack up to 12 deg.

Stewart, J. E.↗