Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grid”

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,693 records · Page 94
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Application of a solution adaptive grid scheme, SAGE, to complex three-dimensional flows

A new three-dimensional (3D) adaptive grid code based on the algebraic, solution-adaptive scheme of Nakahashi and Deiwert is developed and applied to a variety of problems. The new computer code, SAGE, is an extension of the same-named two-dimensional (2D) solution-adaptive program that has already proven to be a powerful tool in computational fluid dynamics applications. The new code has been applied to a range of complex three-dimensional, supersonic and hypersonic flows. Examples discussed are a tandem-slot fuel injector, the hypersonic forebody of the Aeroassist Flight Experiment (AFE), the 3D base flow behind the AFE, the supersonic flow around a 3D swept ramp and a generic, hypersonic, 3D nozzle-plume flow. The associated adapted grids and the solution enhancements resulting from the grid adaption are presented for these cases. Three-dimensional adaption is more complex than its 2D counterpart, and the complexities unique to the 3D problems are discussed.

Davies, Carol B.↗
NASA NTRS1990

Stable boundary conditions for Cartesian grid calculations

The inviscid Euler equations in complicated geometries are solved using a Cartesian grid. This requires solid wall boundary conditions in the irregular grid cells near the boundary. Since these cells may be orders of magnitude smaller than the regular grid cells, stability is a primary concern. An approach to this problem is presented and its use is illustrated.

Berger, M. J.↗
NASA NTRS1991

Comparison of 2-D and 3-D models of grid erosion in an ion thruster

Numerical results of particle-in-cell/Monte Carlo calculations of accelerator grid erosion in an ion thruster are presented. Specifically, it is shown that a three-dimensional model is required to account for the experimentally observed pitting of the accelerator grid between grid apertures. Some comparisons with earlier two-dimensional, axisymmetric model are made, and it is shown that, for identical operating conditions of the thruster, the wear-through time in the three-dimensional model is about two to three times higher than that obtained previously with the two-dimensional model, namely on the order of 10,000 hours for sample calculation.

Peng, Xiaohang↗
NASA NTRS1991

Computational dispersion properties of horizontal staggered grids for atmospheric and ocean models

The computational dispersion properties of horizontally and time-horizontally staggered grids utilizing corresponding centered-difference techniques for approximation of the adjustment, or gravity wave equations, are examined in terms of their group velocity characteristics. Results are acquired for oceanic and atmospheric models, the former being characterized by a much smaller Rossby radius of deformation. For all grids considered additional filtering is required to control and even eliminate waves with poor computational dispersion characteristics. Computational dispersion properties along with other computational characteristics and requirements give some guidance for an optimal selection of an appropriate grid for an ocean or atmospheric model.

Fox-Rabinovitz, Michael S.↗
NASA NTRS1992

Adapting Grids For Computing Two-Dimensional Flows

SAGE2D is two-dimensional implementation of Self Adaptive Grid Evolution computer program that intelligently redistributes initial grid points on basis of initial flow-field solution. Grids modified according to initial computed flows enabling recomputation at greater accuracy. Written in FORTRAN 77.

Davies, Carol B.↗
NASA NTRS1992

Adaptive Grids For 3-D Parabolized Navier-Stokes Computations

Computational grids adjusted iteratively to reduce errors. Procedure for iterative adjustment of computational grids developed for use in numerical solution of three-dimensional parabolized Navier-Strokes equations of flow. Refines grid in regions of high gradients in initial computed flow so on subsequent iterations, one can satisfy competing requirements to produce solution capturing pertinent features as shock waves and boundary layers, accurate resolution of which typically requires fine meshes; and prevent unnecessary refinement of mesh elsewhere, preventing undue increase in amount of computation.

Harvey, A. D.↗
NASA NTRS1992

Streamwise Upwind, Moving-Grid Flow Algorithm

Extension to moving grids enables computation of transonic flows about moving bodies. Algorithm computes unsteady transonic flow on basis of nondimensionalized thin-layer Navier-Stokes equations in conservation-law form. Solves equations by use of computational grid based on curvilinear coordinates conforming to, and moving with, surface(s) of solid body or bodies in flow field. Simulates such complicated phenomena as transonic flow (including shock waves) about oscillating wing. Algorithm developed by extending prior streamwise upwind algorithm solving equations on fixed curvilinear grid described in "Streamwise Algorithm for Simulation of Flow" (ARC-12718).

Goorjian, Peter M.↗
NASA NTRS1992

Three-dimensional unstructured grid generation via incremental insertion and local optimization

Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization. The present algorithms are very general and permit local grid optimization based on various measures of grid quality. This is very important; unlike the 2D Delaunay triangulation, the 3D Delaunay triangulation appears not to have a lexicographic characterization of angularity. (The Delaunay triangulation is known to minimize that maximum containment sphere, but unfortunately this is not true lexicographically). Consequently, Delaunay triangulations in three-space can result in poorly shaped tetrahedral elements. Using the present algorithms, 3D meshes can be constructed which optimize a certain angle measure, albeit locally. We also discuss the combinatorial aspects of the algorithm as well as implementational details.

Barth, Timothy J.↗
NASA NTRS1992

A multiblock grid generation technique applied to a jet engine configuration

Techniques are presented for quickly finding a multiblock grid for a 2D geometrically complex domain from geometrical boundary data. An automated technique for determining a block decomposition of the domain is explained. Techniques for representing this domain decomposition and transforming it are also presented. Further, a linear optimization method may be used to solve the equations which determine grid dimensions within the block decomposition. These algorithms automate many stages in the domain decomposition and grid formation process and limit the need for human intervention and inputs. They are demonstrated for the meridional or throughflow geometry of a bladed jet engine configuration.

