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 703 records · Page 39

Cubit Mesh Generation Toolkit V11.1

CUBIT prepares models to be used in computer-based simulation of real-world events. 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.

HANKS, BYRON↗

Nanowire mesh solar fuels generator

This disclosure provides systems, methods, and apparatus related to a nanowire mesh solar fuels generator. In one aspect, a nanowire mesh solar fuels generator includes (1) a photoanode configured to perform water oxidation and (2) a photocathode configured to perform water reduction. The photocathode is in electrical contact with the photoanode. The photoanode may include a high surface area network of photoanode nanowires. The photocathode may include a high surface area network of photocathode nanowires. In some embodiments, the nanowire mesh solar fuels generator may include an ion conductive polymer infiltrating the photoanode and the photocathode in the region where the photocathode is in electrical contact with the photoanode.

14 SOLAR ENERGY↗

Balancing Particle and Mesh Computation in a Particle-In-Cell Code

The XGC1 plasma microturbulence particle-in-cell simulation code has both particle-based and mesh-based computational kernels that dominate performance. Both of these are subject to load imbalances that can degrade performance and that evolve during a simulation. Each separately can be addressed adequately, but optimizing just for one can introduce significant load imbalances in the other, degrading overall performance. A technique has been developed based on Golden Section Search that minimizes wallclock time given prior information on wallclock time, and on current particle distribution and mesh cost per cell, and also adapts to evolution in load imbalance in both particle and mesh work. In problems of interest this doubled the performance on full system runs on the XK7 at the Oak Ridge Leadership Computing Facility compared to load balancing only one of the kernels.

Worley, Patrick H↗

Generating an implicit voronoi mesh to decompose a domain of arbitrarily many dimensions

Described herein are technologies pertaining to generating a Voronoi mesh for an enclosed domain of arbitrarily many dimensions. An implicit Voronoi mesh is received that comprises locations of seeds in the domain. Neighbors of a seed are identified by extending a segment from the seed to the boundary of the domain and performing successive hyperplane trimming of the segment to identify a point on the facet of the Voronoi cell of the seed. A vertex of the cell can be identified by successively extending and trimming one or more additional spokes to identify points on a facet of the cell that are constrained to lie in a (d−n) space, where d is a number of dimensions of the domain and n is a number of iterations. A numerical simulation is performed based on the Voronoi mesh to generate simulation results in applications including surrogate modeling, global optimization, calibration, dimension reduction.

97 MATHEMATICS AND COMPUTING↗

Mapping 2-dimensional meshes on 3-dimensional torus

In a L×M×N 3D torus network of computer nodes, a 2-dimensional plane comprising M×N torus network of nodes mapped into M/2 meshes×2*N torus network of nodes. N can be k*M, k is an integer greater than zero, and M and N are even numbers. Each of M/2 mesh of the 2*N torus is contiguous in the 2D plane. Mapping is performed for each of the L planes of the L×M×N 3D torus network. The M/2 meshes are combined with a remaining torus network dimension comprising L planes, the combining creating another 2*N pattern, wherein an L*M/2×2*N communication pattern is created. Application entities are executed according to the mapped L*M/2×2*N communication pattern.

Chen, Dong↗

Interactive Visualization of Multi-Group Cross Sections on High-Fidelity Spatial Meshes

Core simulation tools utilizing Monte Carlo transport methods represent the 'Holy Grail' for nuclear reactor analysis. However, deterministic transport methods pose a number of advantages to Monte Carlo from a computational perspective, which seems likely to make these methods more viable in the near to intermediate term. Deterministic methods almost universally discretize the energy domain in a few to hundreds of energy groups. One of the key challenges for deterministic transport-based methods to be viable is accurate, reactor agnostic multi-group cross section generation. This paper describes tools for data processing and visualization of multigroup cross sections generated on high-fidelity spatial meshes from the OpenMC Monte Carlo code. Next generation deterministic transport reactor core modeling tools will require multi-group cross section (MGXS) generation on high-fidelity spatial meshes. High-fidelity MGXS are necessary for the accurate simulation of neutron physics in nuclear reactors with a high degree of spectral heterogeneity - e.g., large localized neutron flux gradients throughout a reactor core. Although many local (e.g., pin cell) approximations have been developed to model the scalar flux to compute spectral-averaged MGXS, these techniques cannot account for complex intra-pin and intra-assembly spatial self-shielding effects. Monte Carlo presents the most accurate method for reactor agnostic multi-group cross section generation since it does not require the use of local approximations to the flux. Monte Carlo has been proposed as a highly desirable framework for reactor agnostic cross section generation for many years. Monte Carlo methods can effectively embed all of the relevant spectral effects into the MGXS through the random particle tracking and interaction sampling processes. Previous work has applied MCNP and Serpent to compute few-group constants for diffusion calculations, and OpenMC to compute multi-group cross sections for transport-based methods. The primary difficulty with using Monte Carlo for MGXS generation is the tremendous computational resources required to adequately converge multi-group cross sections in each spatial region and energy group. Recent development of the OpenMC Monte Carlo code for high-performance computing platforms has made multigroup cross section generation from Monte Carlo more tractable in the foreseeable future. The recent release of OpenMC v0.7.1 includes a new Python-based module for MGXS generation. The MGXS generation module leverages many of the algorithms and features for 'big data' analysis of large tally datasets on complex spatial meshes. This paper describes the data management workflow and visualization tools which have been developed to explore the plethora of MGXS data generated with OpenMC. It is the authors' hope that the development of the visualization tool described in this paper will ultimately enable the design of machine learning algorithms to accelerate the convergence rate of high-fidelity multi-group cross section generated with Monte Carlo. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Mimetic finite difference method for the stokes problem on polygonal meshes

