Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mesh data”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

MOOSE-Based Fast Reactor Core Bowing Capabilities: Coupled Structural Mechanics – Thermal Fluids Demonstration and Related Verification Efforts

Under the U.S. Department of Energy Office of Nuclear Energy’s Advanced Modeling and Simulation (NEAMS) Program, an integrated multiphysics approach is being developed to model the core bowing phenomena important to liquid metal-cooled fast reactors. Core bowing is an important passive safety mechanism in liquid metal-cooled fast reactors and involves multiphysics effects including radiation transport, fluid flow, heat transfer, and mechanical response to temperature and flux gradients. Verification and assessment efforts continued on the Multiphysics Object Oriented Simulation Environment (MOOSE) capabilities relevant for modeling thermo-mechanical core bowing behavior. IAEA Verification Problem 4, which was started in FY23, was further examined with MOOSE capabilities to rectify discrepancies observed in previous years when compared to IAEA benchmark participant data. Meshing and postprocessing capabilities in MOOSE were also advanced by other teams and utilized this year. A thermal fluids-structural mechanical coupling demonstration has performed on 7-assemblyand 19-assembly fast reactor assembly configurations using MOOSE. Subchannel capabilities are used to calculate coolant temperature, and heat conduction capabilities calculate duct wall temperature as well as heat transfer through the inter-assembly gap. Structural mechanical capabilities then deform the mesh, accounting for contact between assemblies, according to the temperature gradients calculated by the thermal solvers. Power distributions are imposed rather than calculated to demonstrate different deformations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Study of Data-Driven Mesh-Model Optimization in System Thermal-Hydraulic Simulation

Quantification of nuclear power plant safety risk requires a systematic and yet practical approach to identification of accident scenarios, assessment of their likelihood and consequences. Instrumental to this goal is risk-informed safety margin characterization (RISMC) framework, whose realization requires computationally robust and affordable methods for sufficiently accurate simulation of complex multi-dimensional physical phenomena, such as turbulent and multi-phase flow. The CFD-like correlation-based codes with 3D simulation capability (e.g., GOTHIC) ensure computational efficiency using coarse mesh size and the sub-grid phenomena in the boundary layer that can be captured by adequate constitutive correlations. However, the error sources and user effects on the selection of mesh size and models lead to unpredictable simulation error, while rich High-Fidelity (HF) data from experiments and numerical simulation using validated code or DNS are not fully explored. It would be useful to have a “smart” data-driven multi-scale framework in which the low-resolution models can be “taught” to emulate high-resolution models. The objective of this work is to develop and evaluate a physical-based data-driven mesh-model optimization approach (Optimized Mesh/Model Information System, OMIS) to estimate the simulation error and give advice on the optimized selection of coarse mesh size and Low-Fidelity (LF) models for System Thermal Hydraulic (STH) simulation to achieve accuracy comparable to that of HF models. This approach takes advantages of computational efficiency of coarse-mesh simulation and application of Machine Learning (ML) algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Remapping of Data Between One-Dimensional Meshes

In this report we present two approaches to data remapping between one-dimensional meshes implemented with the c++ programming language. Our goal was to test the performance of two search algorithms, linear and binary, and verify the accuracy of our implementations of the two methods. We first introduce the concept of data remap and meshing components, as well as their various uses. We then delve into the differences between point-wise and conservative remap, the algorithms used in the implementations, and lastly confirm the implementations work as intended when given various inputs. We expect that, after profiling, the binary search algorithm will be more efficient than the linear algorithm for sorted sets of data, the point-wise remap implementation to accurately approximate the data transfer between two meshes, and the conservative remap implementation to conserve the area underneath the curve of two distinct meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data Remapping Between One Dimensional Meshes [Slides]

Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Utah FORGE: Data for 3-D Model Development - Lithology, Temperature, Pressure, and Stress

This submission comprises two downloadable .zip archives. Each archive contains spreadsheets with 3-D data and a .txt document describing the data. The Mesh Files .zip download contains data regarding the lithologic contacts of the granitoid and overlying sedimentary basin fill. The Initial Conditions .zip download contains data regarding temperature, pressure, and stress. These data were generated during Utah FORGE Phase 2 and exported from Seequent Leapfrog Geothermal. They are intended for use in 3-D earth modeling.

15 GEOTHERMAL ENERGY↗
DOE OSTI2020

Mesh-Sequenced Realizations for Evaluation of Subgrid-Scale Models for Turbulent Combustion

