Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A Pipeline for Large Data Processing Using Regular Sampling for Unstructured Grids

Large simulation data requires a lot of time and computational resources to compute, store, analyze, visualize, and run user studies. Today, the largest cost of a supercomputer is not hardware but maintenance, in particular energy consumption. Our goal is to balance energy consumption and cognitive value of visualizations of resulting data. This requires us to go through the entire processing pipeline, from simulation to user studies. To reduce the amount of resources, data can be sampled or compressed. While this adds more computation time, the computational overhead is negligible compared to the simulation time. We built a processing pipeline at the example of regular sampling. The reasons for this choice are two-fold: using a simple example reduces unnecessary complexity as we know what to expect from the results. Furthermore, it provides a good baseline for future, more elaborate sampling methods. We measured time and energy for each test we did, and we conducted user studies in Amazon Mechanical Turk (AMT) for a range of different results we produced through sampling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

OpenACC directive-based GPU acceleration of an implicit reconstructed discontinuous Galerkin method for compressible flows on 3D unstructured grids

In this study, we use a combination of modeling techniques to describe the relationship between fracture radius that might be accomplished in a hypothetical enhanced geothermal system (EGS) and drilling distance required to create and access those fractures. We use a combination of commonly applied analytical solutions for heat transport in parallel fractures and 3D finite-element method models of more realistic heat extraction geometries. For a conceptual model involving multiple parallel fractures developed perpendicular to an inclined or horizontal borehole, calculations demonstrate that EGS will likely require very large fractures, of greater than 300 m radius, to keep interfracture drilling distances to ~10 km or less. As drilling distances are generally inversely proportional to the square of fracture radius, drilling costs quickly escalate as the fracture radius decreases. It is important to know, however, whether fracture spacing will be dictated by thermal or mechanical considerations, as the relationship between drilling distance and number of fractures is quite different in each case. Information about the likelihood of hydraulically creating very large fractures comes primarily from petroleum recovery industry data describing hydraulic fractures in shale. Those data suggest that fractures with radii on the order of several hundred meters may, indeed, be possible. The results of this study demonstrate that relatively simple calculations can be used to estimate primary design constraints on a system, particularly regarding the relationship between generated fracture radius and the total length of drilling needed in the fracture creation zone. Comparison of the numerical simulations of more realistic geometries than addressed in the analytical solutions suggest that simple proportionalities can readily be derived to relate a particular flow field.

15 GEOTHERMAL ENERGY↗
DOE OSTI2017

A New High-Order Spectral Difference Method for Simulating Viscous Flows on Unstructured Grids with Mixed Elements

In the present study, a new spectral difference (SD) method is developed for viscous flows on meshes with a mixture of triangular and quadrilateral elements. The standard SD method for triangular elements, which employs Lagrangian interpolating functions for fluxes, is not stable when the designed accuracy of spatial discretization is third-order or higher. Unlike the standard SD method, the method examined here uses vector interpolating functions in the Raviart-Thomas (RT) spaces to construct continuous flux functions on reference elements. Studies have been performed for 2D wave equation and Euler equa- tions. Our present results demonstrated that the SDRT method is stable and high-order accurate for a number of test problems by using triangular-, quadrilateral-, and mixed- element meshes.

17 WIND ENERGY↗
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.↗