Search NASA⌕ Search

SEARCH · Search NASA

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 145 records · Page 8

SIRIUS: Enabling Progressive Data Exploration for Extreme-Scale Scientific Data

Scientific simulations on high performance computing (HPC) platforms generate large quantities of data. To bridge the widening gap between compute and I/O, and enable data to be more efficiently stored and analyzed, simulation outputs need to be refactored, reduced, and appropriately mapped to storage tiers. However, a systematic solution to support these steps has been lacking in the current HPC software ecosystem. To that end, this paper develops SIRIUS, a progressive JPEG-like data management scheme for storing and analyzing big scientific data. It co-designs data decimation, compression, and data storage, taking the hardware characteristics of each storage tier into considerations. With reasonably low overhead, our approach refactors simulation data, using either topological or uniform decimation, into a much smaller, reduced-accuracy base dataset, and a series of deltas that is used to augment the accuracy if needed. The base dataset and deltas are compressed and written to multiple storage tiers. Data saved on different tiers can then be selectively retrieved to restore the level of accuracy that satisfies data analytics. Thus, SIRIUS provides a paradigm shift towards elastic data analytics and enables end users to make trade-offs between analysis speed and accuracy on-the-fly. This paper further develops algorithms to preserve statistics for data decimation, a common requirement for reducing data. Here, we assess the impact of SIRIUS on unstructured triangular meshes, a pervasive data model used in scientific simulations. In particular, we evaluate two realistic use cases: the blob detection in fusion and high-pressure area extraction in computational fluid dynamics.

97 MATHEMATICS AND COMPUTING↗

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Meshes↗

Medium-Scale Methanol Pool Fire Model Validation

In this work, medium scale (30 cm diameter) methanol pool fires were simulated using the latest fire modeling suite implemented in Sierra/Fuego, a low Mach number multiphysics reacting flow code. The sensitivity of model outputs to various model parameters was studied with the objective of providing model validation. This work also assesses model performance relative to other recently published large eddy simulations (LES) of the same validation case. Two pool surface boundary conditions were simulated. The first was a prescribed fuel mass flux and the second used an algorithm to predict mass flux based on a mass and energy balance at the fuel surface. Gray gas radiation model parameters (absorption coefficients and gas radiation sources) were varied to assess radiant heat losses to the surroundings and pool surface. The radiation model was calibrated by comparing the simulated radiant fraction of the plume to experimental data. The effects of mesh resolution were also quantified starting with a grid resolution representative of engineering type fire calculations and then uniformly refining that mesh in the plume region. Simulation data were compared to experimental data collected at the University of Waterloo and the National Institute of Standards and Technology (NIST). Validation data included plume temperature, radial and axial velocities, velocity temperature turbulent correlations, velocity velocity turbulent correlations, radiant and convective heat fluxes to the pool surface, and plume radiant fraction. Additional analyses were performed in the pool boundary layer to assess simulated flame anchoring and the effect on convective heat fluxes. This work assesses the capability of the latest Fuego physics and chemistry model suite and provides additional insight into pool fire modeling for nonluminous, non-sooting flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗

Energy Optimization of Light and Heavy-Duty Vehicle Cohorts of Mixed Connectivity, Automation and Propulsion System Capabilities via Meshed V2V-V2I and Expanded Data Sharing (Final Scientific and Technical Report)