This paper develops a new approach for analysis of subgrid closures for turbulent combustion as modeled using direct quadrature (finite-rate chemistry) techniques. The approach, termed multiresolution analysis through mesh-sequenced realizations (MRA-MSR), conducts simultaneous, constrained large-eddy simulations on a set of hierarchically coarsened meshes. Furthermore, the availability of underlying fine-mesh (subgrid) data corresponding to coarse-mesh locations allows a clearer assessment of the effects of unresolved fluctuations on apparent reactivity. A key to MRA-MSR is the correlation of eddy structures at coarser mesh levels, which is facilitated by the transfer of filtered fine-mesh velocity information. A seven-mesh MRA-MSR hierarchy using three resolution levels is applied to one of the Sydney bluff-body stabilized methane–hydrogen flames. Analysis of the simultaneously evolved data at different resolution levels reveals several interesting trends. First, at high Damköhler numbers, there is clear evidence of attenuation of apparent reactivity due to the effects of unresolved fluctuations. Secondly, single-point, single-time filtered density functions of a normalized subgrid Damköhler number show a characteristic beta probability density function (PDF) form and display evidence of scale similarity. Interrogation of the MRA-MSR database also shows that the recently-proposed least-squares minimization (LSM) turbulence–chemistry interaction model can account for the observed diminishment in reactivity at high Damköhler numbers but cannot reduce scatter significantly. A new form of the LSM model, which makes use of the normalized subgrid Damköhler number beta PDF distribution, performs slightly better than the original model, illustrating the potential of MRA-MSR both in assessing existing closure concepts and in developing new ones.

42 ENGINEERING↗
DOE OSTI2023

Data Remapping Between One-Dimensional Meshes

In this report, we describe two approaches to the problem of remapping data from a source mesh (on which data is available) onto a target mesh. We consider two separate methods to solve the problem: Pointwise and Conservative remap, and determine why one is more advantageous when considering different physics applications and elements. We utilize C++ functionalities to derive our findings along with the C++ ”Chronos” library for timing measurements of our studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

In Situ Indexing and Query Processing of AMR Data

We have developed the first, holistic, Adaptive Mesh Refinement (AMR) capable, in situ query framework to ensure the tractability of the current- and next-generation AMR simulation analysis on the path to extreme scale. We have addressed key issues pertaining to in situ analysis, memory hierarchy, generalized parallel indexing, index-compression, and real-time access pattern detection. We have published the following research papers in high profile peer reviewed computer science conferences: (a) Parallel In Situ Detection of Connected Components in Adaptive Mesh Refinement Data; (b) AMR-aware In Situ Indexing and Scalable Querying; (c) Pattern-driven dynamic data layout optimization; (d) In situ Storage Layout Optimization for AMR Spatio-temporal Read Accesses; (e) AMRZone: A Runtime AMR Data Sharing Framework for Scientific Applications; (f) Exploring Memory Hierarchy and Network Topology for Runtime AMR Data Sharing Across Scientific Applications.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRSDate not supplied

Synthetic Data Generation for 3D Mesh Prediction and Spatial Reasoning During Multi-Agent Robotic Missions

In-space assembly operations require accurate reasoning over the pose, location, and structural organization of both the autonomous agents and assembly materials. In a full six-degree-of-freedom space, an accurate understanding of the full three-dimensional structure of the object of interest greatly enriches information for pose estimation and collision planning. Current methods of predicting pose estimation require a priori understanding of the shape of the object. Additionally, visual information in the space environment is impacted by variations in contrast and illumination. Using synthetic data allows us to rapidly generate large datasets with in varying environments and lighting conditions.This work details the generation of synthetic data used to explore the use of a region-based convolutional neural networks to detect objects of interest and predict a voxel-based three-dimensional mesh in order to understand their full three-dimensional shape. This mesh provides useful spatial information during in-space assembly operations without requiring either the complexity of maintaining models over the progress of building an object or observations from multiple angles. The generated meshes are then compared to that of ground truth in order to measure its performance.

synthetic data↗
NASA NTRSDate not supplied

Synthetic Data Generation for 3D Mesh Prediction and Spatial Reasoning During Multi-Agent Robotic Missions

In-space assembly operations require accurate reasoning over the pose, location, and structural organization of both the autonomous agents and assembly materials. In a full six-degree-of-freedom space, an accurate understanding of the full three-dimensional structure of the object of interest greatly enriches information for pose estimation and collision planning. Current methods of predicting pose estimation require a priori understanding of the shape of the object. Additionally, visual information in the space environment is impacted by variations in contrast and illumination. Using synthetic data allows us to rapidly generate large datasets with in varying environments and lighting conditions. This work details the generation of synthetic data used to explore the use of a region-based convolutional neural networks to detect objects of interest and predict a voxel-based three-dimensional mesh in order to understand their full three-dimensional shape. This mesh provides useful spatial information during in-space assembly operations without requiring either the complexity of maintaining models over the progress of building an object or observations from multiple angles. The generated meshes are then compared to that of ground truth in order to measure its performance.

