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 181 records · Page 10

Grid generation strategies for turbomachinery configurations

Turbomachinery flow fields involve unique grid generation issues due to their geometrical and physical characteristics. Several strategic approaches are discussed to generate quality grids. The grid quality is further enhanced through blending and adapting. Grid blending smooths the grids locally through averaging and diffusion operators. Grid adaptation redistributes the grid points based on a grid quality assessment. These methods are demonstrated with several examples.

Lee, K. D.↗

A generalized scheme for three-dimensional hyperbolic grid generation

A hyperbolic grid generation scheme formulated from grid orthogonality and cell volume specification is generalized such that high quality three-dimensional grids can be obtained for a wide variety of geometries. The speed of the scheme is one to two orders of magnitude faster than typical elliptic grid generation methods. The robustness of the scheme is significantly enhanced by several new techniques. By using a spatially variable smoothing coefficient, orthogonality and smoothness of the grid are maintained around complex concave and convex surface topologies. A metric correction procedure is employed to guarantee that the grid marches out of a corner by bisecting the angles subtended by the neighboring points. Extra robustness at severe convex corners is achieved by special local treatments. Different extrapolation methods are used to provide smoothness at floating edges and axis regions. The versatility of the new hyperbolic grid generation scheme is demonstrated by three-dimensional grids generated for external components of the intergrated Space Shuttle vehicle and the SOFIA telescope.

Chan, William M.↗

Algebraic grid generation for coolant passages of turbine blades with serpentine channels and pin fins

In order to study numerically details of the flow and heat transfer within coolant passages of turbine blades, a method must first be developed to generate grid systems within the very complicated geometries involved. In this study, a grid generation package was developed that is capable of generating the required grid systems. The package developed is based on an algebraic grid generation technique that permits the user considerable control over how grid points are to be distributed in a very explicit way. These controls include orthogonality of grid lines next to boundary surfaces and ability to cluster about arbitrary points, lines, and surfaces. This paper describes that grid generation package and shows how it can be used to generate grid systems within complicated-shaped coolant passages via an example.

Shih, T. I.-P.↗

Geometry modeling and multi-block grid generation for turbomachinery configurations

An interactive 3D grid generation code, Turbomachinery Interactive Grid genERation (TIGER), was developed for general turbomachinery configurations. TIGER features the automatic generation of multi-block structured grids around multiple blade rows for either internal, external, or internal-external turbomachinery flow fields. Utilization of the Bezier's curves achieves a smooth grid and better orthogonality. TIGER generates the algebraic grid automatically based on geometric information provided by its built-in pseudo-AI algorithm. However, due to the large variation of turbomachinery configurations, this initial grid may not always be as good as desired. TIGER therefore provides graphical user interactions during the process which allow the user to design, modify, as well as manipulate the grid, including the capability of elliptic surface grid generation.

Shih, Ming H.↗

An analytical approach to grid sensitivity analysis for NACA four-digit wing sections

Sensitivity analysis in computational fluid dynamics with emphasis on grids and surface parameterization is described. An interactive algebraic grid-generation technique is employed to generate C-type grids around NACA four-digit wing sections. An analytical procedure is developed for calculating grid sensitivity with respect to design parameters of a wing section. A comparison of the sensitivity with that obtained using a finite difference approach is made. Grid sensitivity with respect to grid parameters, such as grid-stretching coefficients, are also investigated. Using the resultant grid sensitivity, aerodynamic sensitivity is obtained using the compressible two-dimensional thin-layer Navier-Stokes equations.

Sadrehaghighi, I.↗

TIGER: Turbomachinery interactive grid generation

A three dimensional, interactive grid generation code, TIGER, is being developed for analysis of flows around ducted or unducted propellers. TIGER is a customized grid generator that combines new technology with methods from general grid generation codes. The code generates multiple block, structured grids around multiple blade rows with a hub and shroud for either C grid or H grid topologies. The code is intended for use with a Euler/Navier-Stokes solver also being developed, but is general enough for use with other flow solvers. TIGER features a silicon graphics interactive graphics environment that displays a pop-up window, graphics window, and text window. The geometry is read as a discrete set of points with options for several industrial standard formats and NASA standard formats. Various splines are available for defining the surface geometries. Grid generation is done either interactively or through a batch mode operation using history files from a previously generated grid. The batch mode operation can be done either with a graphical display of the interactive session or with no graphics so that the code can be run on another computer system. Run time can be significantly reduced by running on a Cray-YMP.

Soni, Bharat K.↗

Techniques for grid manipulation and adaptation

