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 559 records · Page 31

Dust Survival in Galactic Winds

This repository contains three-dimensional volumetric data from an Eulerian hydrodynamical simulation (conducted on a uniform Cartesian grid) generated by the Cholla hydrodynamics code. The datasets contain snapshots (full-grid, projections, and slices) in the HDF5 format of a multi-phase medium in which a hot, diffuse, dust-free background wind accelerates a cool, dense cloud of gas and dust. This scenario is intended to represent a supernova-driven galactic outflow, in which hot supernova winds are thought to accelerate cool interstellar medium material out of the galactic disk into the surrounding circumgalactic medium. There are three separate datasets for simulations corresponding to three cloud evolutionary scenarios: long-term cloud survival (surv), marginal cloud survival (disr), and cloud destruction (dest). Projection and slice images of the simulations are also included in this repository.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational study of the aerodynamics and control by blowing of asymmetric vortical flows over delta wings

Some of the work is described which was done in a study of the flow field produced by tangential leading edge blowing on a 60 deg. delta wing. The flow is studied computationally by solving the Thin Layer Navier-Stokes equations. Steady state flow fields are calculated for various angles of attack and yaw, with and without the presence of tangential leading edge blowing. The effectiveness of blowing as a rolling moment control mechanism to extend the envelope of controllability is illustrated at pre- and post-stall angles of attack. The numerical grid is generated using algebraic grid generation and various interpolation and blending techniques. The jet emanates from a slot with linearly varying thickness and is introduced into the flow field using the concept of an actuator plane, thereby not requiring resolution of the jet slot geometry. The Baldwin-Lomax algebraic turbulence model is used to provide turbulent closure. The computational results are compared with those of experiments.

Craig, Ken↗

Application of Overset Technology on SIMPLEX Turbopump Design

A viewgraph presentation shows computer generated images of the Simplex Turbopump. Machine schematics are shown with scaled details of the nozzle ring assay and the turbine gas flow path. Grid generation is used to show nozzle grids, blade contours, blade grids and simplex full configuration and geometry. A flow simulation shows mach contours in absolute and relative frames.

Vu, Bruce↗

Unstructured Grids on NURBS Surfaces

A simple and efficient computational method is presented for unstructured surface grid generation. This method is built upon an advancing front technique combined with grid projection. The projection technique is based on a Newton-Raphson method. This combined approach has been successfully implemented for structured and unstructured grids. In this paper, the implementation for unstructured grid is discussed.

Samareh-Abolhassani, Jamshid↗

Direct Replacement of Arbitrary Grid-Overlapping by Non-Structured Grid

A new approach that uses nonstructured mesh to replace the arbitrarily overlapped structured regions of embedded grids is presented. The present methodology uses the Chimera composite overlapping mesh system so that the physical domain of the flowfield is subdivided into regions which can accommodate easily-generated grid for complex configuration. In addition, a Delaunay triangulation technique generates nonstructured triangular mesh which wraps over the interconnecting region of embedded grids. It is designed that the present approach, termed DRAGON grid, has three important advantages: eliminating some difficulties of the Chimera scheme, such as the orphan points and/or bad quality of interpolation stencils; making grid communication in a fully conservative way; and implementation into three dimensions is straightforward. A computer code based on a time accurate, finite volume, high resolution scheme for solving the compressible Navier-Stokes equations has been further developed to include both the Chimera overset grid and the nonstructured mesh schemes. For steady state problems, the local time stepping accelerates convergence based on a Courant - Friedrichs - Leury (CFL) number near the local stability limit. Numerical tests on representative steady and unsteady supersonic inviscid flows with strong shock waves are demonstrated.

Kao, Kai-Hsiung↗

Numerical solution of the Euler equations for high-speed, blended wing-body configurations

Simulation of high-speed three-dimensional flow about blended wing-body combinations is investigated. A finite-volume explicit scheme with Runge-Kutta time integration is used to solve the compressible Euler equations in order to simulate the flow. The method, augmented by carefully chosen dissipative terms and convergence accelerators such as enthalpy damping and maximum local time-stepping, has been found to be very efficient in solving high-speed flows involving strong shocks. An analytic method for generating the body geometry and an algebraic method for quasi-three-dimensional grid generation are described. Results are presented for various blended wing-body configurations at different Mach numbers and angles of attack.

