Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mesh”

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

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A paraboloid fitting technique for calculating curvature from piecewise-linear interface reconstructions on 3D unstructured meshes

In this work, we present a novel method for calculating interface curvature on 3D unstructured meshes from piecewise-linear interface reconstructions typically generated in the volume of fluid method. Interface curvature is a necessary quantity to calculate in order to model surface tension driven flow. Curvature needs only to be computed in cells containing an interface. The approach requires a stencil containing only neighbors sharing a node with a target cell, and calculates curvature from a least-squares paraboloid fit to the interface reconstructions. This involves solving a 6 × 6 symmetric linear system in each mixed cell. We present verification tests where we calculate the curvature of a sphere, an ellipsoid, and a sinusoid in a 3D domain on regular Cartesian meshes, distorted hex meshes, and tetrahedral meshes. Lastly, for both regular and unstructured meshes, we find in all cases the paraboloid fitting method for curvature to converge between first and second order with grid refinement.

97 MATHEMATICS AND COMPUTING↗

An unstructured-mesh finite-volume MPDATA for compressible atmospheric dynamics

An advancement of the unstructured-mesh finite-volume MPDATA (Multidimensional Positive Definite Advection Transport Algorithm) is presented that formulates the error-compensative pseudo-velocity of the scheme to rely only on face-normal advective fluxes to the dual cells, in contrast to the full vector employed in previous implementations. This is essentially achieved by expressing the temporal truncation error underlying the pseudo-velocity in a form consistent with the flux-divergence of the governing conservation law. The development is especially important for integrating fluid dynamics equations on non-rectilinear meshes whenever face-normal advective mass fluxes are employed for transport compatible with mass continuity—the latter being essential for flux-form schemes. In particular, the proposed formulation enables large-time-step semi-implicit finite-volume integration of the compressible Euler equations using MPDATA on arbitrary hybrid computational meshes. Furthermore, it facilitates multiple error-compensative iterations of the finite-volume MPDATA and improved overall accuracy. The advancement combines straightforwardly with earlier developments, such as the nonoscillatory option, the infinite-gauge variant, and moving curvilinear meshes. A comprehensive description of the scheme is provided for a hybrid horizontally-unstructured vertically-structured computational mesh for efficient global atmospheric flow modelling. The proposed finite-volume MPDATA is verified using selected 3D global atmospheric benchmark simulations, representative of hydrostatic and non-hydrostatic flow regimes. Besides the added capabilities, the scheme retains fully the efficacy of established finite-volume MPDATA formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resolution of the Gross-Pitaevskii equation with the imaginary-time method on a Lagrange mesh

The Lagrange-mesh method is an approximate variational calculation which has the simplicity of a mesh calculation. Combined with the imaginary-time method, it is applied to the iterative resolution of the Gross-Pitaevskii equation. Two variants of a fourth-order factorization of the exponential of the Hamiltonian and two types of mesh (Lagrange-Hermite and Lagrange-sinc) are employed and compared. The accuracy is checked with the help of these comparisons and of the virial theorem. The Lagrange-Hermite mesh provides very accurate results with short computing times for values of the dimensionless parameter of the nonlinear term up to 10{sup 4}. For higher values up to 10{sup 7}, the Lagrange-sinc mesh is more efficient. Examples are given for anisotropic and nonseparable trapping potentials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resident Block-Structured Adaptive Mesh Refinement on Thousands of Graphics Processing Units, In: 2015 44th International Conference on Parallel Processing

Block-structured adaptive mesh refinement (AMR) is a technique that can be used when solving partial differential equations to reduce the number of cells necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a resident GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an 8 node cluster, and 4,196 nodes of Oak Ridge National Laboratory's Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and is scalable on 4,196 K20x GPUs using a combination of MPI and CUDA.

Computer Science↗

Multiphysics modeling of mesh piezoelectric atomizers