Vehicle connectivity and automated driving technologies individually have the potential to decrease energy consumption and/or increase safety on light, medium or heavy duty vehicles to varying degrees depending on the traffic infrastructure and specific driving scenarios. Due to advances in sensing, perception and computing power, research and development emphasis in the mobility sector has shifted away from connectivity. Prior research has shown that driving automation with the absence of connectivity can in certain circumstances increase energy consumption. The effectiveness of synergizing connectivity and driving automation technologies is the focus of this work, specifically applied to vehicle cohorts of mixed composition, light and heavy duty, and powertrains ranging from all electric to conventional internal combustion engine. The project team is led by Michigan Technological University (MTU) and partnered with AVL Mobility Technologies Inc. (AVL), Borg Warner (BW), Traffic Technology Services (TTS), American Center for Mobility (ACM) and Navistar (NAV). The main thrusts for the team are to develop a micro-traffic simulation environment with specific VD&PT system attributes and CAV capabilities, 2) field a vehicle test fleet of mixed classification, propulsion and CAV capacity, 3) develop artificial intelligence (AI) and machine learning (ML) based multi-agent optimization methods for various traffic infrastructures, 4) integrate the virtual environment and the optimization methods then deploy the system as a CAV hardware in the loop (HiL) for the vehicle test fleet and 5) conduct closed track and public road testing to validate simulation and demonstrated energy and mobility improvements at multiple scales. For a cohort of mixed vehicles, the team will demonstrate a reduction of energy consumption of 10-50% at intersection, arterial roadway and limited access highway scenarios through connectivity and automation in simulation and at a closed test track. The energy reduction objectives of the project are summarized in Table 1, indicating the infrastructure and over what distances are relevant considered. Single scenario energy reductions are not relevant and thus, the research team took the approach to vary parameters associated with the infrastructure, vehicle cohort composition and dynamic behavior to generate energy consumption distributions for both unconnected and connected scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Solution-Adaptive Program for Computing 2D/Axi Viscous Flow

A computer program solves the Navier- Stokes equations governing the flow of a viscous, compressible fluid in an axisymmetric or two-dimensional (2D) setting. To obtain solutions more accurate than those generated by prior such programs that utilize regular and/or fixed computational meshes, this program utilizes unstructured (that is, irregular triangular) computational meshes that are automatically adapted to solutions. The adaptation can refine to regions of high change in gradient or can be driven by a novel residual minimization technique. Starting from an initial mesh and a corresponding data structure, the adaptation of the mesh is controlled by use of minimization functional. Other improvements over prior such programs include the following: (1) Boundary conditions are imposed weakly; that is, following initial specification of solution values at boundary nodes, these values are relaxed in time by means of the same formulations as those used for interior nodes. (2) Eigenvalues are limited in order to suppress expansion shocks. (3) An upwind fluctuation-splitting distribution scheme applied to inviscid flux requires fewer operations and produces less artificial dissipation than does a finite-volume scheme, leading to greater accuracy of solutions.

Wood, William A.↗

Metamesh, Version 1.0

Metamesh is a general-purpose C++ language library for creating data structures that represent meshes. An important difference between Metamesh and other "mesh" libraries is that Metamesh does not provide a specific mesh format, in the usual sense, or tools or a GUI by which users build specific meshes. Rather, it provides a mechanism by which mesh formats themselves can be built, based on their constituent parts and the relationships between them.Consider that a mesh in up to three space dimensions can, in principle, contain nodes (0d entities, or points), edges (1d entities), faces (2d entities), and cells (3d, or volumetric, entities). A node might be defined in terms of (x), (x,y), or (x,y,z) in Cartesian coordinates; or perhaps something else, in a different coordinate system. An edge is typically defined from two nodes; say, "edge E goes from node A=(ax,ay) to node B=(bx,by)." Faces can reasonably be defined in terms of nodes or edges, and cells in terms of nodes, edges, or faces. Note also that someone might wish to support general faces or cells, or only specific variants - say, triangular faces and tetrahedral cells, or quadrilateral faces and hexahedral cells. Or, perhaps, both triangular and quadrilateral faces (but no others), with prisms for each cell. Consider also that a mesh can have the same or a lesser dimension than that of its enclosing space. In 3d, for example, one could have a full 3d mesh, a 2d "sheet" mesh with no cells, a 1d "parametrized curve" with neither faces nor cells, or even a 1d "point cloud." And, in addition to defining a mesh scheme, a user might wish to place additional data onto one or more mesh entities. Imagine, for example, a velocity at each node, a flux across each edge or face, and a mass or average density per cell. Metamesh supports all of this, through the use of C++ class and function templates, and template metaprogramming techniques. Programmers begin with constructs that Metamesh provides (or, users can define their own), and assemble them in particular ways in order to create particular mesh formats. Metamesh then provides functionality automatically to meshes that are constructed in this manner. Finally, Metamesh provides very general functions for spinning, extruding, visualizing, and performing input/output of whatever meshes a user builds with it.

Staley, Martin↗

Facilitating Staging-based Unstructured Mesh Processing to Support Hybrid In-Situ Workflows