James Ecker↗
DOE OSTI2022

Data-driven modeling of coarse mesh turbulence for reactor transient analysis using convolutional recurrent neural networks

Advanced nuclear reactors often exhibit complex thermal-fluid phenomena during transients. To accurately capture such phenomena, a coarse-mesh three-dimensional (3-D) modeling capability is desired for modern nuclear-system code. In the coarse-mesh 3-D modeling of advanced-reactor transients that involve flow and heat transfer, accurately predicting the turbulent viscosity is a challenging task that requires an accurate and computationally efficient model to capture the unresolved fine-scale turbulence. In this work, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor. The model has a coarse mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data to ensure accuracy. A novel neural network architecture, combining a densely connected convolutional network and a long-short-term-memory network, is developed that can efficiently learn from the spatial temporal CFD transient simulation results. The neural network model was trained and optimized on a loss-of flow transient and demonstrated high accuracy in predicting the turbulent viscosity field during the whole transient. The trained model's generalization capability was also investigated on two other transients with different inlet conditions. The study demonstrates the potential of applying the proposed data-driven approach to support the coarse-mesh multi-dimensional modeling of advanced reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

QuadConv: Quadrature-based convolutions with applications to non-uniform PDE data compression

We present a new convolution layer for deep learning architectures which we call QuadConv — an approximation to continuous convolution via quadrature. Our operator is developed explicitly for use on non-uniform, mesh-based data, and accomplishes this by learning a continuous kernel that can be sampled at arbitrary locations. Moreover, the construction of our operator admits an efficient implementation which we detail and construct. As an experimental validation of our operator, we consider the task of compressing partial differential equation (PDE) simulation data from fixed meshes. Here, we show that QuadConv can match the performance of standard discrete convolutions on uniform grid data by comparing a QuadConv autoencoder (QCAE) to a standard convolutional autoencoder (CAE). Further, we show that the QCAE can maintain this accuracy even on non-uniform data. In both cases, QuadConv also outperforms alternative unstructured convolution methods such as graph convolution.

Compression↗
NASA NTRS2016

Addressing the Big-Earth-Data Variety Challenge with the Hierarchical Triangular Mesh

We have implemented an updated Hierarchical Triangular Mesh (HTM) as the basis for a unified data model and an indexing scheme for geoscience data to address the variety challenge of Big Earth Data. We observe that, in the absence of variety, the volume challenge of Big Data is relatively easily addressable with parallel processing. The more important challenge in achieving optimal value with a Big Data solution for Earth Science (ES) data analysis, however, is being able to achieve good scalability with variety. With HTM unifying at least the three popular data models, i.e. Grid, Swath, and Point, used by current ES data products, data preparation time for integrative analysis of diverse datasets can be drastically reduced and better variety scaling can be achieved. In addition, since HTM is also an indexing scheme, when it is used to index all ES datasets, data placement alignment (or co-location) on the shared nothing architecture, which most Big Data systems are based on, is guaranteed and better performance is ensured. Moreover, our updated HTM encoding turns most geospatial set operations into integer interval operations, gaining further performance advantages.

SciDB↗
NASA NTRS1991

Numerical aspects of computing high Reynolds number flows on unstructured meshes

An edge-data structure describing a mesh edge-wise given the vertices of each edge and neighboring cell information is used developing algorithms for the Navier-Stokes equations on triangular meshes. Edge formulas for the Galerkin and finite-element discretization of gradient, divergence, Hessian, and Laplacian operators are derived. A simple edge formula is derived for the discretization of the Laplacian operator, where precise theoretical conditions for a discrete maximum principle can be ascertained. Practical issues associated with solving the Navier-Stokes equations on unstructured meshes are addressed, along with issues concerning the generation of highly stretched triangular meshes and the modeling of turbulence on unstructured meshes. A turbulence modeling strategy is proposed, and numerical results for a high-Reynolds-number flow about single- and multielement airfoils are discussed.

Barth, Timothy J.↗
NASA NTRS1997

Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations

Mesh adaption is a powerful tool for efficient unstructured- grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads with a global view. This paper presents, for the first time, the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. Previous results indicated that mesh repartitioning and data remapping are potential bottlenecks for performing large-scale scientific calculations. We resolve these issues and demonstrate that our framework remains viable on a large number of processors.

Oliker, Leonid↗