An ultrasonic clothes dryer was developed by researchers at Oak Ridge National Laboratory based on a novel approach of using high-frequency mechanical vibration instead of heat to extract moisture as a cold mist. This technology is based on direct mechanical coupling between mesh piezoelectric (PZT) transducers and wet fabric. The vibration introduces sufficient momentum to the droplets trapped in the fabric pores to atomize them and leave the garment in a cold state. In the vibrating transducer, deformation followed by the effects of boundary layer acoustic streaming results in ejection of the atomized droplets. The research presented bridges the vibration of a PZT mesh transducer to the induced acoustic field and to capillary-wave theory. Mathematical modeling studies free and forced vibrations of a mesh-like PZT structure, using the structural parameters identified by actuation testing in several case studies. Computational fluid–structure interaction modeling is performed to couple the vibrations of a PZT transducer with an in-contact droplet. The results obtained are used to investigate (1) the transverse deformation of the vibrating mesh transducer in contact with a droplet, (2) the resultant boundary layer acoustic streaming in the fluid surrounding the vibrating surface, and (3) the droplet deformation and fluid ejection. The physics of atomization are linked to the level of the near-wall droplet vibrations induced by the surface deformation of the transducer. Then the surface deformation is linked to the properties of the PZT mesh transducer and input actuation frequency and power.

Dupuis, Eric↗

SU-E-CAMPUS-I-02: Estimation of the Dosimetric Error Caused by the Voxelization of Hybrid Computational Phantoms Using Triangle Mesh-Based Monte Carlo Transport

Purpose: Computational voxel phantom provides realistic anatomy but the voxel structure may result in dosimetric error compared to real anatomy composed of perfect surface. We analyzed the dosimetric error caused from the voxel structure in hybrid computational phantoms by comparing the voxel-based doses at different resolutions with triangle mesh-based doses. Methods: We incorporated the existing adult male UF/NCI hybrid phantom in mesh format into a Monte Carlo transport code, penMesh that supports triangle meshes. We calculated energy deposition to selected organs of interest for parallel photon beams with three mono energies (0.1, 1, and 10 MeV) in antero-posterior geometry. We also calculated organ energy deposition using three voxel phantoms with different voxel resolutions (1, 5, and 10 mm) using MCNPX2.7. Results: Comparison of organ energy deposition between the two methods showed that agreement overall improved for higher voxel resolution, but for many organs the differences were small. Difference in the energy deposition for 1 MeV, for example, decreased from 11.5% to 1.7% in muscle but only from 0.6% to 0.3% in liver as voxel resolution increased from 10 mm to 1 mm. The differences were smaller at higher energies. The number of photon histories processed per second in voxels were 6.4×10{sup 4}, 3.3×10{sup 4}, and 1.3×10{sup 4}, for 10, 5, and 1 mm resolutions at 10 MeV, respectively, while meshes ran at 4.0×10{sup 4} histories/sec. Conclusion: The combination of hybrid mesh phantom and penMesh was proved to be accurate and of similar speed compared to the voxel phantom and MCNPX. The lowest voxel resolution caused a maximum dosimetric error of 12.6% at 0.1 MeV and 6.8% at 10 MeV but the error was insignificant in some organs. We will apply the tool to calculate dose to very thin layer tissues (e.g., radiosensitive layer in gastro intestines) which cannot be modeled by voxel phantoms.

60 APPLIED LIFE SCIENCES↗

Modifiable Array Data Structures for Mesh Topology

Topological data structures are useful in many areas, including the various mesh data structures used in finite element and finite volume applications. Here, we present a mesh data structure which is both flexible enough to support general mesh adaptivity and is compactly stored in a few large arrays. This structure can efficiently store full topological information for meshes with mixed element types. It allows both constant-time adjacency queries and constant-time addition and removal of mesh entities. We compare this structure to similar structures for finite elements and graphics and present its performance for adjacency queries. We also present its use in adaptive simulation applications.

97 MATHEMATICS AND COMPUTING↗

