Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mesh data structure”

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 343 records · Page 19

Reducing Memory Consumption in Calico with Shared Memory

This document details the work to reduce memory consumption in Calico. Calico is SimTools’ Constructive Solid Geometry (CSG) and geometry painting library. It is primarily used to paint material volume fractions in the Eulerian meshes of the physics codes. Calico provides point-in-body checks for the geometry supplied by an Oso model, which are then aggregated by the host codes. In addition, Calico can be used to build Oso models and is used by Ingen for that purpose. Oso models, and thus Calico, provide support for various CSG primitives such as spheres, cylinders, surfaces generated by rotating tabular curve data, and STL files as well as binary combinations of those primitives. Prior to refactoring Calico will run out of memory on CTS-1 machines when 36 MPI ranks are used per node when reading STL models on the order of 1.5 GB. This limitation is a bottleneck in designer workflow. This problem has been alleviated through the use of data structures to both reduce memory consumption and to leverage MPI-3 shared memory. This report details the data structures targeted for refactoring in Calico, the methods and implementation details for reducing memory consumption and leveraging shared memory, and results for one test problem. Results show a memory reduction when loading a 1 GB STL file by a factor of 27.5, from 93.4 to 3.4 GB.

97 MATHEMATICS AND COMPUTING↗

The Keck keyword layer

Each Keck instrument presents a consistent software view to the user interface programmer. The view consists of a small library of functions, which are identical for all instruments, and a large set of keywords, that vary from instrument to instrument. All knowledge of the underlying task structure is hidden from the application programmer by the keyword layer. Image capture software uses the same function library to collect data for the image header. Because the image capture software and the instrument control software are built on top of the same keyword layer, a given observation can be 'replayed' by extracting keyword-value pairs from the image header and passing them back to the control system. The keyword layer features non-blocking as well as blocking I/O. A non-blocking keyword write operation (such as setting a filter position) specifies a callback to be invoked when the operation is complete. A non-blocking keyword read operation specifies a callback to be invoked whenever the keyword changes state. The keyword-callback style meshes well with the widget-callback style commonly used in X window programs. The first keyword library was built for the two Keck optical instruments. More recently, keyword libraries have been developed for the infrared instruments and for telescope control. Although the underlying mechanisms used for inter-process communication by each of these systems vary widely (Lick MUSIC, Sun RPC, and direct socket I/O, respectively), a basic user interface has been written that can be used with any of these systems. Since the keyword libraries are bound to user interface programs dynamically at run time, only a single set of user interface executables is needed. For example, the same program, 'xshow', can be used to display continuously the telescope's position, the time left in an instrument's exposure, or both values simultaneously. Less generic tools that operate on specific keywords, for example an X display that controls optical instrument exposures, have also been written using the keyword layer.

Conrad, A. R.↗

A linked-scale coupled model of mass erosion and redistribution in plasma-exposed micro-foam surfaces

Surface evolution due to exposure to harsh environments is of importance in many scientific and technological applications. In plasma-exposed materials, the surface receives charged particles from the plasma, leading to a series of processes that drive the system far from equilibrium and may lead to the severe deterioration of the surface properties. Although surface morphological changes are driven by atomic collisions taking place over picoseconds and nanometers, these processes result in mass loss and redistribution of matter over much larger length and time scales. This necessitates a multi-scale approach capable of capturing the range of processes linking primary atomic collision events with engineering-level surface geometry changes. In this paper, we develop a computational model to simulate the morphological evolution and effective erosion rate of micro-architected tungsten foams during low-energy plasma ion bombardment. Furthermore, the model acts on several length scales, with the energy and angular dependence of the sputtering yield of flat tungsten surfaces determined using the SRIM code based on the binary collision approximation. This information is introduced into a low-fluence, short-term Monte Carlo raytracing model, and further into a high-fluence, long-term particle transport model. In the latter, material particles representing billions of atoms are described in a digitized 3-D representation of the foam structure from X-ray tomography data, and are sputtered off and redeposited using the atomistic information. We show that the redeposition of sputtered atoms leads to partial self-healing in the bottom layers with a sharp reduction in the sputtering coefficient of low density foams, roughly 25% of the solid W value. This is in qualitative agreement with recent experiments on low porosity W structures. At high fluence, the foam structure degrades considerably as there are fewer ligaments available to recapture sputtered atoms and, consequently, the sputtering rate increases again.

