Results for “Discrete Element Method” — Page 20

DOE OSTI2022

NEAMS Technical Area Support in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities outlined in this report include a factor of 10^4 improvement in dependency resolution speed, sorting of user objects, ability to compute residuals and Jacobians together, transfer fixes, support for the mortar method in finite volume discretizations, addition of generalized advection schemes for fluid simulations, 10^2 speedup in some Griffin simulations due to a new matrix-only solve type, and much more.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations

This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of HDG, applied to the implicit solution of unsteady compressible flows. The matrix-free implementation allows for a reduction of the memory footprint of the solver when dealing with implicit time-accurate discretizations. HDG reduces the number of globally-coupled degrees of freedom relative to DG, at high order, by statically condensing element-interior degrees of freedom from the system in favor of face unknowns. The primal formulation further reduces the element-interior degrees of freedom by eliminating the gradient as a separate unknown. This paper introduces a p-multigrid preconditioner implementation for these discretizations and presents results for various flow problems. Benefits of the p-multigrid strategy relative to simpler, less expensive, preconditioners are observed for stiff systems, such as those arising from low-Mach number flows at high-order approximation. The p-multigrid preconditioner also shows excellent scalability for parallel computations. Finally, additional savings in both speed and memory occur with a matrix-free/reduced version of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Is tokenization needed for masked particle modeling?

In this work, we significantly enhance masked particle modeling (MPM), a self-supervised learning scheme for constructing highly expressive representations of unordered sets relevant to developing foundation models for high-energy physics. In MPM, a model is trained to recover the missing elements of a set, a learning objective that requires no labels and can be applied directly to experimental data. We achieve significant performance improvements over previous work on MPM by addressing inefficiencies in the implementation and incorporating a more powerful decoder. We compare several pre-training tasks and introduce new reconstruction methods that utilize conditional generative models without data tokenization or discretization. We show that these new methods outperform the tokenized learning objective from the original MPM on a new test bed for foundation models for jets, which includes using a wide variety of downstream tasks relevant to jet physics, such as classification, secondary vertex finding, and track identification.

conditional generative models↗

DOE OSTI2025

10-th order of accuracy for numerical solution of 3-D elasticity equations for heterogeneous materials on unfitted Cartesian meshes

We have developed the Optimal Local Truncation Error Method (OLTEM) with 10-th order of accuracy on unfitted Cartesian meshes for a system of 3-D elasticity equations with smooth irregular interfaces. 5 x 5 x 5 = 125-point stencils (similar to those for quadratic finite elements) for elastic heterogeneous materials are used for OLTEM. There are no unknowns at the interface points between different materials; the structure of the global discrete equations is the same for homogeneous and heterogeneous materials. The calculation of unknown stencil coefficients is based on the minimization of the local truncation error of the stencil equations and yields the optimal 10-th order of accuracy for OLTEM on unfitted Cartesian meshes, i.e., the increase by 7 orders in accuracy compared to quadratic finite elements on conformal meshes. A new post-processing procedure provides the 9-th order of accuracy for stresses in the 3-D case. Similar to basic computations it uses OLTEM with the 125-point stencils, the interface conditions and the elasticity equations. It was shown that the use of the elasticity equations for post-processing improves the accuracy of 0.1% stresses by 6 orders compared to post-processing without the use of PDEs. At an accuracy of for stresses, OLTEM with the new post-processing procedure reduces the number of degrees of freedom by 360 - 8000 times compared to quadratic finite elements with similar stencils. OLTEM with the 125-point stencils yields even more accurate results than high-order finite elements with much wider stencils. OLTEM provides accurate numerical results for compressible and nearly incompressible materials.

elasticity equations↗

DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗

DOE OSTI2022

Vibrational levels of a generalized Morse potential

A Generalized Morse Potential (GMP) is an extension of the Morse Potential (MP) with an additional exponential term and an additional parameter that compensate for MP’s erroneous behavior in the long range part of the interaction potential. Because of the additional term and parameter, the vibrational levels of the GMP cannot be solved analytically, unlike the case for the MP. We present several numerical approaches for solving the vibrational problem of the GMP based on Galerkin methods, namely, the Laguerre Polynomial Method (LPM), the Symmetrized LPM, and the Polynomial Expansion Method (PEM), and apply them to the vibrational levels of the homonuclear diatomic molecules B 2 , O 2 , and F 2 , for which high level theoretical near full configuration interaction (CI) electronic ground state potential energy surfaces and experimentally measured vibrational levels have been reported. Overall, the LPM produces vibrational states for the GMP that are converged to within spectroscopic accuracy of 0.01 cm –1 in between 1 and 2 orders of magnitude faster and with much fewer basis functions/grid points than the Colbert–Miller Discrete Variable Representation (CN-DVR) method for the three homonuclear diatomic molecules examined in this study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

