Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “triangulation”

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 361 records · Page 20

B-spline Method in Fluid Dynamics

B-spline functions are bases for piecewise polynomials that possess attractive properties for complex flow simulations : they have compact support, provide a straightforward handling of boundary conditions and grid nonuniformities, and yield numerical schemes with high resolving power, where the order of accuracy is a mere input parameter. This paper reviews the progress made on the development and application of B-spline numerical methods to computational fluid dynamics problems. Basic B-spline approximation properties is investigated, and their relationship with conventional numerical methods is reviewed. Some fundamental developments towards efficient complex geometry spline methods are covered, such as local interpolation methods, fast solution algorithms on cartesian grid, non-conformal block-structured discretization, formulation of spline bases of higher continuity over triangulation, and treatment of pressure oscillations in Navier-Stokes equations. Application of some of these techniques to the computation of viscous incompressible flows is presented.

Botella, Olivier↗

Mechanical Testing of IN718 Lattice Block Structures

Lattice block construction produces a flat, structurally rigid panel composed of thin ligaments of material arranged in a three-dimensional triangulated truss-like structure. Low-cost methods of producing cast metallic lattice block panels are now available that greatly expand opportunities for using this unique material system in today's high-performance structures. Additional advances are being made in NASA's Ultra Efficient Engine Technology (UEET) program to extend the lattice block concept to superalloy materials. Advantages offered by this combination include high strength, light weight, high stiffness, and elevated temperature capabilities. Recently under UEET, the nickel-based superalloy Inconel 718 (IN718) was investment cast into lattice block panels with great success. To evaluate casting quality and lattice block architecture merit, individual ligaments, and structural subelement specimens were extracted from the panels. Tensile tests, structural compression, and bending strength tests were performed on these specimens. Fatigue testing was also completed for several bend test specimens. This paper first presents metallurgical and optical microscopy analysis of the castings. This is followed by mechanical test results for the tensile ligament tests and the subelement compression and bending strength tests, as well as for the fatigue tests that were performed. These tests generally showed comparable properties to base IN718 with the same heat treatment, and they underscored the benefits offered by lattice block materials. These benefits might be extended with improved architecture such as face sheets.

Krause, David L.↗

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized discretization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin discretization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobian linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. These variants have been implemented in the "ELF" library for which example calculations will be shown. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Some prevalent limiting strategies will be reviewed. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc. will be addressed as needed.

Barth, Timothy↗

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized demoralization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin demoralization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS, and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobean linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Discrete maximum principle theory will be presented for general finite volume approximations on unstructured meshes. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc, will. be addressed as needed.

Barth, Timothy J.↗

Some Experiences with High Order Discretization Schemes for Compressible Fluid Flow

It is widely recognized that the structure and complexity of compressible fluid flow places high demands on numerical discretization techniques for the fluid flow equations. Fluid flows arising in external aerodynamics often contain both flow field discontinuities and fluid boundary-layers. Both must be accurately resolved to provide useful information to aerodynamic design and analysis engineers. These accuracy requirements motivated the present author to examine a class of finite-volume techniques on arbitrary triangulated domains based on linear or quadratic reconstruction of integral-averaged data followed by upwind flux function evaluation and small time evolution. More recently, we have considered some new upwind techniques which yield compact discretizations while maintaining higher order accuracy. In the mini-symposium talk we will discuss both of these techniques as well as demonstrate the relative merits of each method by computing a number of aerodynamic flows containing shock waves and boundary-layers.

Barth, Timothy J.↗

Minimizing Cache Misses Using Minimum-Surface Bodies

A number of known techniques for improving cache performance in scientific computations involve the reordering of the iteration space. Some of these reorderings can be considered as coverings of the iteration space with the sets having good surface-to-volume ratio. Use of such sets reduces the number of cache misses in computations of local operators having the iteration space as a domain. First, we derive lower bounds which any algorithm must suffer while computing a local operator on a grid. Then we explore coverings of iteration spaces represented by structured and unstructured grids which allow us to approach these lower bounds. For structured grids we introduce a covering by successive minima tiles of the interference lattice of the grid. We show that the covering has low surface-to-volume ratio and present a computer experiment showing actual reduction of the cache misses achieved by using these tiles. For planar unstructured grids we show existence of a covering which reduces the number of cache misses to the level of structured grids. On the other hand, we present a triangulation of a 3-dimensional cube such that any local operator on the corresponding grid has significantly larger number of cache misses than a similar operator on a structured grid.

Frumkin, Michael↗

Triangle Geometry Processing for Surface Modeling and Cartesian Grid Generation

Cartesian mesh generation is accomplished for component based geometries, by intersecting components subject to mesh generation to extract wetted surfaces with a geometry engine using adaptive precision arithmetic in a system which automatically breaks ties with respect to geometric degeneracies. During volume mesh generation, intersected surface triangulations are received to enable mesh generation with cell division of an initially coarse grid. The hexagonal cells are resolved, preserving the ability to directionally divide cells which are locally well aligned.

Aftosmis, Michael J.↗

