Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Unstructured 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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗
NASA NTRS1994

Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations

Basic algorithms for unstructured mesh generation and fluid flow calculation are discussed. In particular the following are addressed: preliminaries of graphs and meshes; duality and data structures; basic graph operations important in CFD (Computational Fluid Dynamics); triangulation methods, including Varonoi diagrams and Delaunay triangulation; maximum principle analysis; finite volume schemes for scalar conservation law equations; finite volume schemes for the Euler and Navier-Stokes equations; and convergence acceleration for steady state calculations.

Barth, T. J.↗
NASA NTRS2002

Propulsion Simulations with the Unstructured-Grid CFD Tool TetrUSS

A computational investigation has been completed to assess the capability of the NASA Tetrahedral Unstructured Software System (TetrUSS) for simulation of exhaust nozzle flows. Three configurations were chosen for this study: (1) a fluidic jet effects model, (2) an isolated nacelle with a supersonic cruise nozzle, and (3) a fluidic pitchthrust- vectoring nozzle. These configurations were chosen because existing data provided a means for measuring the ability of the TetrUSS flow solver USM3D for simulating complex nozzle flows. Fluidic jet effects model simulations were compared with structured-grid CFD (computational fluid dynamics) data at Mach numbers from 0.3 to 1.2 at nozzle pressure ratios up to 7.2. Simulations of an isolated nacelle with a supersonic cruise nozzle were compared with wind tunnel experimental data and structured-grid CFD data at Mach numbers of 0.9 and 1.2, with a nozzle pressure ratio of 5. Fluidic pitch-thrust-vectoring nozzle simulations were compared with static experimental data and structured-grid CFD data at static freestream conditions and nozzle pressure ratios from 3 to 10. A fluidic injection case was computed with the third configuration at a nozzle pressure ratio of 4.6 and a secondary pressure ratio of 0.7. Results indicate that USM3D with the S-A turbulence model provides accurate exhaust nozzle simulations at on-design conditions, but does not predict internal shock location at overexpanded conditions or pressure recovery along a boattail at transonic conditions.

Deere, Karen A.↗
NASA NTRS1991

An efficient massively parallel Euler solver for unstructured grids

A data parallel mesh-vertex upwind finite-volume scheme for solving the Euler equations on triangular unstructured meshes is described. A novel vertex-based partitioning of the problem is introduced which minimizes the computation and communication costs associated with distributing the computation to the processors of a massively parallel computer. Finally, the performance of this unstructured computation on 8K processors of the Connection Machine CM-2 is compared with one processor of a Cray-YMP. The experiments show that 8K processors of the CM-2 achieve approximately 70 percent of the performance of one processor of the Cray-YMP on the unstructured mesh computations described here.

Hammond, Steven W.↗
NASA NTRSDate not supplied

Structured Overset and Unstructured Grid Simulations for the Third AIAA Sonic Boom Prediction Workshop

Predictions using the Launch Ascent and Vehicle Aerodynamics (LAVA) Unstructured and Structured Curvilinear solvers for the Biconvex and C608 geometries are compared in support of the 3rd AIAA Sonic Boom Prediction workshop. Description of the mesh generation techniques and numerical methods are provided along with a comparison of nearfield and far-field predictions with available experimental data as well as other workshop sub-missions. Strong consistency was observed between the Biconvex and C608 nearfield predictions across the two solvers used for this study, as well as validation and verification data. Additionally, near-field and farfield ground signature results using a combination of a truncated computational fluid dynamics (CFD) domain coupled to a mid-field space marching method and propagated to the ground using sBOOM will be discussed. This approach is shown to provide an efficient way to propagate near-field pressure signatures to the ground with the same accuracy as the near-field CFD coupled to sBOOM, but at less computational cost.

CST↗
NASA NTRS1993

Three-dimensional unstructured grid method applied to turbomachinery

This work has three objectives: to develop a three-dimensional flow solver based on unstructured tetrahedral meshes for turbomachinery flows; to validate the solver through comparisons with experimental data; and to apply the solver for better understanding of the flow through turbomachinery geometries and design improvement. The work followed three different approaches: an existing external flow solver/grid generator (USM3D/VGRID) was extensively modified for internal flows; a three-dimensional, finite-volume solver based on Roe's flux-difference splitting and explicit Runge-Kutta time stepping; and three-dimensional unstructured tetrahedral mesh generation using an advancing-front technique. A discussion of these topics is presented in viewgraph form.

Oh Joon Kwon↗
NASA NTRS1992

Implicit upwind-Euler solution algorithms for unstructured-grid applications

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using a mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.

Batina, John T.↗
NASA NTRS1992

Implicit upwind-Euler solution algorithms for unstructured-grid applications

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahdral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seidel relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using s mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.

Batina, John T.↗
NASA NTRS1993

Three-dimensional unstructured grid Euler method applied to turbine blades