36 MATERIALS SCIENCE↗

Parallel Processing of Adaptive Meshes with Load Balancing

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often also dynamic in nature in that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of unstructured grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing interprocessor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view of system loads across processors. In this paper, we propose a novel and general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication topology, and compare its performance with a successful global load balancing environment, called PLUM, specifically created to handle adaptive unstructured applications. Our experimental results on an IBM SP2 demonstrate that the SBN-based load balancer achieves lower redistribution costs than that under PLUM by overlapping processing and data migration.

Das, Sajal K.↗

Parametric Structural Model for a Mars Entry Concept

This paper outlines the process of developing a parametric model for a vehicle that can withstand Earth launch and Mars entry conditions. This model allows the user to change a variety of parameters ranging from dimensions and meshing to materials and atmospheric entry angles to perform finite element analysis on the model for the specified load cases. While this work focuses on an aeroshell for Earth launch aboard the Space Launch System (SLS) and Mars entry, the model can be applied to different vehicles and destinations. This specific project derived from the need to deliver large payloads to Mars efficiently, safely, and cheaply. Doing so requires minimizing the structural mass of the body as much as possible. The code developed for this project allows for dozens of cases to be run with the single click of a button. The end result of the parametric model gives the user a sense of how the body reacts under different loading cases so that it can be optimized for its purpose. The data are reported in this paper and can provide engineers with a good understanding of the model and valuable information for improving the design of the vehicle. In addition, conclusions show that the frequency analysis drives the design and suggestions are made to reduce the significance of normal modes in the design.

Lane, Brittney M.↗

Development of a high fidelity model of the CROCUS experimental reactor

Measurements of scalar flux distributions with fine spatial and energy resolutions are needed to remedy one of the validation shortcomings of the novel neutronics full core solvers, such as MPACT and nTRACER. While a very detailed resolution of the flux can be calculated with such codes, only a limited experimental data set is available to check their accuracy. Such type of measurements are on-going at the zero power reactor CROCUS, operated at the Laboratory for Reactor Physics and System Behaviours of the EPFL, thanks to the development of advanced miniature neutron detection systems. This kind of experimental data would provide the community with a suitable benchmark for the validation of high fidelity neutronics solvers. In parallel, a multi-physics solver for steady-state and transient analysis of nuclear reactors, named GeN-Foam, has been developed. Based on the finite-volume OpenFOAM library, GeN-Foam provides us with enough flexibility to analyze non-conventional reactor geometries such as that of CROCUS. While CROCUS heterogeneities cannot be modeled by MPACT and nTRACER for the moment, GeN-Foam offers a unique opportunity to build a high fidelity model which mimics these codes' method to reach sub-pin simulation resolution. This document aims at describing the work achieved to get from the existing GeN-Foam model of the CROCUS reactor based on a structured mesh and using the neutron diffusion, the first high-fidelity model using discrete ordinates method as an approximation to neutron transport and an unstructured mesh for inter lattice water gap description and sub-pin heterogeneous modeling. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The National Grid Project: A system overview