Practical Aspects of Stabilized FEM Discretizations of Nonlinear Conservation Law Systems with Convex Extension

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the Galerkin least-squares (GLS) and the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the POE system. Central to the development of the simplified GLS and DG methods is the Degenerative Scaling Theorem which characterizes right symmetrizes of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobean matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler, Navier-Stokes, and magnetohydrodynamic (MHD) equations. Linear and nonlinear energy stability is proven for the simplified GLS and DG methods. Spatial convergence properties of the simplified GLS and DO methods are numerical evaluated via the computation of Ringleb flow on a sequence of successively refined triangulations. Finally, we consider a posteriori error estimates for the GLS and DG demoralization assuming error functionals related to the integrated lift and drag of a body. Sample calculations in 20 are shown to validate the theory and implementation.

Barth, Timothy↗

The Overgrid Interface for Computational Simulations on Overset Grids

Computational simulations using overset grids typically involve multiple steps and a variety of software modules. A graphical interface called OVERGRID has been specially designed for such purposes. Data required and created by the different steps include geometry, grids, domain connectivity information and flow solver input parameters. The interface provides a unified environment for the visualization, processing, generation and diagnosis of such data. General modules are available for the manipulation of structured grids and unstructured surface triangulations. Modules more specific for the overset approach include surface curve generators, hyperbolic and algebraic surface grid generators, a hyperbolic volume grid generator, Cartesian box grid generators, and domain connectivity: pre-processing tools. An interface provides automatic selection and viewing of flow solver boundary conditions, and various other flow solver inputs. For problems involving multiple components in relative motion, a module is available to build the component/grid relationships and to prescribe and animate the dynamics of the different components.

Chan, William M.↗

Computing Axisymmetric Jet Screech Tones Using Unstructured Grids

The space-time conservation element and solution element (CE/SE) method is used to solve the conservation law form of the compressible axisymmetric Navier-Stokes equations. The equations are time marched to predict the unsteady flow and the near-field screech tone noise issuing from an underexpanded circular jet. The CE/SE method uses an unstructured grid based data structure. The unstructured grids for these calculations are generated based on the method of Delaunay triangulation. The purpose of this paper is to show that an acoustics solution with a feedback loop can be obtained using truly unstructured grid technology. Numerical results are presented for two different nozzle geometries. The first is considered to have a thin nozzle lip and the second has a thick nozzle lip. Comparisons with available experimental data are shown for flows corresponding to several different jet Mach numbers. Generally good agreement is obtained in terms of flow physics, screech tone frequency, and sound pressure level.

Jorgenson, Philip C. E.↗

MiniAERCam Ranging

Johnson Space Center (JSC) is designing a small, remotely controlled vehicle that will carry two color and one black and white video cameras in space. The device will launch and retrieve from the Space Vehicle and be used for remote viewing. Off the shelf cellular technology is being used as the basis for communication system design. Existing plans include using multiple antennas to make simultaneous estimates of the azimuth of the MiniAERCam from several sites on the Space Station and use triangulation to find the location of the device. Adding range detection capability to each of the nodes on the Space Vehicle would allow an estimate of the location of the MiniAERCam to be made at each Communication And Telemetry Box (CATBox) independent of all the other communication nodes. This project will investigate the techniques used by the Global Positioning System (GPS) to achieve accurate positioning information and adapt those strategies that are appropriate to the design of the CATBox range determination system.

Talley, Tom↗

High Energy Boundary Conditions for a Cartesian Mesh Euler Solver

Inlets and exhaust nozzles are common place in the world of flight. Yet, many aerodynamic simulation packages do not provide a method of modelling such high energy boundaries in the flow field. For the purposes of aerodynamic simulation, inlets and exhausts are often fared over and it is assumed that the flow differences resulting from this assumption are minimal. While this is an adequate assumption for the prediction of lift, the lack of a plume behind the aircraft creates an evacuated base region thus effecting both drag and pitching moment values. In addition, the flow in the base region is often mis-predicted resulting in incorrect base drag. In order to accurately predict these quantities, a method for specifying inlet and exhaust conditions needs to be available in aerodynamic simulation packages. A method for a first approximation of a plume without accounting for chemical reactions is added to the Cartesian mesh based aerodynamic simulation package CART3D. The method consists of 3 steps. In the first step, a components approach where each triangle is assigned a component number is used. Here, a method for marking the inlet or exhaust plane triangles as separate components is discussed. In step two, the flow solver is modified to accept a reference state for the components marked inlet or exhaust. In the third step, the flow solver uses these separated components and the reference state to compute the correct flow condition at that triangle. The present method is implemented in the CART3D package which consists of a set of tools for generating a Cartesian volume mesh from a set of component triangulations. The Euler equations are solved on the resulting unstructured Cartesian mesh. The present methods is implemented in this package and its usefulness is demonstrated with two validation cases. A generic missile body is also presented to show the usefulness of the method on a real world geometry.

Pandya, Shishir↗

Three-Dimensional Morphological Analysis of ALH84001 Magnetite Using Electron Tomography

