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 109 records · Page 6

User Manual for the PROTEUS Mesh Tools

PROTEUS is built around a finite element representation of the geometry for visualization. In addition, the PROTEUS-SN solver was built to solve the even-parity transport equation on a finite element mesh provided as input. Similarly, PROTEUS-MOC and PROTEUS-NEMO were built to apply the method of characteristics on unstructured finite element meshes. Given the complexity of real world problems, experience has shown that using commercial mesh generator to create rather simple input geometries is overly complex and slow. As a consequence, significant effort has been put into place to create multiple codes that help assist in the mesh generation and manipulation. There are three input means to create a mesh in PROTEUS: UFMESH, GRID, and NEMESH. At present, the UFMESH is a simple way to generate two-dimensional Cartesian and hexagonal fuel assembly geometries. The UFmesh input allows for simple assembly mesh generation while the GRID input allows the generation of Cartesian, hexagonal, and regular triangular structured grid geometry options. The NEMESH is a way for the user to create their own mesh or convert another mesh file format into a PROTEUS input format. Given that one has an input mesh format acceptable for PROTEUS, we have constructed several tools which allow further mesh and geometry construction (i.e. mesh extrusion and merging). This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as “mesh” input for any of the mesh tools discussed in this manual.

97 MATHEMATICS AND COMPUTING↗

MOOSE Framework Meshing Enhancements to Support Reactor Analysis

MOOSE-based physics codes require an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The use of difficult-touse, external licensed software is often required to generate high quality meshes for reactor geometries. High-fidelity geometry modeling also requires elaborate tracking of groups of elements for material property assignment and output reporting which can be considerably complex for the user to identify and maintain. Under the U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, several meshingrelated enhancements have been developed for the MOOSE framework to address user challenges in creating finite element meshes for advanced reactor geometries. MOOSE mesh generators have been developed to mesh hexagonal geometries (pins, ducted assemblies, and cores) commonly found in liquid-metal cooled fast reactor concepts. The mesh generator used for hexagonal pin cells is generic for regular polygons and therefore may also be used for Cartesian pin cells. Hexagonal pin cells can be stitched into ducted assemblies, and assemblies can be stitched together into a core. The user may specify region ids, region names, and other preferences on the mesh. This control is useful for later material mapping in the MOOSE-based physics codes input. A capability was also developed for meshing rotating control drums including determination of material volume fractions in each mesh element as a function of time. Control drum meshes may be stitched to other hexagonal assemblies to create a core configuration. Additional mesh generators were developed that wrap around the hexagonal meshing capabilities and utilize “extra element integer” ID values on each element. In regular Cartesian or hexagonal assemblies or cores, the bookkeeping of element groups for both material assignment and output reporting can now be automated through assignment of pin, assembly, core, axial and depletion id values stored as extra element integers. The extra element tags on the mesh greatly speed the reactor analyst’s efforts to map materials to meshes, track depletion zones, and parse output such as axial pin power distributions. At the highest level, pin, assembly, and core mesh generators (with this reactor terminology) have also been developed to easily generate regular Cartesian and hexagonal cores, including axial extrusion. These reactor geometry builders call upon the previously mentioned capabilities to produce analysis-ready 3D meshes including material assignments. Open source mesh triangulation capabilities were also investigated for integration into the MOOSE framework to address the need for meshing the core periphery region which extends from the irregular outer assembly border to a cylindrical boundary. Options are limited due to licensing constraints, and the recommendation is pursue building a native MOOSE Delaunay triangulator routine with full functionality. Finally, a series of verification problems were performed with NEAMS physics tools. All developed capabilities will be available in the new open-source “Reactor” module of the MOOSE framework, which is accessible to any MOOSE-based NEAMS physics tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Incorporating the Min-Max Mesh Optimization Method within the Target-Matrix Paradigm