Tomo2Mesh: Fast Reconstruction and Visualization of Tomography Data in Mesh Format

Tomo2Mesh is an open-source project targeted towards real-time reconstruction, segmentation, and visualization of computed tomography (CT) data in mesh format. The CT reconstruction scheme is based on filtered back-projection of voxel subsets. The segmentation scheme uses a 3D convolutional neural network. To allow for fast, real-time reconstruction, voxel subsets are first identified by coarse reconstruction. The detail in specific regions of interest is improved through full reconstruction of voxel subsets in that region. Data structures are implemented to store and process voxel subsets. Finally, voxel data is labeled using connected components to detect disconnected regions such as voids whose morphological attributes (e.g., Feret diameter, principal axis orientation, local number density, size, etc.) can be measured also in real-time. Finally, a fast marching cubes implementation processes labeled voxel data into a triangular face mesh (vertices and faces) in .ply format for visualization in Paraview or other mesh visualization tools. The code provides a simple programming interface for detecting, classifying, and visualizing regions of interest based on morphology. For example, detected voids can be classified as round pores or extended cracks. Highly porous neighborhoods can be identified based on local number density. The mesh texture (or color) is assigned based these morphological attributes to allow smart visualization scenarios in real-time (e.g., show only long cracks). At the time of first release (July 2022), extraction of face mesh for visualization for raw CT data from a 2 megapixel camera would take between 1-5 minutes for most scenarios.

TEKAWADE, ANIKET↗

Mesh Computing Remote Automatic Workflow

The software suite uses a microservice architecture using Docker and `docker-compose`. The microservices are as follows: 1. User interface. This interface is written in JavaScript using the Svelte framework. It exposes form elements and a 3D visualizer to prompt the user through the definition of microstructure parameters, and setting parameters for mesh generation and refinement. 2. Mesh generator. This is a container running the Python package for DREAM3D to generate a voxelized mesh that represents a microstructure defined by the user in the interface. 3. Cubit runner. This is a secure shell protocol tool that makes the submitting the DREAM mesh to an HPC instance and starts to run Cubit shell commands to smooth the grain boundaries with its `sculpt` library, applies user-defined boundary node sets, and bundles and returns the simulation-ready meshes and input files as a zipped directory.

Harris, BrennanKay↗

Verification of Unstructured Mesh Capabilities in MCNP6 for Reactor Physics Problems

New unstructured mesh capabilities in MCNP6 (developmental version during summer 2012) show potential for conducting multi-physics analyses by coupling MCNP to a finite element solver such as Abaqus/CAE. Before these new capabilities can be utilized, the ability of MCNP to accurately estimate eigenvalues and pin powers using an unstructured mesh must first be verified. Previous work to verify the unstructured mesh capabilities in MCNP was accomplished using the Godiva sphere, and this work attempts to build on that. To accomplish this, a criticality benchmark and a fuel assembly benchmark were used for calculations in MCNP using both the Constructive Solid Geometry (CSG) native to MCNP and the unstructured mesh geometry generated using Abaqus/CAE. The Big Ten criticality benchmark was modeled due to its geometry being similar to that of a reactor fuel pin. The C5G7 3-D Mixed Oxide (MOX) Fuel Assembly Benchmark was modeled to test the unstructured mesh capabilities on a reactor-type problem.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Mesh Convergence Issues

(U) This document is written to describe issues that impact on the ability of codes to converge to a unique answer. Several issues that could be discussed in the area of mesh convergence and resolution the topics include the resolution of geometry, stress gradients, shock propagation, material softening, and localization of deformation. After a quick discussion of what mesh convergence means, this paper presents a review of some of the criteria for mesh convergence. With an introductory level understanding of these criteria, two problems are presented to demonstrate convergence and non-­convergence. The first example is a simple convergent hemisphere of gas, known as the Noh problem. With this problem convergence is shown. The Noh problem is also used to investigate the impact of mesh stiffening, or viscosity. The second problem is that of an explosively driven hemisphere. The hemisphere made of U6Nb with an inner radius of 40 mm and an outer radius of 41 mm was filled with PBX9501 and tested. Test results included surface temperature and information on the breakup, such as distribution of fines. Convergence computational methods are discussed along with some proposals for obtaining mesh convergence for a wide range of applications.