We report here the crystal morphologies of MV-1 and ALH84001 magnetites as calculated by back-projection using electron tomography. In the present study, we used a 300 keV TEM with a field emission gun (Tecnai F-30 from FEI Inc.), equipped with a 2048 x 2048 pixel CCD camera from Gatan Inc. to image magnetite crystals over tilt ranges of approx. +/- 72 deg in 2 deg tilt intervals. The images were aligned for back-projection, either manually, or through the use of fiducial 5 nm Au spheres affixed to the specimen prior to microscopy. Three-dimensional (3-D) reconstructions were computed using weighted back-projection of the tilted views. The tomograms were viewed and analyzed as a series of slices 1.0 nm thick, taken parallel to the specimen-supporting grid, using the IMOD software package. The shape of each magnetite crystal was determined by defining the external contour of a given magnetite in each slice and assembling a stack of these contours in 3-D. To aid in visualization, the stacked contour array was reduced to an optimal mesh by Delaunay triangulation. The surface normal to each of the triangles in the mesh was calculated and the triangle faces colored according to the orientation of that surface normal relative to the principal crystallographic axis of magnetite. Green surfaces correspond to {111} orientations, blue surfaces to {100} orientations, and red surfaces to {110} orientations. Triangles whose surface normal did not correspond to one of the principal axes were colored gray. Within the experimental and numerical uncertainties of the deconvolution, the tomographic reconstruction of both MV-1 and ALH84001 magnetites are equivalent and correspond to a truncated hexa-octahedral morphology.

Thomas-Keprta, Kathie L.↗

Superalloy Lattice Block Structures

In their simplest form, lattice block panels are produced by direct casting and result in lightweight, fully triangulated truss-like configurations which provide strength and stiffness [2]. The earliest realizations of lattice block were made from A1 and steels, primarily under funding from the US Navy [3]. This work also showed that the mechanical efficiency (eg., specific stiffness) of lattice block structures approached that of honeycomb structures [2]. The lattice architectures are also less anisotropic, and the investment casting route should provide a large advantage in cost and temperature capability over honeycombs which are limited to alloys that can be processed into foils. Based on this early work, a program was initiated to determine the feasibility of extending the high temperature superalloy lattice block [3]. The objective of this effort was to provide an alternative to intermetallics and composites in achieving a lightweight high temperature structure without sacrificing the damage tolerance and moderate cost inherent in superalloys. To establish the feasibility of the superalloy lattice block concept, work was performed in conjunction with JAMCORP, Inc. Billerica, MA, to produce a number of lattice block panels from both IN71 8 and Mar-M247.

Whittenberger, J. D.↗

Development of a Dynamically Configurable, Object-Oriented Framework for Distributed, Multi-modal Computational Aerospace Systems Simulation: Second Year Progress Report

Mesh generation has long been recognized as a bottleneck in the CFD process. While much research on automating the volume mesh generation process have been relatively successful,these methods rely on appropriate initial surface triangulation to work properly. Surface discretization has been one of the least automated steps in computational simulation due to its dependence on implicitly defined CAD surfaces and curves. Differences in CAD peometry engines manifest themselves in discrepancies in their interpretation of the same entities. This lack of "good" geometry causes significant problems for mesh generators, requiring users to "repair" the CAD geometry before mesh generation. The problem is exacerbated when CAD geometry is translated to other forms (e.g., IGES )which do not include important topological and construction information in addition to entity geometry. One technique to avoid these problems is to access the CAD geometry directly from the mesh generating software, rather than through files. By accessing the geometry model (not a discretized version) in its native environment, t h s a proach avoids translation to a format which can deplete the model of topological information. Our approach to enable models developed in the Denali software environment to directly access CAD geometry and functions is through an Application Programming Interface (API) known as CAPRI. CAPRI provides a layer of indirection through which CAD-specific data may be accessed by an application program using CAD-system neutral C and FORTRAN language function calls. CAPRI supports a general set of CAD operations such as truth testing, geometry construction and entity queries.

Afjeh, Abdollah A.↗

Computing Axisymmetric Jet Screech Tones using Unstructured Grids

The purpose of this paper is to show that computations with an aeroacoustic feedback loop, the jet screech noise, can be obtained using truly unstructured grid technology. Numerical results are presented for a nozzle with two different lip thicknesses which will be referred to in this paper as a thin and a thick lip nozzle respectively. The space-time conservation element and solution element (CE/SE) method is used to solve the conservation laws of the compressible axisymmetric Navier-Stokes equations. The equations are time marched to predict the unsteady flow and the near-field screech tone noise issuing from an underexpanded circular jet. The CE/SE method uses an unstructured grid based data structure. The unstructured grids for these calculations are generated based on the method of Delaunay triangulation. Comparisons of numerical results with available experimental data are shown for flows corresponding to several different jet Mach numbers. Generally good agreement is obtained in terms of flow physics, screech tone frequency, and sound pressure level.

Jorgenson, Philip C. E.↗

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Shu, Chi-Wang↗

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↗