The Target-Matrix Optimization Paradigm (TMOP) is a method for improving mesh quality via node movement. Through the use of appropriate pre-defined quality metrics and Target-matrices, TMOP provides the ability to define mesh quality in terms of element shape, volume, and edge orientation as a function of position within the mesh, thus facilitating high-level goals such as size-adapted meshing. The Paradigm is developed further in this paper by showing how it can be applied to the problem of improving the mesh in locations where the quality is the worst. Improving the worst quality portions of a mesh was investigated by Freitag, Amenta, and others, who showed that the problem can be formulated as a min-max optimization problem. The Target-paradigm is used to extend the previous work in two important respects. First, by using quality metrics from the Target-paradigm, quality can be user-specified via Target-matrices instead of the quality definition being hard-wired into the quality metric. Second, by making use of the sample point concept in TMOP, one can extend min-max mesh optimization to non-simplicial element types such as quadrilaterals. Numerical experiments were performed to illustrate these extensions and to investigate their utility. A non-gradient solver known as the amoeba was used to numerically compute the optimal solutions. This derivative-free method, in conjunction with the use of barrier metrics from TMOP, enables the solution of the min-max problem without the use of explicit constraints to guarantee that the optimal mesh is non-inverted. The experiments showed that the use of Target-metrics in min-max with triangle (or tetrahedral) element meshes is able to effectively improve the worst quality elements in terms of shape or in terms of size+shape. The experiments also showed that the mesh min-max extension to quadrilateral element meshes can lead to acceptable meshes using barrier metrics from the Target-paradigm, provided that inter-element mesh smoothness is not important. Poor behavior was observed when using non-barrier Target-metrics in min-max with quadrilateral element meshes. For both simplicial and quadrilateral meshes, the min-sum method can be competitive with min-max, however.

97 MATHEMATICS AND COMPUTING↗

MOOSE Reactor Module Meshing Enhancements to Support Reactor Physics Analysis

The U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) program develops an integrated suite of advanced reactor physics tools built upon the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework. Each code generally requires an input finite element mesh on which the physics solution is calculated, reported, and transferred to other physics codes. The meshing process is often burdensome for the complex geometries present in reactors due to lack of easy-to-use, open-source meshing tools. To address the bottleneck associated with meshing complex geometries found in nuclear reactors, NEAMS initiated the development of the MOOSE Reactor Module starting in FY21. The Reactor Module builds off the existing MOOSE Mesh System to include targeted meshing capabilities such as the ability to generate hexagonal pin cells, assemblies with ducts, rotating control drums, cores, peripheral zones around a core, as well as the automatic labeling (“reporting IDs”) of pin, assembly, and planar zones to simplify post-processing of results. As a Physics Module in MOOSE, the Reactor Module is open-source, available with any MOOSE installation, directly compatible with MOOSE-based tools, and can be invoked from MOOSEbased applications to generate meshes. Functionality from the Reactor Module has been applied to several advanced reactor concepts to demonstrate user workflow improvements and accuracy. The primary objective of the Reactor Module is to improve useability of MOOSEbased tools by streamlining mesh generation and output inspection processes. During FY22, the functionality of the Reactor Module (and accompanying Mesh System) has been expanded based on user needs. First, the Reactor Geometry Mesh Builder capability developed primarily in FY21 has been refactored and merged to the public MOOSE repository. This capability wraps underlying Reactor Module mesh generators into a “Pin – Assembly – Core” workflow appropriate for conventional Cartesian and hexagonal geometries, and notably assigns material IDs during mesh generation stage and generates only the minimal number of blocks needed in order to reduce computational burden. Biasing and boundary layer options have been added to the base mesh generators as required by thermal hydraulics solvers. The reporting ID functionality has been expanded to differentiate ring-wise and azimuthal sectors within a pin for use with depletion algorithms, and VectorPostProcessor and Reporter objects are now available to integrate solution variables across zones based on ID combinations. Functionality to trim hexagonal meshes along the center or periphery has been developed so users may leverage symmetry and reflective boundary conditions to reduce the mesh size. A flexible and powerful tool to fill the space between two sidesets has been introduced to the framework and can be used for transition layers such as stitching two assemblies together with different numbers of pins, or for complex geometries which do not follow conventional Cartesian/hexagonal patterns. Finally, additional verification problems were performed with NEAMS physics tools in complement with existing NEAMS work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Voronoi Meshing to Accurately Capture Geological Structure in Subsurface Simulations