A stable potential-based time-domain method for wideband elec- tromagnetic analysis

In previous research, the frequency-domain A-ϕ formulation has been validated using the finite element method for electromagnetic simulations of low-frequency and multi- scale problems, demonstrating excellent numerical accuracy, good matrix condition, and high computational efficiency. Time- domain simulations provide significant advantages for modeling wideband problems and are crucial for multiphysics applications. In this paper, the frequency-domain A-ϕ formulation is extended to the time domain. The central difference scheme is employed for temporal discretization to ensure both accuracy and stability. A numerical example is presented to demonstrate the capability of the proposed time-domain method in wideband electromagnetic analysis.

Mekonnen, Minyichil↗

DOE OSTI2022

Modeling gas breakthrough and flow phenomena through engineered barrier systems using a discrete fracture approach

Compacted clays are being considered to build engineered barrier systems (EBS) intended for the safe isolation of high-level nuclear waste (HLW) and spent nuclear fuel (SNF). The corrosion of the metallic canister containing the HLW/SNF will lead to the generation and buildup of the gas pressure in the more internal part of the clay buffer. This phenomenon would eventually trigger the formation and propagation of fractures in the clay barrier, jeopardizing its safety functions. Here, in this work, we propose to use the fragmentation technique (MFT) to model evolving fractures in clays triggered by gas pressurization. The MFT has been successfully used to model the formation of fractures in concrete, drying cracks in soil, hydraulic and thermo-fractures in rocks. In this work, we extend the MFT to deal with multiphase fluid flow in deformable porous media, and we upgraded a fully coupled computer finite element code using the extended technique. The proposed approach is first verified against analytical solutions and is then applied to model gas breakthrough experiments in clays. A very satisfactory performance of the method is observed in all the analyses, showing the potential of the MFT to tackle multiphase flow problems in deformable porous media with evolving discontinuities.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2023

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.↗

DOE OSTI2020

Radioactive Source Localization via Bayesian Particle Filter

In the event of a misplaced radioactive source or other emergency situation, measuring a radiation field, mapping its distribution, and determining a source location are essential tasks to ameliorating the situation. However, radiation fields may be extremely hazardous to human surveyors and minimizing received radiation doses is just as essential. Robots appear to be a potential solution to these problems. Beyond simply measuring radiation, the robot's computer processing capabilities offer a way to apply complex data analysis methods to radiation measurements in real-time. Methods which predict likely source locations can then feed this information into other processes, potentially improving path planning and enabling more efficient measurements. Given a robot mounted with a gamma-ray detector, can we: develop a methodology to account for detector performance across a wide range of source angles, distances, and photon energies? operate an autonomously navigating robot to effectively survey and characterize an area of interest? implement a data analysis method, conventionally used in measurements of motion, for source localization purposes? An open-source TurtleBot 3 robot, running Robot Operating System (ROS) on Ubuntu 16.04 LTS, was fitted with a Kromek GR1{sup R} Cadmium Zinc Telluride (CZT) solid-state gamma-ray detector. As a part of ROS, the packages OpenSlam, gmapping, and amcl were used to perform Simultaneous Localization and Mapping (SLAM), determining the robot's position and mapping the surrounding area. Data was acquired via Lidar mounted on top the TurtleBot 3. Detector Calibration Fit: The equation was fit to 365 counts of various energies, distances, and angles. A MATLAB{sup R} program was written to simulate measurements taken a robot on a random walk, with count data and positions discretized into finite element pixels. Using this program, a sample of 100 runs was performed on a map with a simulated source at the center, with a total of 200 of 2 pixels each. Similarly, multiple runs of the filter were performed on recorded robot measurement data. In both simulation and real tests, when corrected for errors (particles placed outside of bounds or on the robot, and simulation-specific errors), corresponding t-tests of predicted x and y-coordinates were within a 95% confidence interval of the actual position. For the real trial, these positions are slightly skewed right in the x-axis as the robot remained mainly to the left side of the source within the sample area. These simulations demonstrate potential validity for the usage of a particle filter as method of radioactive source localization. In the future, true real-time implementation and data fusion may further augment the performance of the robot to localize lost sources. Additionally, identification of multiple sources, determination of source types, and usage of a collimator are areas to potentially be explored.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2024

High-Order Hybrid RANS-LES Study of NACA0012 Wing Sections

We develop hybrid RANS-LES strategies within Nek5000 for application to airfoil sections at small flight configurations. We present a validation and verification study of $k \space – \space \tau$ SST applied to a NACA 0012 wing section in a pure RANS and in a hybrid RANS-LES setup. The study shows good corroboration with existing experimental and numerical datasets. We also analyze some of the observed discrepancies with the experiments by evaluating the side wall “blocking” effect. We demonstrate that for the hybrid turbulence modeling approach a high-order spectral- element discretization converges faster (i.e., with less resolution) than a representative low-order finite-volume-based approach.