The National Grid Project (NGP) is a comprehensive numerical grid generation software system that is being developed at the National Science Foundation (NSF) Engineering Research Center (ERC) for Computational Field Simulation (CFS) at Mississippi State University (MSU). NGP is supported by a coalition of U.S. industries and federal laboratories. The objective of the NGP is to significantly decrease the amount of time it takes to generate a numerical grid for complex geometries and to increase the quality of these grids to enable computational field simulations for applications in industry. A geometric configuration can be discretized into grids (or meshes) that have two fundamental forms: structured and unstructured. Structured grids are formed by intersecting curvilinear coordinate lines and are composed of quadrilateral (2D) and hexahedral (3D) logically rectangular cells. The connectivity of a structured grid provides for trivial identification of neighboring points by incrementing coordinate indices. Unstructured grids are composed of cells of any shape (commonly triangles, quadrilaterals, tetrahedra and hexahedra), but do not have trivial identification of neighbors by incrementing an index. For unstructured grids, a set of points and an associated connectivity table is generated to define unstructured cell shapes and neighboring points. Hybrid grids are a combination of structured grids and unstructured grids. Chimera (overset) grids are intersecting or overlapping structured grids. The NGP system currently provides a user interface that integrates both 2D and 3D structured and unstructured grid generation, a solid modeling topology data management system, an internal Computer Aided Design (CAD) system based on Non-Uniform Rational B-Splines (NURBS), a journaling language, and a grid/solution visualization system.

Gaither, Adam↗

Air Blast Mesh Sensitivity and Pressure Mapping Study

Nose cone structural and aerodynamic characteristics are essential for intelligent design of aircraft, spacecraft, and ballistic systems. Finite element analysis can be used to help understand the structural integrity and flight characteristics of different nose cones. A mesh sensitivity study was undertaken for a particular nose cone geometry that was used in tests at LANL facilities in order to confirm the integrity of the meshed geometry. A simple cone that best matched closed-form theoretical solutions was modeled, and received good correlation to the theory. Complexity was then added back to the nose cone. Parameters applied to the simple cone were then implemented in the nose cone geometry giving assurance of accuracy after the geometry was changed. Nose cone results averaged 6.3% error for radial displacement when compared with the theoretical. Hoop stress averaged 6.0% error and meridional stress averaged 5.7% error at the finest mesh level. Meshes showed signs of convergence when compared to all three theoretical solutions. Finally, pressure time-history data from LANL computational fluid dynamics simulations was applied to the surface of the final nose cone geometry. The pressure data was interpolated from pressure gauge locations onto nearby meshed elements, which allowed for FEA software to run simulations on the cone with the pressure data as a loading condition. The pressure mapping resulted in the ability to understand the nose cone’s rigid body motion that in turn can inform design of future nose cones.

42 ENGINEERING↗

Cartesian based grid generation/adaptive mesh refinement

Grid adaptation has recently received attention in the computational fluid dynamics (CFD) community as a means to capture the salient features of a flowfield by either moving grid points of a structured or by adding cells in an unstructured manner. An approach based on a background cartesian mesh is investigated from which the geometry is 'cut' out of the mesh. Once the mesh is obtained, a solution on this coarse grid is found, that indicates which cells need to be refined. This process of refining/solving continues until the flow is grid refined in terms of a user specified global parameter (such as drag coefficient etc.). The advantages of this approach are twofold: the generation of the base grid is independent of the topology of the bodies or surfaces around/through which the flow is to be computed, and the resulting grid (in uncut regions) is highly isotropic, so that the truncation error is low. The flow solver (which, along with the grid generation is still under development) uses a completely unstructured data base, and is a finite volume, upwinding scheme. Current and future work will address generating Navier-Stokes suitable grids by using locally aligned and normal face/cell refining. The attached plot shows a simple grid about two turbine blades.

Coirier, William J.↗

Simulating Space Capsule Water Landing with Explicit Finite Element Method

A study of using an explicit nonlinear dynamic finite element code for simulating the water landing of a space capsule was performed. The finite element model contains Lagrangian shell elements for the space capsule and Eulerian solid elements for the water and air. An Arbitrary Lagrangian Eulerian (ALE) solver and a penalty coupling method were used for predicting the fluid and structure interaction forces. The space capsule was first assumed to be rigid, so the numerical results could be correlated with closed form solutions. The water and air meshes were continuously refined until the solution was converged. The converged maximum deceleration predicted is bounded by the classical von Karman and Wagner solutions and is considered to be an adequate solution. The refined water and air meshes were then used in the models for simulating the water landing of a capsule model that has a flexible bottom. For small pitch angle cases, the maximum deceleration from the flexible capsule model was found to be significantly greater than the maximum deceleration obtained from the corresponding rigid model. For large pitch angle cases, the difference between the maximum deceleration of the flexible model and that of its corresponding rigid model is smaller. Test data of Apollo space capsules with a flexible heat shield qualitatively support the findings presented in this paper.