36 MATERIALS SCIENCE↗

SHARP/PRONGHORN Interoperability: Mesh Generation

Progress toward collaboration between the SHARP and MOOSE computational frameworks has been demonstrated through sharing of mesh generation and ensuring mesh compatibility of both tools with MeshKit. MeshKit was used to build a three-dimensional, full-core very high temperature reactor (VHTR) reactor geometry with 120-degree symmetry, which was used to solve a neutron diffusion critical eigenvalue problem in PRONGHORN. PRONGHORN is an application of MOOSE that is capable of solving coupled neutron diffusion, heat conduction, and homogenized flow problems. The results were compared to a solution found on a 120-degree, reflected, three-dimensional VHTR mesh geometry generated by PRONGHORN. The ability to exchange compatible mesh geometries between the two codes is instrumental for future collaboration and interoperability. The results were found to be in good agreement between the two meshes, thus demonstrating the compatibility of the SHARP and MOOSE frameworks. This outcome makes future collaboration possible.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Mesh Copy/Move/Merge Tool for Reactor Simulation Applications

Reactor core simulations require the construction and mesh generation for core models consisting of lattices of fuel and other rods grouped into assemblies, and lattices of assemblies of several types grouped into a core model. A set of tools has been described for generating assembly and core lattice models. Both rectangular and hexagonal lattices are supported. The tools operate in three stages. First, assembly models of various types can be generated by the AssyGen tool, based on input describing the content of unit cells, the arrangement of unit cells in the lattice, and the extent of the lattice and any surrounding material. After generating the assembly model, the model is meshed with the CUBIT mesh generation toolkit, optionally based on a journal file output by AssyGen. After one or more assembly model meshes have been constructed, they are arranged in a core model using the CoreGen tool. The input for CoreGen is similar to that of AssyGen, with assembly models substituted for unit cells. AssyGen and CoreGen also annotate the models with material and volume groupings necessary for specifying materials and boundary conditions required by the analysis. The AssyGen and CoreGen tools are packaged in the open-source MeshKit library for mesh generation; download and build instructions are included in this document.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parallel Block Structured Adaptive Mesh Refinement on Graphics Processing Units

Block-structured adaptive mesh refinement is a technique that can be used when solving partial differential equations to reduce the number of zones necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a native GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an eight-node cluster, and over four thousand nodes of Oak Ridge National Laboratory’s Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and has been scaled to over four thousand GPUs using a combination of MPI and CUDA.

97 MATHEMATICS AND COMPUTING↗

Update on Development of Mesh Generation Algorithms in MeshKit

MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKit are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.

Jain, Rajeev↗

CUBIT Geometry and Mesh Generation Toolkit 15.2 User Documentation

Welcome to CUBIT, the Sandia National Laboratory automated mesh generation toolkit. CUBIT is a full-featured software toolkit for robust generation of two- and three-dimensional finite element meshes (grids) and geometry preparation. Its main goal is to reduce the time to generate meshes, particularly large hex meshes of complicated, interlocking assemblies. It is a solidmodeler based preprocessor that meshes volumes and surfaces for finite element analysis.

97 MATHEMATICS AND COMPUTING↗

PAGOSA Mesh Block Calculator

A method for automatically generating the “mesh namelist block” portion of a PAGOSA input file, which specifies the boundaries and zone sizes of the computational mesh, has been developed. This application standardizes the mesh block for 2-, and 3-dimensional problems and is computed after the user specifies the extent and resolution of the mesh and the number of processors which will be used to run the problem. The inputs may be provided directly through a series of command-line guided questions, or a separate input file. The mesh block is written to both standard output and to disk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