42 ENGINEERING↗

DOE OSTI2022

The DPG Method for the Convection-Reaction Problem, Revisited

In this work, we study both conforming and non-conforming versions of the practical DPG method for the convection-reaction problem. We determine that the most common approach for DPG stability analysis – construction of a local Fortin operator – is infeasible for the convection-reaction problem. We then develop a line of argument based on a direct proof of discrete stability; we find that employing a polynomial enrichment for the test space does not suffice for this purpose, motivating the introduction of a (two-element) subgrid mesh. The argument combines mathematical analysis with numerical experiments.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Electrodes, lithium-ion batteries, and methods of making and using same

Described herein are improved composite anodes and lithium-ion batteries made therefrom. Further described are methods of making and using the improved anodes and batteries. In general, the anodes include a porous composite having a plurality of agglomerated nanocomposites. At least one of the plurality of agglomerated nanocomposites is formed from a dendritic particle, which is a three-dimensional, randomly-ordered assembly of nanoparticles of an electrically conducting material and a plurality of discrete non-porous nanoparticles of a non-carbon Group 4A element or mixture thereof disposed on a surface of the dendritic particle. At least one nanocomposite of the plurality of agglomerated nanocomposites has at least a portion of its dendritic particle in electrical communication with at least a portion of a dendritic particle of an adjacent nanocomposite in the plurality of agglomerated nanocomposites.

Yushin, Gleb↗

DOE OSTI2022

Electrodes, lithium-ion batteries, and methods of making and using same

Described herein are improved composite anodes and lithium-ion batteries made therefrom. Further described are methods of making and using the improved anodes and batteries. In general, the anodes include a porous composite having a plurality of agglomerated nanocomposites. At least one of the plurality of agglomerated nanocomposites is formed from a dendritic particle, which is a three-dimensional, randomly-ordered assembly of nanoparticles of an electrically conducting material and a plurality of discrete non-porous nanoparticles of a non-carbon Group 4A element or mixture thereof disposed on a surface of the dendritic particle. At least one nanocomposite of the plurality of agglomerated nanocomposites has at least a portion of its dendritic particle in electrical communication with at least a portion of a dendritic particle of an adjacent nanocomposite in the plurality of agglomerated nanocomposites.

Yushin, Gleb↗

DOE OSTI2023

Electrodes, lithium-ion batteries, and methods of making and using same

Described herein are improved composite anodes and lithium-ion batteries made therefrom. Further described are methods of making and using the improved anodes and batteries. In general, the anodes include a porous composite having a plurality of agglomerated nanocomposites. At least one of the plurality of agglomerated nanocomposites is formed from a dendritic particle, which is a three-dimensional, randomly-ordered assembly of nanoparticles of an electrically conducting material and a plurality of discrete non-porous nanoparticles of a non-carbon Group 4A element or mixture thereof disposed on a surface of the dendritic particle. At least one nanocomposite of the plurality of agglomerated nanocomposites has at least a portion of its dendritic particle in electrical communication with at least a portion of a dendritic particle of an adjacent nanocomposite in the plurality of agglomerated nanocomposites.

Yushin, Gleb↗

DOE OSTI2023

Electrodes, lithium-ion batteries, and methods of making and using same

Described herein are improved composite anodes and lithium-ion batteries made therefrom. Further described are methods of making and using the improved anodes and batteries. In general, the anodes include a porous composite having a plurality of agglomerated nanocomposites. At least one of the plurality of agglomerated nanocomposites is formed from a dendritic particle, which is a three-dimensional, randomly-ordered assembly of nanoparticles of an electrically conducting material and a plurality of discrete non-porous nanoparticles of a non-carbon Group 4A element or mixture thereof disposed on a surface of the dendritic particle. At least one nanocomposite of the plurality of agglomerated nanocomposites has at least a portion of its dendritic particle in electrical communication with at least a portion of a dendritic particle of an adjacent nanocomposite in the plurality of agglomerated nanocomposites.

Yushin, Gleb↗

DOE OSTI2022

An Efficient B-Spline Lagrangian/Eulerian Method for Compressible Flow, Shock Waves, and Fracturing Solids

This study presents a new method for modeling the interaction between compressible flow, shock waves, and deformable structures, emphasizing destructive dynamics. Extending advances in time-splitting compressible flow and the Material Point Methods (MPM), we develop a hybrid Eulerian and Lagrangian/Eulerian scheme for monolithic flow-structure interactions. We adopt the second-order WENO scheme to advance the continuity equation. To stably resolve deforming boundaries with sub-cell particles, we propose a blending treatment of reflective and passable boundary conditions inspired by the theory of porous media. The strongly coupled velocity-pressure system is discretized with a new mixed-order finite element formulation employing B-spline shape functions. Shock wave propagation, temperature/density-induced buoyancy effects, and topology changes in solids are unitedly captured.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