Wang, John T.↗

Fluid-Kinetic Coupling: Advanced Discretizations for Simulations on Emerging Heterogeneous Architectures (LDRD FY20-0643)

Plasma physics simulations are vital for a host of Sandia mission concerns, for fundamental science, and for clean energy in the form of fusion power. Sandia's most mature plasma physics simulation capabilities come in the form of particle-in-cell (PIC) models and magnetohydrodynamics (MHD) models. MHD models for a plasma work well in denser plasma regimes when there is enough material that the plasma approximates a fluid. PIC models, on the other hand, work well in lower-density regimes, in which there is not too much to simulate; error in PIC scales as the square root of the number of particles, making high-accuracy simulations expensive. Real-world applications, however, almost always involve a transition region between the high-density regimes where MHD is appropriate, and the low-density regimes for PIC. In such a transition region, a direct discretization of Vlasov is appropriate. Such discretizations come with their own computational costs, however; the phase-space mesh for Vlasov can involve up to six dimensions (seven if time is included), and to apply appropriate homogeneous boundary conditions in velocity space requires meshing a substantial padding region to ensure that the distribution remains sufficiently close to zero at the velocity boundaries. Moreover, for collisional plasmas, the right-hand side of the Vlasov equation is a collision operator, which is non-local in velocity space, and which may dominate the cost of the Vlasov solver. The present LDRD project endeavors to develop modern, foundational tools for the development of continuum-kinetic Vlasov solvers, using the discontinuous Petrov-Galerkin (DPG) methodology, for discretization of Vlasov, and machine-learning (ML) models to enable efficient evaluation of collision operators. DPG affords several key advantages. First, it has a built-in, robust error indicator, allowing us to adapt the mesh in a very natural way, enabling a coarse velocity-space mesh near the homogeneous boundaries, and a fine mesh where the solution has fine features. Second, it is an inherently high-order, high-intensity method, requiring extra local computations to determine so-called optimal test functions, which makes it particularly suited to modern hardware in which floating-point throughput is increasing at a faster rate than memory bandwidth. Finally, DPG is a residual-minimizing method, which enables high-accuracy computation: in typical cases, the method delivers something very close to the $L^2$ projection of the exact solution. Meanwhile, the ML-based collision model we adopt affords a cost structure that scales as the square root of a standard direct evaluation. Moreover, we design our model to conserve mass, momentum, and energy by construction, and our approach to training is highly flexible, in that it can incorporate not only synthetic data from direct-simulation Monte Carlo (DSMC) codes, but also experimental data. We have developed two DPG formulations for Vlasov-Poisson: a time-marching, backward-Euler discretization and a space-time discretization. We have conducted a number of numerical experiments to verify the approach in a 1D1V setting. In this report, we detail these formulations and experiments. We also summarize some new theoretical results developed as part of this project (published as papers previously): some new analysis of DPG for the convection-reaction problem (of which the Vlasov equation is an instance), a new exponential integrator for DPG, and some numerical exploration of various DPG-based time-marching approaches to the heat equation. As part of this work, we have contributed extensively to the Camellia open-source library; we also describe the new capabilities and their usage. We have also developed a well-documented methodology for single-species collision operators, which we applied to argon and demonstrated with numerical experiments. We summarize those results here, as well as describing at a high level a design extending the methodology to multi-species operators. We have released a new open-source library, MLC, under a BSD license; we include a summary of its capabilities as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

AMReX: Block-structured adaptive mesh refinement for multiphysics applications

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

Zhang, Weiqun↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗

AMR-Wind: A Performance-Portable, High-Fidelity Flow Solver for Wind Farm Simulations

