Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete Element Method”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Simulating low-energy neutrino interactions with MARLEY

Monte Carlo event generators are a critical tool for the interpretation of data obtained by neutrino experiments. Several modern event generators are available which are well-suited to the GeV energy scale used in studies of accelerator neutrinos. However, theoretical modeling differences make their immediate application to lower energies difficult. In this paper, I present a new event generator, MARLEY, which is designed to better address the simulation needs of the low-energy (tens of MeV and below) neutrino community. The code is written in C++14 with an optional interface to the popular ROOT data analysis framework. The current release of MARLEY (version 1.2.0) emphasizes simulations of the reaction 40 Ar ( ν e , e − ) 40 K ⁎ but is extensible to other channels with suitable user input. This paper provides detailed documentation of MARLEY's implementation and usage, including guidance on how generated events may be analyzed and how MARLEY may be interfaced with external codes such as Geant4. Further information about MARLEY is available on the official website at http://www.marleygen.org. Program title:MARLEY 1.2.0 CPC Library link to program files:https://doi.org/10.17632/4v7zxnc8j3.1 Developer's respository link:http://github.com/MARLEY-MC/marley Code Ocean capsule:https://codeocean.com/capsule/9868179 Licensing provisions: GNU General Public License 3.0 Programming language: C++14 External routines/libraries used: GNU Scientific Library [1,2] (required), ROOT [3,4] (optional) Nature of problem: Simulation of neutrino-nucleus scattering events at energies of tens-of-MeV and below Solution method: Initial two-to-two scattering kinematics are sampled using the allowed approximation differential cross section and tables of precomputed nuclear matrix elements. Subsequent de-excitations of the remnant nucleus are simulated using a Monte Carlo implementation of the Hauser-Feshbach statistical model and tabulated γ-ray decay schemes for discrete nuclear levels. Additional comments including restrictions and unusual features: Input data are provided with the code that are suitable for producing simulations of the charged-current reaction 40 Ar ( ν e , e − ) 40 K ⁎ , coherent elastic neutrino-nucleus scattering on spin-zero target nuclei, and neutrino-electron elastic scattering on any atomic target. Preparation of new reaction input files (whose format is documented in Appendix B) would enable other reaction channels and nuclear targets to be handled by the existing code framework. Although there is no maximum neutrino energy enforced by the code itself, realistic neutrino-nucleus scattering events may be generated up to roughly 50 MeV. Above this energy, the effects of forbidden nuclear transitions, which are neglected in the current treatment of the cross sections (see section 2.1), become increasingly important.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Science & Technology Review: The Road to Exascale Computing

At Lawrence Livermore National Laboratory, we focus on science and technology research to ensure our nation’s security. We also apply that expertise to solve other important national problems in energy, bioscience, and the environment. Science & Technology Review is published eight times a year to communicate, to a broad audience, the Laboratory’s scientific and technological accomplishments in fulfilling its primary missions. The publication’s goal is to help readers understand these accomplishments and appreciate their value to the individual citizen, the nation, and the world. The Department of Energy’s Exascale Computing Project (ECP) and Lawrence Livermore’s RADIUSS (Rapid Application Development via an Institutional Universal Software Stack) initiative benefit from strategically developed software tools. The front cover shows a simulation of advection under twisting rotation that uses high-order finite elements from Livermore’s Modular Finite Element Methods (MFEM) software library and GLVis visualization tool. On the back cover, the logo (also created with GLVis) for the MFEM project illustrates the curved mesh and sub-element resolution used in high-order simulations. MFEM and GLVis are key components of the ECP’s co-design Center for Efficient Exascale Discretizations (CEED) and RADIUSS. MFEM is also part of ECP’s Extreme-Scale Scientific Software Development Kit (xSDK).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Regularized Finite Element Formulations for Shear Band Instabilities in Metals

In my research I have addressed several fundamental issues of dynamic fracture: 1. established the role of heat conduction as a natural regularizing mechanism in shearband problems (i.e. using the correct physics for this problem), 2. developed a unified model to incorporate fracture through a modified phase field formulation, 3. developed stability analysis tools to determine the onset of localization, 4. developed discretization methods and solvers to solve this problem (on parallel computers) that lead to mesh insensitive results and fast convergence. For such difficult problems, the physics and numerics are strongly coupled. To accurately model the physics, one must develop reliable numerics but reliable numerics depends on correct description of the physics. To this end, we have already made significant progress in the field showing that a fully-coupled implicit solution with heat conduction is the key to obtain reliable results for shear bands (see the next sections for more details). This research fits well within the mission of DOE ASCR program on all aspects: from governing equations to discretization to solvers to parallel computers to applications problems. It also relies on the computational tools developed through the SciDAC institutes FASTMath and SDAV, such as PETSc (and SLEPc), ParaView, Trilinos and Masquite.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A general framework for substructuring-based domain decomposition methods for models having nonlocal interactions [including apppendix B]

A rigorous mathematical framework is provided for a substructuring-based domain-decomposition approach for nonlocal problems that feature interactions between points separated by a finite distance. Here, by substructuring it is meant that a traditional geometric configuration for local partial differential equation problems is used in which a computational domain is subdivided into non-overlapping subdomains. In the nonlocal setting, this approach is substructuring-based in the sense that those subdomains interact with neighboring domains over interface regions having finite volume, in contrast to the local PDE setting in which interfaces are lower dimensional manifolds separating abutting subdomains Key results include the equivalence between the global, single-domain nonlocal problem and its multi-domain reformulation, both at the continuous and discrete levels. These results provide the rigorous foundation necessary for the development of efficient solution strategies for nonlocal domain-decomposition methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Estimation of full-field dynamic strains from digital video measurements of output-only beam structures by video motion processing and modal superposition

Strain is an necessary quantity to characterize local structural behaviors and directly correlates with structural damage initiation and development that is within local regions. Strain measurement at high spatial resolution (density) locations is thus required to characterize local structural behaviors and detect potential local damage. Traditional contact-type strain gauges are mostly discrete point-wise sensors that can only be placed in a limited number of positions. Distributed optical fiber sensing techniques can measure strains at spatially dense measurement points, but their instrumentation is a time- and labor-intensive process associated with the issue of the fragility of fibers. Noncontact optical measurement techniques, such as a family of interferometry techniques using laser beams (e.g., laser Doppler vibrometers), can provide vibration measurement at high density spatial points without the need to install sensors on the structure. Yet, these measurement devices are active sensing methods that are relatively expensive and vulnerable to ambient motion. Photogrammetry is an alternative noncontact optical measurement method using (passive) white-light imaging of digital video cameras that are relatively low-cost, agile, and provides simultaneous measurements at high spatial density locations where every pixel becomes a measurement point. Among others, digital image correlation can achieve full-field deformation measurements and subsequently estimate the full-field strains. However, it is computationally extensive. This research develops a new efficient approach to estimate the full-field (as many measurement points as the pixel number of the video frame on the structure) dynamic strains at high-spatial (pixel)-resolution/density location points from the digital video measurement of output-only vibrating structures. The developed approach is based on phase-based video motion estimation and modal superposition of structural dynamic response. Moreover, the method is augmented by a high-fidelity finite element model, which is updated with the full-field experimental modal parameters “blindly” identified from the video measurement of the output-only structure. Laboratory experiments are conducted to validate the method on a bench-scale cantilever beam structure. Results demonstrate that the full-field dynamic strain estimated by the developed approach from the video measurement of the output-only vibrating beam match very well those directly measured by the strain gauges (at discrete measurement points). Some factors associated with the effectiveness of the method are experimentally studied and discussed.

47 OTHER INSTRUMENTATION↗
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↗