Mesh generation lies at the interface of geological modeling and reservoir simulation. Highly skewed or very small grid cells may be necessary to accurately capture the geometry of geological features, but the resulting poorly scaled or small grid cells can have a substantial negative impact on simulator accuracy and speed. One way to minimize numerical errors caused by gridding complex structures is to simulate on high-quality Voronoi meshes, which reduce grid orientation effects in fluid flow. This work presents a complete methodology to create Voronoi simulation grids, model fluid flow in complex geological systems, and visualize the results. A recently developed Voronoi meshing method that can automatically generate provably good unstructured meshes that conform to input surfaces creating closed volumes is used. Initially an analytical benchmark simulation is presented to validate the quality of the meshes and simulation results and demonstrate the superiority of simulation results using Voronoi meshes over flexed-hexahedral meshes on a domain with internal features. Next, meshes are created for test structures representing four of the most common geological features in the subsurface: layering, pinch-out, an interior lens that tapers to zero thickness on all sides and a fault with offset. Two benchmark flow simulations are run for each test structure. Finally, a realistic geological example for CO 2 injection into an anticline is simulated. Three realizations of the Voronoi mesh at the same resolution are generated for the simulations. Each mesh is highly refined near the injection wells and coarse in areas of less interest. These three meshes are used to model the CO 2 plume in the subsurface as it migrates to the top of the structure and then fills downward. Simulations on the meshes with randomly generated elements inside the input volumes each give slightly different fingering patterns for the viscous-unstable buoyant gas flow. The results presented in this work show a promising step towards utilizing fully automated Voronoi meshing for subsurface flow simulations in complex geology.

58 GEOSCIENCES↗

An electrostatic Particle-In-Cell code on multi-block structured meshes

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. In spite of the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where an arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma–material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. And compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.

36 MATERIALS SCIENCE↗

An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Most adaptive mesh generation algorithms employ a 3-refinement method. This method, although easy to employ, provides a mesh that is often too coarse in some areas and over refined in other areas. Because this method generates 27 new hexes in place of a single hex, there is little control on mesh density. This paper presents an adaptive all-hexahedral grid-based meshing algorithm that employs a 2-refinement method. 2-refinement is based on dividing the hex to be refined into eight new hexes. This method allows a greater control on mesh density when compared to a 3-refinement procedure. This adaptive all-hexahedral meshing algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher mesh densities smooth. Templates were introduced to allow both convex and concave refinement.

99 GENERAL AND MISCELLANEOUS↗

Spherical geodesic mesh generation

In ALE simulations with moving meshes, mesh topology has a direct influence on feature representation and code robustness. In three-dimensional simulations, modeling spherical volumes and features is particularly challenging for a hydrodynamics code. Calculations on traditional spherical meshes (such as spin meshes) often lead to errors and symmetry breaking. Although the underlying differencing scheme may be modified to rectify this, the differencing scheme may not be accessible. This work documents the use of spherical geodesic meshes to mitigate solution-mesh coupling. These meshes are generated notionally by connecting geodesic surface meshes to produce triangular-prismatic volume meshes. This mesh topology is fundamentally different from traditional mesh topologies and displays superior qualities such as topological symmetry. This work describes the geodesic mesh topology as well as motivating demonstrations with the FLAG hydrocode.

97 MATHEMATICS AND COMPUTING↗

Impact experiments into multiple-mesh targets: Concept development of a lightweight collisional bumper