Various approaches to extend the finite element methods to non-traditional elements (pyramids, polyhedra, etc.) have been developed over the last decade. Building of basis functions for such elements is a challenging task and may require extensive geometry analysis. The mimetic finite difference (MFD) method has many similarities with low-order finite element methods. Both methods try to preserve fundamental properties of physical and mathematical models. The essential difference is that the MFD method uses only the surface representation of discrete unknowns to build stiffness and mass matrices. Since no extension inside the mesh element is required, practical implementation of the MFD method is simple for polygonal meshes that may include degenerate and non-convex elements. In this article, we develop a MFD method for the Stokes problem on arbitrary polygonal meshes. The method is constructed for tensor coefficients, which will allow to apply it to the linear elasticity problem. The numerical experiments show the second-order convergence for the velocity variable and the first-order for the pressure.

99 GENERAL AND MISCELLANEOUS↗

Mesh independency in topology optimization

The topology optimization community has regularly employed optimization algorithms from the operations research community. However, these algorithms are implemented in the sequence space l2 instead of the proper function space where the design variable resides. In this software, we benchmark the mesh independent implementation of pyMMAopt with three common problems in topology optimization. We show how the volume fraction variable discretization on non-uniform meshes affects the convergence of l2 based optimization algorithms and how pyMMAopt successfully achieves mesh independent convergence.

Salazar De Troya, Miguel↗

Mesh generation for confined fusion plasma simulation

XGC1 and M3D-C 1 are two fusion plasma simulation codes being developed at Princeton Plasma Physics Laboratory. XGC1 uses the particle-in-cell method to simulate gyrokinetic neoclassical physics and turbulence. M3D-C 1 solves the two-fluid resistive magnetohydrodynamic equations with the C 1 finite elements. This paper presents the software tools and libraries that were combined to form the geometry and automatic meshing procedures for these codes. Finally, specific consideration has been given to satisfy the mesh configuration and element shape quality constraints of XGC1 and M3D-C 1 .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advances in hexagon mesh-based flow direction modeling

Watershed delineation and flow direction representation are the foundations of streamflow routing in spatially distributed hydrologic modeling. A recent study showed that hexagon-based watershed discretization has several advantages compared to the traditional Cartesian (latitude–longitude) discretization, such as uniform connectivity and compatibility with other Earth system model components based on unstructured mesh systems (e.g., oceanic models). Despite these advantages, hexagon-based discretization has not been widely adopted by the current generation of hydrologic models. One major reason is that there is no existing model that can delineate hexagon-based watersheds while maintaining accurate representations of flow direction across various spatial resolutions. In this study, we explored approaches such as spatial resampling and hybrid breaching-filling stream burning techniques to improve watershed delineation and flow direction representation using a newly developed hexagonal mesh watershed delineation model (HexWatershed). We applied these improvements to the Columbia River basin and performed 16 simulations with different configurations. The results show that (1) spatial resampling modulates flow direction around headwaters and provides an opportunity to extract subgrid information; and (2) stream burning corrects the flow directions in mountainous areas with complex terrain features.

58 GEOSCIENCES↗

Modeling wave propagation in elastic solids via high-order accurate implicit-mesh discontinuous Galerkin methods

Here, a high-order accurate implicit-mesh discontinuous Galerkin framework for wave propagation in single-phase and bi-phase solids is presented. The framework belongs to the embedded-boundary techniques and its novelty regards the spatial discretization, which enables boundary and interface conditions to be enforced with high-order accuracy on curved embedded geometries. High-order accuracy is achieved via high-order quadrature rules for implicitly-defined domains and boundaries, whilst a cell-merging strategy addresses the presence of small cut cells. The framework is used to discretize the governing equations of elastodynamics, written using a first-order hyperbolic momentum-strain formulation, and an exact Riemann solver is employed to compute the numerical flux at the interface between dissimilar materials with general anisotropic properties. The space-discretized equations are then advanced in time using explicit high-order Runge–Kutta algorithms. Several two- and three-dimensional numerical tests including dynamic adaptive mesh refinement are presented to demonstrate the high-order accuracy and the capability of the method in the elastodynamic analysis of single- and bi-phases solids containing complex geometries.