Two approaches have been taken to provide systematic grid manipulation for improved grid quality. One is the control point form (CPF) of algebraic grid generation. It provides explicit control of the physical grid shape and grid spacing through the movement of the control points. It works well in the interactive computer graphics environment and hence can be a good candidate for integration with other emerging technologies. The other approach is grid adaptation using a numerical mapping between the physical space and a parametric space. Grid adaptation is achieved by modifying the mapping functions through the effects of grid control sources. The adaptation process can be repeated in a cyclic manner if satisfactory results are not achieved after a single application.

Choo, Yung K.↗

Enhancements to the GRIDGEN structured grid generation system for internal and external flow applications

GRIDGEN is a government domain software package for interactive generation of multiple block grids around general configurations. Though it has been freely available since 1989, it has not been widely embraced by the internal flow community due to a misconception that it was designed for external flow use only. In reality GRIDGEN has always worked for internal flow applications, and GRIDGEN ongoing enhancements are increasing the quality of and efficiency with which grids for external and internal flow problems may be constructed. The software consists of four codes used to perform the four steps of the grid generation process. GRIDBLOCK is first used to decompose the flow domain into a collection of component blocks and then to establish interblock connections and flow solver boundary conditions. GRIDGEN2D is then used to generate surface grids on the outer shell of each component block. GRIDGEN3D generates grid points on the interior of each block, and finally GRIDVUE3D is used to inspect the resulting multiple block grid. Three of these codes (GRIDBLOCK, GRIDGEN2D, and GRIDVUE3D) are highly interactive and graphical in nature, and currently run on Silicon Graphics, Inc., and IBM RS/6000 workstations. The lone batch code (GRIDGEN3D) may be run on any of several Unix based platforms. Surface grid generation in GRIDGEN2D is being improved with the addition of higher order surface definitions (NURBS and parametric surfaces input in IGES format and bicubic surfaces input in PATRAN Neutral File format) and double precision mathematics. In addition, two types of automation have been added to GRIDGEN2D that reduce the learning curve slope for new users and eliminate work for experienced users. Volume grid generation using GRIDGEN3D has been improved via the addition of an advanced hybrid control function formulation that provides both orthogonality and clustering control at the block faces and clustering control on the block interior.

Steinbrenner, John P.↗

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

An analytical approach to grid sensitivity analysis

Sensitivity analysis in Computational Fluid Dynamics with emphasis on grids and surface parameterization is described. An interactive algebraic grid-generation technique is employed to generate C-type grids around NACA four-digit wing sections. An analytical procedure is developed for calculating grid sensitivity with respect to design parameters of a wing section. A comparison of the sensitivity with that obtained using a finite-difference approach is made. Grid sensitivity with respect to grid parameters, such as grid-stretching coefficients, are also investigated. Using the resultant grid sensitivity, aerodynamic sensitivity is obtained using the compressible two-dimensional thin-layer Navier-Stokes equations.

Sadrehaghighi, Ideen↗

General-Purpose Time-Accurate Adaptive-Grid Method

Adaptive-grid method provides for generation of time-accurate grids used to solve wide variety of problems numerically. Intended use in computation of compressible flows. Part of solution method including algebraic grid-movement scheme; algorithm solving, by use of explicit numerical-integration scheme, Euler equations of unsteady flow; and temporal coupling routine utilizing grid-prediction/correction method to link dynamic grid with Euler-equation-solving algorithm. Improves ability to adapt grid to multiple features of solution and involves use of coarse grid in prediction stage of temporal coupling reducing central-processing-unit cost of obtaining new grid.

Bockelie, Michael J.↗

Unstructured viscous grid generation by advancing-front method

A new method of generating unstructured triangular/tetrahedral grids with high-aspect-ratio cells is proposed. The method is based on new grid-marching strategy referred to as 'advancing-layers' for construction of highly stretched cells in the boundary layer and the conventional advancing-front technique for generation of regular, equilateral cells in the inviscid-flow region. Unlike the existing semi-structured viscous grid generation techniques, the new procedure relies on a totally unstructured advancing-front grid strategy resulting in a substantially enhanced grid flexibility and efficiency. The method is conceptually simple but powerful, capable of producing high quality viscous grids for complex configurations with ease. A number of two-dimensional, triangular grids are presented to demonstrate the methodology. The basic elements of the method, however, have been primarily designed with three-dimensional problems in mind, making it extendible for tetrahedral, viscous grid generation.

Pirzadeh, Shahyar↗

Three-dimensional Navier-Stokes calculations using solution-adapted grids

A three-dimensional solution-adaptive grid generation technique is presented. The adaptation technique redistributes grid points to improve the accuracy of a flow solution without increasing the number of grid points. It is applicable to structured grids with a multiblock topology. The method uses a numerical mapping and potential theory to modify the initial grid distribution based on the properties of the flow solution on the initial grid. The technique is demonstrated with two examples - a transonic finite wing and a supersonic blunt fin. The advantages are shown by comparing flow solutions on the adapted grids with those on the initial grids.