The utility of multiple-mesh targets as potential lightweight shields to protect spacecraft in low-Earth orbit against collisional damage is explored. Earlier studies revealed that single meshes comminute hypervelocity impactors with efficiencies comparable to contiguous targets. Multiple interaction of projectile fragments with any number of meshes should lead to increased comminution, deceleration, and dispersion of the projectile, such that all debris exiting the mesh stack possesses low specific energies (ergs/sq cm) that would readily be tolerated by many flight systems. The study is conceptually exploring the sensitivity of major variables such as impact velocity, the specific areal mass (g/sq cm) of the total mesh stack (SM), and the separation distance (S) between individual meshes. Most experiments employed five or ten meshes with total SM typically less than 0.5 the specific mass of the impactor, and silicate glass impactors rather than metal projectiles. While projectile comminution increases with increasing impact velocity due to progressively higher shock stresses, encounters with multiple-meshes at low velocity (1-2 km/s) already lead to significant disruption of the glass impactors, with the resulting fragments being additionally decelerated and dispersed by subsequent meshes, and, unlike most contiguous single-plate bumpers, leading to respectable performance at low velocity. Total specific bumper mass must be the subject of careful trade-off studies; relatively massive bumpers will generate too much debris being dislodged from the bumper itself, while exceptionally lightweight designs will not cause sufficient comminution, deceleration, or dispersion of the impactor. Separation distance was found to be a crucial design parameter, as it controls the dispersion of the fragment cloud. Substantial mass savings could result if maximum separation distances were employed. The total mass of debris dislodged by multiple-mesh stacks is modestly smaller than that of single, contiguous-membrane shields. The cumulative surface area of all penetration holes in multiple mesh stacks is an order of magnitude smaller than that in analog multiple-foil shields, suggesting good long-term performance of the mesh designs. Due to different experimental conditions, direct and quantitative comparison with other lightweight shields is not possible at present.

Hoerz, Friedrich↗

An adaptive mesh-moving and refinement procedure for one-dimensional conservation laws

We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments are conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.

Biswas, Rupak↗

Verification of Anisotropic Mesh Adaptation for Turbulent Simulations over ONERA M6 Wing

Unstructured anisotropic mesh adaptation is known to be an efficient way to control discretization errors in Computational Fluid Dynamics (CFD) simulations. Method verification is required to provide the confidence for routine use in production analysis. The current work aims at verification of anisotropic mesh adaptation for RANS simulations over the ONERA M6 wing. The present verification study is performed using four different flow solvers, three different implementations of the metric field, and three mesh mechanics packages. Two of the flow solvers use stabilized finite-element discretizations (FUN3D-SFE and GGNS), one uses finite-volume discretization (FUN3D-FV), and the last one uses mixed finite-volume and finite element discretizations (Wolf). The mesh adaptation is based on an error estimator that aims to control the quadratic error term in the linear interpolation of Mach number. Two sets of adaptations were performed; the first one controls the interpolation error in L2 norm and the second one controls the interpolation error in L4 norm. Convergence studies were performed on the forces and the pitching moment using all four solvers, and the results are compared with previously verified convergence studies on fixed (nonadapted) meshes. Both forces and pitching moment on adapted meshes are found to be converging to the fine mesh values faster than those on fixed meshes. In addition to forces and moments, convergence of surface pressure and skin friction coefficients at various measurement locations on the wing are also presented. Adapted-mesh surface pressure distributions agree with the fine fixed mesh pressure distributions. Adapted-mesh skin friction distributions contain high frequency noise with mean values approaching the fixed mesh pressure skin friction distributions.

Aravind Balan↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Generating MCNP Input Files for Unstructured Mesh Geometries