42 ENGINEERING↗

A mass–momentum consistent coupling for mesh-adaptive two-phase flow simulations

Here, we present a novel mass-momentum consistent coupling between a geometric volume-of-fluid scheme and an incompressible flow solver with differing directional-splitting approaches. The advection of the volume fraction is performed using a direction-split algorithm, whereas the momentum advection algorithm uses a traditional unsplit, fractional-step approach. Both algorithms employ finite-volume discretizations based on Cartesian meshes. In solving the mass-momentum consistency problem, momentum fluxes at the cell faces are weighted by the density fluxes based on the already advected volume fraction. The success of our approach lies on introducing a Favre-averaged velocity interpolation at the liquid/gas interface along with a minmod slope limiter. Mesh-convergence studies show that when the minmod slope limiter is used, the two-phase solver retains an accuracy between first and second order, but when a purely upwind scheme is considered, its accuracy drops to first order. Finally, after considering several validation problems, the solver is shown to agree well with reference numerical and experimental data while retaining its robustness and efficiency.

97 MATHEMATICS AND COMPUTING↗

Hydro-mechanical coupled modeling of hydraulic fracturing using the mesh fragmentation technique

The inclusion of special interface elements between standard finite elements is becoming a common technique to model discontinuities in porous media using the finite element method (FEM). Recently, it was proved that high aspect ratio (HAR) elements can reproduce very satisfactorily the main features of behavior observed in a single hydraulically-induced fracture. In this paper, the mesh fragmentation technique (MFT) is proposed to extend the application of HAR elements to simulate more general problems involving the formation of hydraulic fractures in rocks by introducing this type of element in-between the standard FE of a typical mesh. The proposed framework makes use of standard FE techniques. Therefore, it is relatively easy to upgrade an existing FE program for continuous porous media to deal with evolving discontinuities. The proposed approach is verified and validated against available analytical and numerical solutions. The crack patterns predicted by the MFT are also compared with the ones observed in the laboratory. The formation of multiple fractures is also analyzed. In all cases, the proposed technique was able to properly capture the main features of rock behavior subjected to hydraulic fracturing.

58 GEOSCIENCES↗

Interpolation methods and the accuracy of lattice-Boltzmann mesh refinement

A lattice-Boltzmann model to solve the equivalent of the Navier-Stokes equations on adap- tively refined grids is presented. A method for transferring information across interfaces between different grid resolutions was developed following established techniques for finite- volume representations. This new approach relies on a space-time interpolation and solving constrained least-squares problems to ensure conservation. The effectiveness of this method at maintaining the second order accuracy of lattice-Boltzmann is demonstrated through a series of benchmark simulations and detailed mesh refinement studies. These results exhibit smaller solution errors and improved convergence when compared with similar approaches relying only on spatial interpolation. Examples highlighting the mesh adaptivity of this method are also provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Implicit Solvers with Dynamic Mesh Adaptation for a Relativistic Drift-Kinetic Fokker–Planck–Boltzmann Model

In this work we consider a relativistic drift-kinetic model for runaway electrons along with a Fokker–Planck operator for small-angle Coulomb collisions, a radiation damping operator, and a secondary knock-on (Boltzmann) collision source. Here, we develop a new scalable fully implicit solver utilizing finite volume and conservative finite difference schemes and dynamic mesh adaptivity. A new data management framework in the PETSc library based on the p4est library is developed to enable simulations with dynamic adaptive mesh refinement (AMR), distributed memory parallelization, and dynamic load balancing of computational work. This framework and the runaway electron solver building on the framework are able to dynamically capture both bulk Maxwellian at the low-energy region and a runaway tail at the high-energy region. To effectively capture features via the AMR algorithm, a new AMR indicator prediction strategy is proposed that is performed alongside the implicit time evolution of the solution. This strategy is complemented by the introduction of computationally cheap feature-based AMR indicators that are analyzed theoretically. Numerical results quantify the advantages of the prediction strategy in better capturing features compared with nonpredictive strategies; and we demonstrate trade-offs regarding computational costs. The robustness with respect to model parameters, algorithmic scalability, and parallel scalability are demonstrated through several benchmark problems including manufactured solutions and solutions of different physics models. We focus on demonstrating the advantages of using implicit time stepping and AMR for runaway electron simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