Flow through a turbine annular cascade is calculated using a three-dimensional Euler method based on unstructured tetrahedral meshes. The equations are integrated in time using an explicit Runge-Kutta time-stepping scheme. The inviscid flux terms are discretized using a cell-centered finite-volume formulation with upwind flux-difference splitting. The tetrahedral meshes around the turbine blade are generated using an advancing-front technique with forced geometric periodicity between the blades. Good agreement is obtained between the present calculation and the experiment for both surface pressure distribution and flow behavior in the passage between the blades, demonstrating the capability of the present methodology for turbomachinery flow applications.

Kwon, Oh J.↗
NASA NTRS1992

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗
NASA NTRS2006

Assessment of an Unstructured-Grid Method for Predicting Aerodynamic Performance of Jet Flaps

The application of a Computational Fluid Dynamics tool to a jet flap control effector on an elliptical airfoil-section wing was investigated. The study utilized the Tetrahedral Unstructured Software System developed at NASA Langley Research Center. The Reynolds-averaged Navier-Stokes flow solver code used was USM3D. The CFD-based jet flap simulations were compared to experimental results from a wind tunnel test conducted at the NASA Langley Transonic Dynamics Tunnel. The wind tunnel model consisted of a six percent thick elliptical airfoil with a modified trailing edge. The jet flap was located at 95% chord and exited at 90 degrees to the lower surface. The experimental model was designed to promote two-dimensional flow across the wing. It was found that the CFD simulation had to model the three-dimensional geometry of the experiment in order to obtain good agreement. Tests were performed at two Mach numbers at several different jet momentum coefficients. In order to be consistent with the experimental method, the CFD lift and pitching moment values were determined by integrating the pressures over the wing.

Cruz, Josue↗
DOE OSTI2019

Asynchronous Navier-Stokes Solver on 3D Unstructured Grids for the Exascale Era

This project has developed multiple fluid dynamics solvers for complex 3D flows using fully asynchronous distributed-memory task-parallel algorithms on top of the Charm++ runtime system. The algorithms solve the Euler or Navier-Stokes equations of compressible flows using unstructured tetrahedron meshes with optional solution-adaptive mesh-, and polynomial-order refinement. We have demonstrated excellent strong scaling up 50K compute cores and the benefits of Charm++’s automatic load balancing.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

A User's Guide to AMR1D: An Instructional Adaptive Mesh Refinement Code for Unstructured Grids

This report documents the code AMR1D, which is currently posted on the World Wide Web (http://sdcd.gsfc.nasa.gov/ESS/exchange/contrib/de-fainchtein/adaptive _mesh_refinement.html). AMR1D is a one-dimensional finite element fluid-dynamics solver, capable of adaptive mesh refinement (AMR). It was written as an instructional tool for AMR on unstructured mesh codes. It is meant to illustrate the minimum requirements for AMR on more than one dimension. For that purpose, it uses the same type of data structure that would be necessary on a two-dimensional AMR code (loosely following the algorithm described by Lohner).

deFainchtein, Rosalinda↗
NASA NTRS1993

Three-dimensional unstructured grid refinement and optimization using edge-swapping

This paper presents a three-dimensional (3-D) 'edge-swapping method based on local transformations. This method extends Lawson's edge-swapping algorithm into 3-D. The 3-D edge-swapping algorithm is employed for the purpose of refining and optimizing unstructured meshes according to arbitrary mesh-quality measures. Several criteria including Delaunay triangulations are examined. Extensions from two to three dimensions of several known properties of Delaunay triangulations are also discussed.

Gandhi, Amar↗
NASA NTRS2004

Balanced Central Schemes for the Shallow Water Equations on Unstructured Grids

We present a two-dimensional, well-balanced, central-upwind scheme for approximating solutions of the shallow water equations in the presence of a stationary bottom topography on triangular meshes. Our starting point is the recent central scheme of Kurganov and Petrova (KP) for approximating solutions of conservation laws on triangular meshes. In order to extend this scheme from systems of conservation laws to systems of balance laws one has to find an appropriate discretization of the source terms. We first show that for general triangulations there is no discretization of the source terms that corresponds to a well-balanced form of the KP scheme. We then derive a new variant of a central scheme that can be balanced on triangular meshes. We note in passing that it is straightforward to extend the KP scheme to general unstructured conformal meshes. This extension allows us to recover our previous well-balanced scheme on Cartesian grids. We conclude with several simulations, verifying the second-order accuracy of our scheme as well as its well-balanced properties.

Bryson, Steve↗
DOE OSTI2012

Finite Volume schemes on unstructured grids for non-local models: Application to the simulation of heat transport in plasmas

In the so-called Spitzer-Haerm regime, equations of plasma physics reduce to a nonlinear parabolic equation for the electronic temperature. Coming back to the derivation of this limiting equation through hydrodynamic regime arguments, one is led to construct a hierarchy of models where the heat fluxes are defined through a non-local relation which can be reinterpreted as well by introducing coupled diffusion equations. We address the question of designing numerical methods to simulate these equations. The basic requirement for the scheme is to be asymptotically consistent with the Spitzer-Haerm regime. Furthermore, the constraints of physically realistic simulations make the use of unstructured meshes unavoidable. We develop a Finite Volume scheme, based on Vertex-Based discretization, which reaches these objectives. We discuss on numerical grounds the efficiency of the method, and the ability of the generalized models in capturing relevant phenomena missed by the asymptotic problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