The Los Alamos National Laboratory’s (LANL) Monte Carlo N-Particle (MCNP)1 transport code version 6.3 (also known as MCNP6.3) has the capability for tracking particles on unstructured mesh (UM) geometry models embedded into constructive solid geometry (CSG) cells. This feature has been developed for performing calculations of complex geometry models because manually creating CSG models is time-consuming and error-prone as the complexities of geometries increase. A UM geometry model is a collection of finite elements representing a solid geometry. The first step of the MCNP UM calculation is using other software packages to create a finite element mesh representation of a solid 3D geometry because the MCNP code cannot be used to generate a UM model. Computer-aided design (CAD) software is typically used to create a solid geometry model, which is later imported into mesh generation software to create a UM model. Some mesh generation software packages may also be used to create solid geometries and thus CAD files are not needed. The MCNP UM feature was originally designed for models generated by the Abaqus/CAE software suite. The MCNP code version 6.0 and later can process UM models formatted as Abaqus input files. Starting with a 6.3 version, the MCNP code can process HDF5 mesh input files. We only focus on the UM models formatted as Abaqus input files in this report since currently no external software can be used to generate HDF5 mesh input files for MCNP UM calculations. The MCNP code version 6.3 can be used to convert the Abaqus mesh input files into the HDF5 mesh input files, but this option is typically used by the MCNP code development team to test the HDF5 mesh input file feature. Several software packages (such as Abaqus, Attila4MC, or Cubit) can be used to create the Abaqus input files for MCNP UM calculations. An MCNP UM calculation using an Abaqus model requires two input file types: MCNP and Abaqus input files. The Abaqus input files needed for MCNP UM calcu lations must have the correct Abaqus syntax and meet the additional requirements by the MCNP code. The MCNP code can process only Abaqus input files that make use of part and assembly definitions, where elements in each part must be grouped into one or more element sets (i.e., elset) using *Elset keyword lines with specified naming formats. The MCNP and Abaqus input files required for MCNP UM simulations must be related; pseudo-cells in an MCNP input file must be constructed from mesh model data from an Abaqus input file. For large complex UM models, it is tedious to manually create MCNP UM input files. The um pre op (unstructured mesh pre operations) program with the -m option can be used to create a skeleton MCNP input file from an Abaqus input file [6]. Since the um pre op program was written in Fortran and was not written for optimized performance, this program is a deprecated feature in the MCNP code version 6.3 and may be removed in the next release of the code. To improve calculation flow of multiphysics calculations, a Python3 code called write mcnp um input has been developed to generate an MCNP input file instead of using the um_pre_op -m option. This Python code was initially released to the public in 2020. We have updated this Python code for MCNP6.3 and it was used to generate the MCNP input files used to verify the MCNP6.3 code. The write_mcnp_um_input code is included with the MCNP6.3 code package which will be released to the public through the Radiation Safety Information Computational Center (RSICC) at Oak Ridge National Laboratory. This report is a revision of LA-UR-20-27139 report.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Local element operations for curved simplex meshes

Summary Mesh optimization procedures are generally a combination of node smoothing and discrete operations which affect a small number of elements to improve the quality of the overall mesh. These procedures are useful as a post‐processing step in mesh generation procedures and in applications such as fluid simulations with severely deforming domains. In order to perform high‐order mesh optimization, these ingredients must also be extended to high‐order (curved) meshes. In this work, we present a method to perform local element operations on curved meshes. The mesh operations discussed in this work are edge/face swaps, edge collapses, and edge splitting (more generally refinement) for triangular and tetrahedral meshes. These local operations are performed by first identifying the patch of elements which contain the edge/face being acted on, performing the operation as a “straight‐sided one" by placing the high‐order nodes via an isoparametric mapping from the master element, and smoothing the high‐order nodes on the elements in the patch by minimizing a Jacobian‐based high‐order mesh distortion measure. Since the initial “straight‐sided guess” from the placement of the nodes via the isoparametric mapping frequently results in invalid elements, the distortion measure must be regularized which allows for mesh untangling for the optimization to succeed. We present several examples in 2D and 3D to demonstrate these local operations and how they can be combined with a high‐order node smoothing procedure to maintain mesh quality when faced with severe deformations.

Shi, A.↗