In-situ and in-transit processing alleviate the gap between the computing and I/O capabilities by scheduling data analytics close to the data source. Hybrid in-situ processing splits data analytics into two stages: the data processing that runs in-situ aims to extract regions of interest, which are then transferred to staging services for further in-transit analytics. To facilitate this type of hybrid in-situ processing, the data staging service needs to support complex intermediate data representations generated/consumed by the in-situ tasks. Unstructured (or irregular) mesh is one such derived data representation that is typically used and bridges simulation data and analytics. However, how staging services efficiently support unstructured mesh transfer and processing remains to be explored. This paper investigates design options for transferring and processing unstructured mesh data using staging services. Using polygonal mesh data as an example, we show that hybrid in-situ workflows with staging-based unstructured mesh processing can effectively support hybrid in-situ workflows, and can significantly decrease data movement overheads.

data-driven↗

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗

304L Can Crush Validation Studies

Accurate prediction of ductile behavior of structural alloys up to and including failure is essential in component or system failure assessment, which is necessary for nuclear weapons alteration and life extensions programs of Sandia National Laboratories. Modeling such behavior requires computational capabilities to robustly capture strong nonlinearities (geometric and material), rate- dependent and temperature-dependent properties, and ductile failure mechanisms. This study's objective is to validate numerical simulations of a high-deformation crush of a stainless steel can. The process consists of identifying a suitable can geometry and loading conditions, conducting the laboratory testing, developing a high-quality Sierra/SM simulation, and then drawing comparisons between model and measurement to assess the fitness of the simulation in regards to material model (plasticity), finite element model construction, and failure model. Following previous material model calibration, a J 2 plasticity model with a microstructural BCJ failure model is employed to model the test specimen made of 304L stainless steel. Simulated results are verified and validated through mesh and mass-scaling convergence studies, parameter sensitivity studies, and a comparison to experimental data. The converged mesh and degree of mass-scaling are the mesh discretization with 140,372 elements, and a mass scaling with a target time increment of 1.0e-6 seconds and time step scale factor of 0.5, respectively. Results from the coupled thermal-mechanical explicit dynamic analysis are comparable to the experimental data. Simulated global force vs displacement (F/D) response predicts key points such as yield, ultimate, and kinks of the experimental F/D response. Furthermore, the final deformed shape of the can and field data predicted from the analysis are similar to that of the deformed can, as measured by 3D optical CMM scans and DIC data from the experiment.

36 MATERIALS SCIENCE↗

Permeability of Single–Layer–Free–Standing Meshes at Varying Capillary Pressure via a Novel Method

The permeability of mesh wicks is important for various applications, including two–phase heat transfer. However, the understanding of the permeability of single–layer, free–standing mesh wicks, with liquid–gas interfaces on both sides, is limited. A novel and simpler method is presented to determine the permeability of a free–standing wick and apply it to a representative mesh. This method involves modifying the capillary pressure via elevation and simultaneously measuring the permeability to determine the permeability–capillary pressure relationship. When applied to a copper mesh with plain weave having undergone surface cleaning, the permeability is found to decrease as capillary pressure for deionized water increases. A dimensional analysis is presented to generalize this data for other mesh sizes with similar weaves and fluids. The behavior of mesh in application is modeled, based on the integration of Darcy's law with an analytic function fit to measured data, and parametric studies are conducted to investigate the superficial velocity of liquids through the mesh under varying driving pressures, transport lengths, and liquid viscosity, based on the obtained capillary pressure–permeability relationship. This study provides valuable insights into the transport properties of mesh wicks, with potential applications in fields such as electronics cooling, electrochemical devices, and fluid purification technologies.

36 MATERIALS SCIENCE↗

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

Nonconforming Mesh Refinement for High-Order Finite Elements

In this study, we propose a general algorithm for nonconforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on $h$-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral, and prismatic meshes of arbitrarily high-order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotropic refinement of tensor product elements in two and three dimensions and support unlimited refinement ratios of adjacent elements. We report numerical experiments verifying the correctness of the algorithms and perform a parallel scaling study to show that we can adapt meshes containing billions of elements and run efficiently on 393,000 parallel tasks. Finally, we illustrate the integration of dynamic AMR into a high-order Lagrangian hydrodynamics solver.