Henderson, T. L.↗

Unstructured viscous grid generation by advancing-layers method

A new method of generating unstructured triangular/tetrahedral grids with high-aspect-ratio cells is proposed. The method is based on new grid-marching strategy referred to as 'advancing-layers' for construction of highly stretched cells in the boundary layer and the conventional advancing-front technique for generation of regular, equilateral cells in the inviscid-flow region. Unlike the existing semi-structured viscous grid generation techniques, the new procedure relies on a totally unstructured advancing-front grid strategy resulting in a substantially enhanced grid flexibility and efficiency. The method is conceptually simple but powerful, capable of producing high quality viscous grids for complex configurations with ease. A number of two-dimensional, triangular grids are presented to demonstrate the methodology. The basic elements of the method, however, have been primarily designed with three-dimensional problems in mind, making it extendible for tetrahedral, viscous grid generation.

Pirzadeh, Shahyar↗

Chimera grids in the simulation of three-dimensional flowfields in turbine-blade-coolant passages

When computing flows inside geometrically complex turbine-blade coolant passages, the structure of the grid system used can affect significantly the overall time and cost required to obtain solutions. This paper addresses this issue while evaluating and developing computational tools for the design and analysis of coolant-passages, and is divided into two parts. In the first part, the various types of structured and unstructured grids are compared in relation to their ability to provide solutions in a timely and cost-effective manner. This comparison shows that the overlapping structured grids, known as Chimera grids, can rival and in some instances exceed the cost-effectiveness of unstructured grids in terms of both the man hours needed to generate grids and the amount of computer memory and CPU time needed to obtain solutions. In the second part, a computational tool utilizing Chimera grids was used to compute the flow and heat transfer in two different turbine-blade coolant passages that contain baffles and numerous pin fins. These computations showed the versatility and flexibility offered by Chimera grids.

Stephens, M. A.↗

Time-domain analysis of planar microstrip devices using a generalized Yee-algorithm based on unstructured grids

The generalized Yee-algorithm is presented for the temporal full-wave analysis of planar microstrip devices. This algorithm has the significant advantage over the traditional Yee-algorithm in that it is based on unstructured and irregular grids. The robustness of the generalized Yee-algorithm is that structures that contain curved conductors or complex three-dimensional geometries can be more accurately, and much more conveniently modeled using standard automatic grid generation techniques. This generalized Yee-algorithm is based on the the time-marching solution of the discrete form of Maxwell's equations in their integral form. To this end, the electric and magnetic fields are discretized over a dual, irregular, and unstructured grid. The primary grid is assumed to be composed of general fitted polyhedra distributed throughout the volume. The secondary grid (or dual grid) is built up of the closed polyhedra whose edges connect the centroid's of adjacent primary cells, penetrating shared faces. Faraday's law and Ampere's law are used to update the fields normal to the primary and secondary grid faces, respectively. Subsequently, a correction scheme is introduced to project the normal fields onto the grid edges. It is shown that this scheme is stable, maintains second-order accuracy, and preserves the divergenceless nature of the flux densities. Finally, for computational efficiency the algorithm is structured as a series of sparse matrix-vector multiplications. Based on this scheme, the generalized Yee-algorithm has been implemented on vector and parallel high performance computers in a highly efficient manner.

Gedney, Stephen D.↗

A Method for Flow Simulation About Complex Geometries Using Both Structured and Unstructured Grids

A computational fluid dynamics code which utilizes both structured and unstructured grids was developed. The objective of this study was to develop and demonstrate the ability of such a code to achieve solutions about complex geometries in two dimensions. An unstructured grid generator and flow solver were incorporated into the PARC2D structured flow solver. This new unstructured grid generator capability allows for easier generation and manipulation of complex grids. Several examples of the grid generation capabilities are provided. The coupling of different grid topologies and the manipulation of individual grids is shown. Also, grids for realistic geometries, a NACA 0012 airfoil and a wing/nacelle installation, were created. The flow over a NACA 0012 airfoil was used as a test case for the flow solver. Eight separate cases were run. They were both the inviscid and viscous solutions for two freestream Mach numbers and airfoil angle of attacks of 0 to 3.86 degrees. The Mach numbers chosen were for a subsonic case, Mach 0.6, and a case where supersonic regions and a shock wave exists, Mach 0.8. These test case conditions were selected to match experimentally obtained data for code comparison. The results show that the code accurately predicts the flow field for all cases.

Debonis, James R.↗

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