Search NASA⌕ Search

SEARCH · Search NASA

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

Algebraic turbulence models for the computation of two-dimensional high speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2-D compressible Navier-Stokes equations using triangular grids is described. A practical way to use the Cebeci Smith model, and to modify it in separated regions is proposed. The ability of the model to predict high speed, perfect gas boundary layers is investigated from a numerical point of view.

Rostand, Philippe↗
NASA NTRS1989

Algebraic turbulence models for the computation of two-dimensional high-speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2-D compressible Navier-Stokes equations using triangular grids is described. A practial way to use the Cebeci Smith model, and to modify it in separated regions is proposed. The ability of the model to predict high speed, perfect gas boundary layers is investigated from a numerical point of view.

Rostand, Philippe↗
NASA NTRS1990

Generation and adaptation of 3-D unstructured grids for transient problems

Grid generation and adaptive refinement techniques suitable for the simulation of strongly unsteady flows past geometrically complex bodies in 3-D are described. The grids are generated using the advancing front technique. Emphasis is placed not to generate elements that are too small, as this would severely increase the cost of simulations with explicit flow solvers. The grids are adapted to an evolving flowfield using simple h-refinement. A grid change is performed every 5 to 10 timesteps, and only one level of refinement/coarsening is allowed per mesh change.

Loehner, Rainald↗
NASA NTRS1990

Higher order solution of the Euler equations on unstructured grids using quadratic reconstruction

High order accurate finite-volume schemes for solving the Euler equations of gasdynamics are developed. Central to the development of these methods are the construction of a k-exact reconstruction operator given cell-averaged quantities and the use of high order flux quadrature formulas. General polygonal control volumes (with curved boundary edges) are considered. The formulations presented make no explicit assumption as to complexity or convexity of control volumes. Numerical examples are presented for Ringleb flow to validate the methodology.

Barth, Timothy J.↗
NASA NTRS1989

Three dimensional unstructured grids for the solution of the Euler equations

The advancing front technique is being used to develop a code to generate grids around complex 3-D configurations for use in computing the invisid flow solutions by the Euler equations. By the advancing front technique points are introduced concurrently with the connectivity information so that a separate library is not required. The generation of a 3-D grid is accomplished in several steps. First the boundaries of the domain to be gridded must be described by two-, three- or four-sided surface patches. Next, a background mesh is required to control the grid spacing and stretching throughout the domain. This coarse tetrahedral grid is not required to conform to any of the boundaries. Next, each of the patches is mapped to 2-D, triangulated by the advancing front technique and mapped back to 3-D. These triangles form the initial front for the generation of the final tetrahedral mesh.

Gumbert, Clyde↗
NASA NTRS1991

Generation and use of unstructured grids for turbomachinery calculations

A wavefront mesh generator for two dimensional triangular meshes as well as a brief description of the solution method used with these meshes are presented. The interest is in creating meshes for solving the equations of fluid mechanics in complex turbomachinery problems, although the mesh generator and flow solver may be used for a larger variety of applications. The focus is on the flexibility and power of the mesh generation method for triangulating extremely complex geometries and in changing the geometry to create a new mesh. Two turbomachinery applications are presented which take advantage of this method: the analysis of pylon/strut and pylon/OGV interaction in the bypass of a turbofan.

Lindquist, Dana R.↗
NASA NTRS1991

Surface reconstruction from scattered data through pruning of unstructured grids

This paper describes an algorithm for reconstructing a surface from a randomly digitized object. Scan data (treated as a cloud of points) is first tesselated out to its convex hull using Delaunay triangulation. The line-of-sight between each surface point and the scanning device is traversed, and any tetrahedra which are pierced by it are removed. The remaining tetrahedra form an approximate solid model of the scanned object. Due to the inherently limited resolution of any scan, this algorithm requires two additional procedures to produce a smooth, polyhedral surface: one process removes long, narrow tetrahedra which span indentations in the surface between digitized points; the other smooths sharp edges. The results for a moderately resolved sample body and a highly resolved aircraft are displayed.

Maksymiuk, C. M.↗
NASA NTRS1992

An alternative to unstructured grids for computing gas dynamic flows around arbitrarily complex two-dimensional bodies

In this paper we describe an approach for dealing with arbitrary complex, two dimensional geometries, the so-called cartesian boundary method. Conceptually, the cartesian boundary method is quite simple. Solid bodies blank out areas of a background, cartesian mesh, and the resultant cut cells are singled out for special attention. However, there are several obstacles that must be overcome in order to achieve a practical scheme. We present a general strategy that overcomes these obstacles, together with some details of our successful conversion of an adaptive mesh algorithm from a body-fitted code to a cartesian boundary code.

Quirk, James J.↗
NASA NTRS1993

A parallel dynamic load balancing algorithm for 3-D adaptive unstructured grids

Adaptive local grid refinement and coarsening results in unequal distribution of workload among the processors of a parallel system. A novel method for balancing the load in cases of dynamically changing tetrahedral grids is developed. The approach employs local exchange of cells among processors in order to redistribute the load equally. An important part of the load balancing algorithm is the method employed by a processor to determine which cells within its subdomain are to be exchanged. Two such methods are presented and compared. The strategy for load balancing is based on the Divide-and-Conquer approach which leads to an efficient parallel algorithm. This method is implemented on a distributed-memory MIMD system.

Vidwans, A.↗
NASA NTRS1993

An upwind multigrid algorithm for calculating flows on unstructured grids

An algorithm is described that calculates inviscid, laminar, and turbulent flows on triangular meshes with an upwind discretization. A brief description of the base solver and the multigrid implementation is given, followed by results that consist mainly of convergence rates for inviscid and viscous flows over a NACA four-digit airfoil section. The results show that multigrid does accelerate convergence when the same relaxation parameters that yield good single-grid performance are used; however, larger gains in performance can be realized by doing less work in the relaxation scheme.

Bonhaus, Daryl L.↗
NASA NTRS1993

Software systems used for unstructured grid generation at NASA Langley

These viewgraphs provide an overview of grid generation system for 3D configurations (Euler Grids) and grid generators of viscous and inviscid flow, solution adaptive for steady and unsteady flow. The five systems presented are VGRID, FELISA, TETRA, NGP, and TGRID.

Michael J Bockelie↗