We present AMR-Wind, a verified and validated high-fidelity computational-fluid-dynamics code for wind farm flows. AMR-Wind is a block-structured, adaptive-mesh, incompressible-flow solver that enables predictive simulations of the atmospheric boundary layer and wind plants. It is a highly scalable code designed for parallel high-performance computing with a specific focus on performance portability for current and future computing architectures, including graphical processing units (GPUs). In this paper, we detail the governing equations, the numerical methods, and the turbine models. Establishing a foundation for the correctness of the code, we present the results of formal verification and validation. The verification studies, which include a novel actuator line test case, indicate that AMR-Wind is spatially and temporally second-order accurate. The validation studies demonstrate that the key physics capabilities implemented in the code, including actuator disk models, actuator line models, turbulence models, and large eddy simulation (LES) models for atmospheric boundary layers, perform well in comparison to reference data from established computational tools and theory. We conclude with a demonstration simulation of a 12-turbine wind farm operating in a turbulent atmospheric boundary layer, detailing computational performance and realistic wake interactions.

17 WIND ENERGY↗

A Concept for the Deployment of a Large Lunar Crater Radio Telescope Using Teams of Tethered Robots

Kilometer-scale craters on the far side of the Moon have unique potential as future locations for large radio telescopes, which can observe the universe at wavelengths and frequencies (> 10 m, < 30 MHz) not possible with conventional Earth or orbital-based approaches. Distinct advantages of building a Lunar Crater Radio Telescope (LCRT) on the far side include i) isolation from radio noise due to the Earth’s ionosphere, orbiting satellites, and the Sun, ii) days of uninterrupted dark/cold sky viewing during lunar night, and iii) terrain geometry naturally suited for constructing the largest mesh antenna structure in the Solar System. A key challenge to constructing LCRT on the Moon is related to the complexity of deploying a 1-km diameter antenna and hanging receiver within a lunar crater whose diameter, depth, and slope are 3-5 km, 1 km, and ~30 degrees respectively. In this paper, we first evaluate the trade space for deploying a large, complex structure within a crater, and then provide a more detailed concept evaluation of our favored approach, which employs coordinated teams of tethered rovers to extract and suspend a folded antenna from a lander at the base of a crater. NASA’s Jet Propulsion Laboratory in collaboration with California Institute of Technology (Caltech) have developed a novel robotic system for accessing extremely steep terrains; the Axel rover is a two-wheeled rugged terrain vehicle that is supported by an electro-mechanical tether that provides power, data, and tensile support from a top-side anchor location. Recently, a pair of Axel robots have been used in a DuAxel configuration that allows for four-wheel driving and repeated passive anchoring at different locations. The DuAxel system has unique advantages for deploying an LCRT antenna, including the ability to deploy from a lander near a crater, drive a distance to the crater rim to deploy an Axel, and later, retract the deployed Axel in order to sequentially lift up sections of the antenna. Our proposed concept involves delivering a packaged antenna and receiver to the bottom-center of a crater floor on a lander, then later sending a team of multiple DuAxel rovers to retrieve guide wires from the lander, which are pulled to the top of the crater. We explore this concept in detail and provide some initial quantitative analysis to demonstrate the feasibility of our system with respect to the spatial and mass properties of the antenna as juxtaposed to DuAxel capabilities. Finally, we outline next steps towards validating our concept on the way to a future lunar deployment opportunity.

Hallinan, Greg↗

Effective conductivity of wire mesh reflectors for space deployable antenna systems

This report summarizes efforts to characterize the measurement of conductive mesh and smooth surfaces using proximity measurements for a dielectric resonator. The resonator operates in the HEM11 mode and is shown to have an evanescent field behavior in the vicinity of the sample surface, raising some question to the validity of measurements requiring near normal incidence on the material. In addition, the slow radial field decay outside of the dielectric resonator validates the sensitivity to the planar supporting structure and potential radiation effects. Though these concerns become apparent along with the sensitivity to the gap between the dielectric and the material surface, the basic concept of the material measurement using dielectric resonators has been verified for useful comparison of material surface properties. The properties, particularly loss, may be obtained by monitoring the resonant frequency along with the resonator quality factor (Q), 3 dB bandwidth, or the midband transmission amplitude. Comparison must be made to known materials to extract the desired data.

Davis, William A.↗