Moitra, A.↗

Control of supersonic intersection flowfields through filleting and sweep

The problem of supersonic flow control using fillets and sweep for a wing/body junction has been investigated numerically using a three-dimensional Navier-Stokes code which employs the MacCormack time-split finite-volume technique. An elliptic grid generation technique with direct control over spacing has been incorporated for constructing the grid at a filleted wing/body junction. The computed results for pressure distribution, particle paths, and limiting streamlines on the flat plate and fin surface for a swept fin show a decrease in the peak pressure on the fin leading edge and in the extent of the separated flow region. Moreover, the results for the filleted juncture clearly show that the flow streamline patterns lose much of their vortical character with proper filleting. It is demonstrated that fillets with a radius of 3.5 times the fin leading edge diameter are required to weaken the usual necklace vortex interaction.

Lakshmanan, B.↗

Study of supersonic intersection flowfield at modified wing-body junctions

The problem of supersonic flow control using fillets and sweep for a wing-body junction has been investigated numerically using a three-dimensional Navier-Stokes code, which employs the MacCormack's time-split finite volume technique. An elliptic grid generation technique with direct control over spacing has been developed for constructing the grid at a filleted wing-body junction. The computed results for pressure distribution, particle paths, and limiting streamlines on the flat plate and fin surface for a swept fin show a decrease in the peak pressure on the fin leading edge and in the extent of the separated flow region. Moreover, the results for filleted juncture clearly show that the flow streamline patterns lose much of their vortical character with proper filleting. It has been demonstrated that fillets with a radius of three-and-one-half times the fin leading-edge diameter are required to weaken the vorticity in the horseshoe vortex by a factor of three for the Mach number and Reynolds number considered in the present study.

Lakshmanan, B.↗

Chimera Grid Tools

Chimera Grid Tools (CGT) is a software package for performing computational fluid dynamics (CFD) analysis utilizing the Chimera-overset-grid method. For modeling flows with viscosity about geometrically complex bodies in relative motion, the Chimera-overset-grid method is among the most computationally cost-effective methods for obtaining accurate aerodynamic results. CGT contains a large collection of tools for generating overset grids, preparing inputs for computer programs that solve equations of flow on the grids, and post-processing of flow-solution data. The tools in CGT include grid editing tools, surface-grid-generation tools, volume-grid-generation tools, utility scripts, configuration scripts, and tools for post-processing (including generation of animated images of flows and calculating forces and moments exerted on affected bodies). One of the tools, denoted OVERGRID, is a graphical user interface (GUI) that serves to visualize the grids and flow solutions and provides central access to many other tools. The GUI facilitates the generation of grids for a new flow-field configuration. Scripts that follow the grid generation process can then be constructed to mostly automate grid generation for similar configurations. CGT is designed for use in conjunction with a computer-aided-design program that provides the geometry description of the bodies, and a flow-solver program.

Chan, William M.↗

Agglomeration multigrid for the three-dimensional Euler equations

A multigrid procedure that makes use of coarse grids generated by the agglomeration of control volumes is advocated as a practical approach for solving the three dimensional Euler equations on unstructured grids about complex configurations. It is shown that the agglomeration procedure can be tailored to achieve certain coarse grid properties such as the sizes of the coarse grids and aspect ratios of the coarse grid cells. The agglomeration is done as a preprocessing step and runs in linear time. The implications for multigrid of using arbitrary polyhedral coarse grids are discussed. The agglomeration multigrid technique compares very favorably with existing multigrid procedures both in terms of convergence rates and elapsed times. The main advantage of the present approach is the ease with which coarse grids of any desired degree of coarseness may be generated in three dimensions, without being constrained by considerations of geometry. Inviscid flows over a variety of complex configurations are computed using the agglomeration multigrid strategy.

Venkatakrishnan, V.↗

USM3D Simulations for Third Sonic Boom Workshop

