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.

566 records · Page 32

MOOSE framework enhancements for meshing reactor geometries

MOOSE is an open-source, parallel finite element framework designed to permit rapid development of robust multi-physics modeling capabilities. Under the DOE-NEAMS program, numerous solvers have been developed utilizing the open-source MOOSE framework for multiphysics reactor analysis. These solvers require input finite element meshes representing the discretized geometry. Typically, reactor analysts turn to licensed external tools for creation of reactor geometry meshes. Recently, enhancements have been added to the MOOSE framework to mesh common reactor geometries and improve MOOSE-based application user workflows. Support for hexagonal pins, assemblies, and cores has been added, and Cartesian support has been extended. Options for modeling static and rotating control drums within a hexagonal assembly are now available. Pin, assembly, and plane regions can be identified through automatically applied tags on the mesh called 'reporting IDs' for easier post- processing of physics results. An external open-source triangle routine has been leveraged within MOOSE to mesh core periphery zones. A set of reactor geometry builder routines further streamline the construction of hexagonal and Cartesian cores and include the ability to assign materials to regions during mesh generation. The new meshing routines are available through the MOOSE framework in the open-source 'Reactor' module, and the resulting directly within MOOSE-based applications or exported as Exodus II files for use in other finite element solvers. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗

Soil gas probes for monitoring trace gas messengers of microbial activity

Abstract Soil microbes vigorously produce and consume gases that reflect active soil biogeochemical processes. Soil gas measurements are therefore a powerful tool to monitor microbial activity. Yet, the majority of soil gases lack non-disruptive subsurface measurement methods at spatiotemporal scales relevant to microbial processes and soil structure. To address this need, we developed a soil gas sampling system that uses novel diffusive soil probes and sample transfer approaches for high-resolution sampling from discrete subsurface regions. Probe sampling requires transferring soil gas samples to above-ground gas analyzers where concentrations and isotopologues are measured. Obtaining representative soil gas samples has historically required balancing disruption to soil gas composition with measurement frequency and analyzer volume demand. These considerations have limited attempts to quantify trace gas spatial concentration gradients and heterogeneity at scales relevant to the soil microbiome. Here, we describe our new flexible diffusive probe sampling system integrated with a modified, reduced volume trace gas analyzer and demonstrate its application for subsurface monitoring of biogeochemical cycling of nitrous oxide (N 2 O) and its site-specific isotopologues, methane, carbon dioxide, and nitric oxide in controlled soil columns. The sampling system observed reproducible responses of soil gas concentrations to manipulations of soil nutrients and redox state, providing a new window into the microbial response to these key environmental forcings. Using site-specific N 2 O isotopologues as indicators of microbial processes, we constrain the dynamics of in situ microbial activity. Unlocking trace gas messengers of microbial activity will complement -omics approaches, challenge subsurface models, and improve understanding of soil heterogeneity to disentangle interactive processes in the subsurface biome.

04 OIL SHALES AND TAR SANDS↗

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗

In situ measurement and modelling of the growth and length scale of twins in α -uranium

Twinning is an important deformation mechanism in crystalline materials. Twins nucleate, then grow, forming a discrete pattern of deformation bands with a certain thickness. The mechanism for twin growth is not completely understood. We present a simple phase field model which captures the physics of twin growth and reproduces the details observed during in situ electron backscatter diffraction experiments on α-uranium. The interaction between residual dislocations at twin interfaces and mobile dislocations in untwinned regions increases the stress needed for twin growth. This is described by a nonlocal term in the proposed constitutive equations: the nucleation stress of a twin increases proportionally to the twin phase field in a neighborhood. Competition between slip and twinning favors the nucleation of a new twin rather than the growth of a preexisting twin. The phase field model is coupled with a crystal plasticity finite element solver that includes the plastic deformation due to twinning. Simulations are able to reproduce the number of twins and their thicknesses as a function of the strain observed during in situ electron backscatter diffraction experiments. The stress-strain curve is also reproduced. This comparison allows the values of the nucleation stress and the interaction strength between residual and mobile dislocations to be found. It also gives an estimation of the density of residual dislocations that is consistent with the observed twin thickness. Finally, this model can be applied to understand microstructural effects in materials using twinning as a strengthening mechanism.

36 MATERIALS SCIENCE↗

4.0 MOOSE: Enabling massively parallel Multiphysics simulation

Approaching 18 years of existence, MOOSE—the Multiphysics Object-Oriented Simulation Environment—is being developed at a higher pace than ever before. With significant support from four research institutions across the globe, and dozens of new contributors, the capabilities of the framework are being expanded to meet modeling challenges in a wide variety of fields from nuclear system design, to geomechanics, to material science. This includes new development in equation discretization techniques, solver methods, meshing capabilities, application deployment, and user interface improvements. Applications built on MOOSE benefit from all these improvements.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