Stewart, Mark E. M.↗
NASA NTRS1992

Unstructured grid methods for compressible flows

The implementation of the finite element method on unstructured triangular grids is described and the development of centered finite element schemes for the solution of the compressible Euler equation on general triangular and tetrahedral grids is discussed. Explicit and implicit Lax-Wendroff type methods and a method based upon the use of explicit multistep timestepping are considered. In the latter case, the convergence behavior of the method is accelerated by the incorporation of a fully unstructured multigrid procedure. The advancing front method for generating unstructured grids of triangles and tetrahedra is described and the application of adaptive mesh techniques to both steady and transient flow analysis is illustrated.

Morgan, K.↗
NASA NTRS1992

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology.

Barth, Timothy J.↗
NASA NTRS1992

Unstructured-grid methods development for unsteady aerodynamic and aeroelastic analyses

The current status of unstructured grid methods developed in the Unsteady Aerodynamics Branch at NASA Langley Research Center is described. These methods are being developed for unsteady aerodynamic and aeroelastic analyses. Flow solvers that have been developed for the solution of unsteady Euler equations are highlighted. The results demonstrate two and three dimensional applications for both steady and unsteady flows. Comparisons are also made with solutions obtained using a structured grid code and with experimental data to determine the accuracy of the unstructured grid methodology. These comparisons show good agreement which thus verifies the accuracy.

Batina, John T.↗
NASA NTRS1992

NASA Workshop on future directions in surface modeling and grid generation

Given here is a summary of the paper sessions and panel discussions of the NASA Workshop on Future Directions in Surface Modeling and Grid Generation held a NASA Ames Research Center, Moffett Field, California, December 5-7, 1989. The purpose was to assess U.S. capabilities in surface modeling and grid generation and take steps to improve the focus and pace of these disciplines within NASA. The organization of the workshop centered around overviews from NASA centers and expert presentations from U.S. corporations and universities. Small discussion groups were held and summarized by group leaders. Brief overviews and a panel discussion by representatives from the DoD were held, and a NASA-only session concluded the meeting. In the NASA Program Planning Session summary there are five recommended steps for NASA to take to improve the development and application of surface modeling and grid generation.

Vandalsem, W. R.↗
NASA NTRS1992

Divergence preserving discrete surface integral methods for Maxwell's curl equations using non-orthogonal unstructured grids

Several new discrete surface integral (DSI) methods for solving Maxwell's equations in the time-domain are presented. These methods, which allow the use of general nonorthogonal mixed-polyhedral unstructured grids, are direct generalizations of the canonical staggered-grid finite difference method. These methods are conservative in that they locally preserve divergence or charge. Employing mixed polyhedral cells, (hexahedral, tetrahedral, etc.) these methods allow more accurate modeling of non-rectangular structures and objects because the traditional stair-stepped boundary approximations associated with the orthogonal grid based finite difference methods can be avoided. Numerical results demonstrating the accuracy of these new methods are presented.

Madsen, Niel K.↗
NASA NTRS1992

An efficient and robust grid optimization algorithm

The development of an efficient and robust grid optimization is presented. This algorithm is developed by combining the best characteristics of algebraic, elliptic, and hyperbolic grid generation techniques. This development is based on the following observations and evaluations: (1) algebraic systems are fast and economical; (2) precise spacing control is always achieved; (3) grid generation by elliptic systems is always smooth; and (4) the hyperbolic system preserves the orthogonality at the solid boundary and the point distribution in the field. Computational examples representing practical internal flow configurations are presented to demonstrate the algorithm.

Soni, Bharat K.↗
NASA NTRS1992

Grid generation and its application to separated flows

A method for the computation of recirculating flows on a nonorthogonal boundary-fitted coordinate system is presented. The algebraic grid generation technique is used to generate grids in a flow field of arbitrary shape. Computations are performed by using the set of governing equations transformed for use on a generalized curvilinear coordinate system. Turbulent flow computations were made by using the k-epsilon model for most of the flow cases. Three pressure correction algorithms - SIMPLE, SIMPLEC, and PISO - were incorporated for use on a nonorthogonal grid. Comparisons were made on the basis of numerical stability and accuracy. The present method was found to be efficient for computations of recirculating flows.

Maruszewski, J. P.↗
NASA NTRS1991

Grid adaptation to multiple functions for applied aerodynamic analysis

A fast and robust method of grid adaptation to multiple functions has been developed for flow analysis in 3D space. It is based on the equidistribution principle and the alternate direction adaptation method. The grid adaptation algorithm has been fully integrated with a space marching flow solver as contained within a 3D Navier-Stokes code and PAB3D-v2. The grid adaptation strategy, details of numerical implementation, examples of application, and potential extensions of the current method are presented in this paper.

Pao, S. P.↗
NASA NTRS1991

A solution-adaptive mesh algorithm for dynamic/static refinement of two and three dimensional grids

An adaptive grid algorithm has been developed in two and three dimensions that can be used dynamically with a solver or as part of a grid refinement process. The algorithm employs a transformation from the Cartesian coordinate system to a general coordinate space, which is defined as a parallelepiped in three dimensions. A weighting function, independent for each coordinate direction, is developed that will provide the desired refinement criteria in regions of high solution gradient. The adaptation is performed in the general coordinate space and the new grid locations are returned to the Cartesian space via a simple, one-step inverse mapping. The algorithm for relocation of the mesh points in the parametric space is based on the center of mass for distributed weights. Dynamic solution-adaptive results are presented for laminar flows in two and three dimensions.

Benson, Rusty A.↗