97 MATHEMATICS AND COMPUTING↗

Watershed Workflow: A toolset for parameterizing data-intensive, integrated hydrologic models

Integrated, distributed hydrologic models leverage advances in computational power and data accessibility to improve predictive understanding of the water cycle. While impressive advances in this area of environmental modeling have been accomplished, such models are still rarely used, partially because of difficulty integrating model and data. This research describes the release of Watershed Workflow version 1.2, a new library aiming to automate and enable complex workflows defining inputs to high resolution, integrated, distributed hydrologic models. Watershed Workflow provides tools enabling the discovery, acquisition, mapping, and coordination of watershed geometry, land cover, soil properties, and meteorological data. It enables the construction of unstructured meshes that incorporate this data, and provides tools for automating a “first” simulation on any watershed in the United States. We present the design of the workflow tool, and describe best practices for its usage, culminating in a final example from watershed specification to simulation at the Coweeta Hydrologic Laboratory.

Integrated hydrologic modeling↗

Influential Factors for Liquid Acquisition Device Screen Selection for Cryogenic Propulsion Systems

This paper presents the influential factors which govern screen selection for liquid acquisition devices (LADs) operating in microgravity conditions for future in-space cryogenic propulsion engines and cryogenic propellant depots. Space flight requirements, which include mass flow rate, acceleration level and direction, and thermal environment, dictate screen selection for a particular mission. The five influential factors include bubble point pressure, flow-through-screen pressure drop, wicking rate, screen compliance, and material compatibility. Governing equations and analytical models for these parameters are developed from first principles. A comprehensive survey of the historical data on coarser LAD meshes over four decades of work is conducted, and liquid hydrogen data for finer Dutch Twill meshes (325 x 2300, 450 x 2750, 510 x 3600) from recently concluded experiments is also presented to validate analytical models. Each of these parameters is measurable from ground based tests, making it facile to predict flight system performance. Therefore analytical models in this paper will be valuable for future LAD designs for both cryogenic and storable propulsion systems. Additionally, analysis will be given on the impact of the factors on liquid hydrogen systems.

Fuel Depot↗

Target Formulation and Construction in Mesh Quality Improvement

In the Target-matrix Optimization Paradigm (TMOP), it’s long been understood that one must create a set of target matrices before the mesh can be optimized. But there is still no general method to create correct, effective targets in response to a specific mesh quality improvement goal. The TMOP literature describes how certain sets of target matrices can be used to control the shape or size of mesh elements, but those examples address only a fraction of the problems that can occur in mesh quality improvement and were not derived from a general framework for target matrix construction. In this work, a general method of target construction is introduced based on an independent set of geometric parameters which are intrinsic to the Jacobian matrices upon which TMOP is based. The parameters enable a systematic approach to target definition and construction. The approach entails two parts. The first part defines correspondences between available raw data (stuff about the mesh and/or the physical solution) and intermediate data (e.g., a field of error estimates). Once the correspondences are established, the raw data is processed into intermediate field data existing on mesh sample points. The second part is to create a model that represents the values of the geometric target parameters as functions of the intermediate data. The model is then tested numerically to establish model constants and effectiveness. This systematic approach to target construction is illustrated in a set of examples to show how it can be applied to common problems in mesh optimization such as equidistribution of geometric properties, preservation of existing good quality, and adaptation of the mesh to the solution. The result is a systematic method of target construction for TMOP which can be applied to a wide variety of planar and volume mesh quality improvement tasks.

97 MATHEMATICS AND COMPUTING↗

Numerical Differentiation for Adaptively Refined Finite Element Meshes

Postprocessing of point-wise data is a fundamental process in many fields of research. Numerical differentiation is a key operation in computational electromagnetics. In the case of data obtained from a finite element method with automatic mesh refinement much work needs still to be done. This paper addresses some issues in differentiating data obtained from a finite element electromagnetic code with adaptive mesh refinement, and it proposes a methodology for deriving the electric field given the magnetic field on a mesh of linear triangular elements. The procedure itself is nevertheless more general and might be extended for numerically differentiating any point-wise solution based on triangular meshes.

Borgioli, Andrea↗