The NASA USM3D flow solver was used to compute test cases for the Third AIAA Sonic Boom Prediction Workshop (SBPW3). The test cases include an axisymmetric equivalent area body, a near field biconvex shock-plume interaction wind tunnel model, and the C608 Low Boom Flight Demonstrator. Numerical simulations were conducted on the mixed element grids and the tetrahedral grids provided by the workshop committee, as well as a family of grids generated by an in-house approach for sonic boom analyses known as Boom Grid. The near-field pressure signatures were extracted, propagated to the ground and the perceived loudness levels on the ground was computed. The USM3D near-field pressure signatures,corresponding ground signatures, and loudness levels on the ground are compared with mean values from other workshop participants.

Supersonics↗

A point implicit unstructured grid solver for the Euler and Navier-Stokes equations

An upwind finite element technique that uses cell centered quantities and implicit and/or explicit time marching has been developed for computing hypersonic laminar viscous flows using adaptive unstructured triangular grids. A structured grid of quadrilaterals is laid out near the body surface. For inviscid flows the method is stable at Courant numbers of over 100,000. A first order basic scheme and a higher order flux corrected transport (FCT) scheme have been implemented. This technique has been applied to the problem of predicting type III and IV shock wave interactions on a cylinder, with a view of simulating the pressure and heating rate augmentation caused by an impinging shock on the leading edge of a cowl lip of an engine inlet. The predictions of wall pressure and heating rates compare very well with experimental data. The flow features are very distinctly captured with a sequence of adaptively generated grids. The adaptive mesh generator and the upwind Navier-Stokes solver are combined in a set of programs called LARCNESS, an acronym for Langley Adaptive Remeshing Code and Navier-Stokes Solver.

Thareja, Rajiv R.↗

Generation of Surface Coordinates by Elliptic Partial Differential Equations

The problem of generating spatial coordinates by numerical methods through carefully selected mathematical models is of current interest both in mechanics and physics. The problem of generation of a desired system of coordinates in a given surface was considered, which essentially is an effort directed to the problem of grid generation in a two-dimensional non-Euclidean space. The mathematical model selected for this purpose is based on the formulae of Gauss for a surface. The proposed equations can be used to generate a new coordinate system from the data of an already given coordinate system in a surface. If the coefficients of the first and second fundamental forms have been given, then the proposed equations can be used to generate a surface satisfying the given data (surface fitting). The proposed equations can also be used to generate surfaces in the space between two arbitrary given surfaces, thus providing 3D grids in an Euclidean space.

Warsi, Z. U. A.↗

Idealized dynamic grid computation of physical systems

The construction and utility of an idealized computational space for finite-difference computation of physical systems are considered. All computations are performed in tau space, which at any instant represents the dynamic grid of a subject physical system appropriately stretched into a uniform, orthogonal grid. A strain field model of physical system is described, including the sample computation of strain density fields. Dynamic grid generation using invariant-mapping is addressed, and the tau computational space is considered, including a grid dynamism constraint, a grid orthogonality constraint, and a grid smoothness constraint. The detailed tau computational space method is presented and illustrated with two sample problems.

Anyiwo, J. C.↗

An exploratory study of finite difference grids for transonic unsteady aerodynamics

Unsteady aerodynamic forces are calculated by the XTRAN2L finite difference program which solves the complete two dimensional unsteady transonic small perturbation equation. The unsteady forces are obtained using a pulse transfer function technique which assumes the flow field behaves in a locally linear fashion about a mean condition. Forces are calculated for a linear flat plate using the default grids from the LTRAN2-NLR, LTRAN2-HI, and XTRAN3S programs. The forces are compared to the exact theoretical values for flat plate, and grid generated boundary and internal numerical reflections are observed to cause significant errors in the unsteady airloads. Grids are presented that alleviate the reflections while reducing computational time up to fifty-three percent and program size up to twenty-eight percent. Forces are presented for a six percent thick parabolic arc airfoil which demonstrate that the transform technique may be successfully applied to nonlinear transonic flows.

Seidel, D. A.↗

A 3-D chimera grid embedding technique

A three-dimensional (3-D) chimera grid-embedding technique is described. The technique simplifies the construction of computational grids about complex geometries. The method subdivides the physical domain into regions which can accommodate easily generated grids. Communication among the grids is accomplished by interpolation of the dependent variables at grid boundaries. The procedures for constructing the composite mesh and the associated data structures are described. The method is demonstrated by solution of the Euler equations for the transonic flow about a wing/body, wing/body/tail, and a configuration of three ellipsoidal bodies.

Benek, J. A.↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