Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete particle 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 235 records · Page 13

On a Spectral Method for β -particle Bound Excitation Collisions in Kilonovae

The interaction of β-particles with the weakly ionized plasma background is an important mechanism for powering the kilonova (KN) transient signal from neutron star mergers. For this purpose, we present an implementation of the approximate fast-particle collision kernel, described by Inokuti following the seminal formulation of Bethe, in a spectral solver of the Vlasov–Maxwell–Boltzmann equation. In particular, we expand the fast-particle plane-wave atomic excitation kernel into coefficients of the Hermite basis, and derive the relevant discrete spectral system. In this fast-particle limit, the approach permits the direct use of atomic data, including optical oscillator strengths, normally applied to photon–matter interaction. The resulting spectral matrix is implemented in the MASS-APP spectral solver framework, in a way that avoids full matrix storage per spatial zone. We numerically verify aspects of the matrix construction, and present a proof-of-principle 3D simulation of a 2D axisymmetric KN ejecta snapshot. Our preliminary numerical results indicate that a reasonable choice of Hermite basis parameters for β-particles in the KN is a bulk velocity parameter u = 0, a thermal velocity parameter α = 0.5c, and a 9 × 9 × 9 mode velocity basis set (Hermite orders of 0–8 in each dimension). For interior-ejecta sample zones, we estimate that the ratio of thermalization from large-angle (≳2fdg5) bound excitation scattering to total thermalization is ~0.002–0.003.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparing Control Performance Between Simulation and Experiment using the Microreactor Automated Control System Testbed

In the advanced reactor domain, a flexible and scalable software/hardware infrastructure is crucial for integrating and validating various control technologies. This study used the Microreactor Automated Control System (MACS) hardware platform as a testbed. MACS was originally designed to mirror Idaho National Laboratory (INL)'s Microreactor Applications Research Validation and Evaluation (MARVEL), a 85-kW thermal fission microreactor. It features control drums for simulated reactivity control; lights that function as a surrogate reactor core, with the brightness being proportional to the reactor power; and light sensors that emulate neutron detectors. To transform MACS into a physical twin of MARVEL for evaluating control methods, the Control and Optimization Modular Modeling Application for Nuclear Deployment (COMMAND) software was employed. This software integrated the hardware with two models of the MARVEL core, based on Reactor Excursion and Leak Analysis Program (RELAP5-3D) and Monte Carlo N-Particle (MCNP) models. The study aimed to demonstrate the gap between control theory and actual practice—a gap that often necessitates empirical adjustments such as control gain retuning, filters, time discretization, and integrator anti-windup measures. Controllers were developed based on increasingly complex simulations without hardware, starting from the base MARVEL model and then introducing actuator saturation constraints and sensor noise. The final control strategy was then tested using MACS, and a comparative performance analysis was conducted.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

HOSS: an implementation of the combined finite-discrete element method

Nearly thirty years since its inception, the combined finite-discrete element method (FDEM) has made remarkable strides in becoming a mainstream analysis tool within the field of Computational Mechanics. FDEM was developed to effectively “bridge the gap” between two disparate Computational Mechanics approaches known as the finite and discrete element meth-ods. At Los Alamos National Laboratory (LANL) researchers developed the Hybrid Optimization Software Suite (HOSS) as a hybrid multi-physics platform, based on FDEM, for the simulation of solid material behavior complemented with the latest technological enhancements for full fluid–solid interaction. Furthermore, in HOSS, several newly developed FDEM algorithms have been implemented that yield more accurate material deformation formulations, inter-particle interaction solvers, and fracture and fragmentation solutions. Additionally, an explicit computational fluid dynamics solver and a novel fluid–solid interaction algorithms have been fully integrated (as opposed to coupled) into the HOSS’ solid mechanical solver, allowing for the study of an even wider range of problems. Advancements such as this are leading HOSS to become a tool of choice for multi-physics problems. Finally, HOSS has been successfully applied by a myriad of researchers for analysis in rock mechanics, oil and gas industries, engineering application (structural, mechanical and biomedical engineering), mining, blast loading, high velocity impact, as well as seismic and acoustic analysis. This paper intends to summarize the latest development and application efforts for HOSS.

58 GEOSCIENCES↗

Particle Tracking Methods for Battery Precipitation Reactions

Precipitation and deposition reactions at solid–liquid interfaces play a key role in a number of battery chemistries, including Li-ion, so-called “anode free” batteries, zinc-based battery chemistries, and lithium–sulfur, among others. Although models with heterogeneous nucleation and growth phenomena are present in the literature, papers have not to date provided much detail on the numerical algorithms used to track the temporal evolution of the particle size distribution of deposits on electrode surfaces. In this paper we examine several approaches to discretize and track the particle size distribution, demonstrating that common approaches lead to anomalous flattening of the particle size distribution. We conclude by presenting an algorithm that preserves the appropriate particle size distribution during particle growth.

Algorithms↗

A hybrid calibration approach to Hertz-type contact parameters for discrete element models

This study aims at providing a hybrid calibration framework to estimate Hertz-type contact parameters (particle-scale shear modulus and Poisson ratio) for both two-dimensional and three-dimensional discrete element modelling (DEM). On the basis of statistically isotropic granular packings, a set of analytical formulae between macroscopic material parameters (Young modulus and Poisson ratio) and particle-scale Hertz-type contact parameters for granular systems are derived under small-strain isotropic stress conditions. However, the derived analytical solutions are only estimated values for general models. By viewing each DEM modelling as an implicit mathematical function taking the particle-level parameters as independent variables and employing the derived analytical solutions as the initial input parameters, an automatic iterative scheme is proposed to obtain the calibrated parameters with higher accuracies. Considering highly nonlinear features and discontinuities of the macro-micro relationship in Hertz-based discrete element models, the adaptive moment estimation algorithm is adopted in this study because of its capacity of dealing with noise gradients of cost functions. Here, the proposed method is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. Noticeable improvements in terms of calibration efficiency and accuracy have been made.

Constitutive law↗

Evaluation of Attila and MCNP computational methods for dose and exposure estimation

Radiation transport calculations are often used to estimate dose or exposure to components and personnel surrounding a radiation source. The sources for these calculations are decaying radionuclides within various nuclear materials. Historically, dose calculations use MCNP (Monte Carlo N-Particle) transport code as the primary particle transport tool without a secondary computational tool to validate the results from the MCNP simulations [1]. The goal of this study is to make an independent check of the Monte Carlo solution from MCNP6 Version 6.2.1 with the discrete ordinates solution from Attila 10.2.0 Beta 3. As an example problem for this study, water-filled, stainless-steel vessels, modeled with an unstructured mesh (UM) with both MCNP and Attila [2], are exposed to 252Cf and 60Co point sources. This report also includes a discussion of the limitations of unstructured mesh in a MCNP calculation.

61 RADIATION PROTECTION AND DOSIMETRY↗

A model for discrete fracture-clay rock interaction incorporating electrostatic effects on transport

Abstract A model based on the code CrunchClay is presented for a fracture-clay matrix system that takes electrostatic effects on transport into account. The electrostatic effects on transport include those associated with the development of a diffusion potential as captured by the Nernst-Planck equation, and the formation of a diffuse layer bordering negatively charged clay particles within which partial anion exclusion occurs. The model is based on a dual continuum formulation that accounts for diffuse layer and bulk water pore space, providing a more flexible framework than is found in the classical mean electrostatic potential models. The diffuse layer model is obtained by volume averaging ion concentrations in the Poisson-Boltzmann equation, but also includes the treatment of longitudinal transport within this continuum. The calculation of transport within the bulk and diffuse layer porosity is based on a new formulation for the Nernst-Planck equation that considers averaging of diffusion coefficients and accumulation factors at grid cell interfaces. Equations for function residuals and the associated Jacobian matrix are presented such that the system of nonlinear differential-algebraic equations can be solved with Newton’s method. As an example, we consider a 2D system with a single discrete fracture within which flow and advective transport occurs that is coupled to diffusion in the clay-rich matrix. The simulation results demonstrate the lack of retardation for anions (e.g., 36 Cl − ) of the contaminant plume within the fracture flow system because they are largely excluded from the charged clay rock, while the migration of cations (e.g., 90 Sr ++ ) is more strongly attenuated. The diffusive loss of divalent cations in particular from the fracture is accentuated by their accumulation in the diffuse layer within the clay-rich matrix.

58 GEOSCIENCES↗

Immortal rays: Rethinking random ray neutron transport on GPU architectures

The Random Ray Method (TRRM) is a recently developed adaptation of the Method of Characteristics for neutral particle transport simulations. TRRM has demonstrated excellent performance on 3D nuclear reactor benchmark problems using CPU-based compute systems. When porting to GPU-based systems, however, new performance challenges arise that are unique to processors targeting massive fine-grained parallelism. For smaller problems, or for large problems that are domain decomposed across many computational nodes, the problem size per node has insufficient parallelism to saturate GPU node resources, thus greatly limiting speedup. In this study, we report on a newly developed “immortal ray” variant of TRRM. Here, the immortal ray technique exposes significantly more fine-grained parallelism by fundamentally reformulating the numerical details of ray discretization, resulting in performance tradeoffs with significant overall benefit on GPUs. For very small 2D simulation problems we found the new immortal ray variant allowed for up to a 4.4x speedup when run on a single GPU. For larger 3D simulation problems we found the new variant improved strong scaling by 3x when run on the Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fermionic Partial Tomography via Classical Shadows

Here we propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of ($^{n}_{k}$)k 3/2 log(n)/ϵ 2 repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k ≥ 2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2–5 times more repetitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of Generation of Higher-Order Neutron Scattering Cross Sections

The generation of high-order neutron scattering cross sections consistent with high-fidelity simulations remains an area of active research. Popular options include generating cross sections from continuous energy Monte Carlo calculations or generating cross sections from a deterministic neutron transport calculation with high-fidelity tabulated cross sections. Both options present challenges. Monte Carlo simulations can naturally process continuous energy cross section data and allow for the general description of anisotropic neutron scattering given a scattering law. However, Monte Carlo simulations are inherently related to particle weighting and it has been suggested that this may be unacceptable for generating high-order neutron scattering cross sections. Deterministic neutron transport calculations can easily calculate high-order moments of the flux to appropriately calculate higher-order neutron scattering cross sections but are generally limited by discretization of space, energy, and angle. In this work, the trade-offs between generation of high-order neutron scattering cross sections via Monte Carlo and deterministic neutron transport methods are investigated. The methods implemented in the Monte Carlo computer program Serpent and the deterministic fast reactor neutron cross section generator MC2-3 are compared. Cross sections resulting from these methods are used in Rattlesnake, a deterministic neutron transport code developed by Idaho National Laboratory (INL), and results are compared to a reference continuous energy Monte Carlo calculation. Whereas previous work investigating the effects of anisotropic neutron scattering has focused on light water reactor (LWR) simulations, this work focuses on high-order neutron scattering cross sections as they relate to fast reactor simulations. To investigate the consequences of the Serpent and MC2-3 methodologies, a test problem is developed. The test problem is a one-dimensional geometry with fast reactor materials designed to demonstrate deep penetration and exacerbate the effects of high-order neutron scattering. Based on the results of the deep penetration test problem, it is concluded that P3 neutron scattering cross sections are sufficient to describe anisotropic scattering in fast reactor materials. Any neutron scattering of order higher than P3 offers negligible change in the eigenvalue of the test problem. Additionally, it is determined that the methodology as implemented in Serpent is applicable for generating high-order neutron scattering cross sections through at least P3 in fast reactor materials.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A soft departure from jamming: the compaction of deformable granular matter under high pressures

Here, the high-pressure compaction of three-dimensional granular packings is simulated using a bonded particle model (BPM) to capture linear elastic deformation. In the model, grains are represented by a collection of point particles connected by bonds. A simple multibody interaction is introduced to control Poisson's ratio and the arrangement of particles on the surface of a grain is varied to model both high- and low-frictional grains. At low pressures, the growth in packing fraction and coordination number follows the expected behavior near jamming and exhibit friction dependence. As the pressure increases, deviations from the low-pressure power-law scaling emerge after the packing fraction grows by approximately 0.1 and results from simulations with different friction coefficients converge. These results are compared to predictions from traditional discrete element method simulations which, depending on the definition of packing fraction and coordination number, may only differ by a factor of two. As grains deform under compaction, the average volumetric strain and asphericity, a measure of the change in the shape of grains, are found to grow as power laws and depend heavily on the Poisson's ratio of the constituent solid. Larger Poisson's ratios are associated with less volumetric strain and more asphericity and the apparent power-law exponent of the asphericity may vary. The elastic properties of the packed grains are also calculated as a function of packing fraction. In particular, we find the Poisson's ratio near jamming is 1/2 but decreases to around 1/4 before rising again as systems densify.

36 MATERIALS SCIENCE↗

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

Implementation of higher-order velocity mapping between marker particles and grid in the particle-in-cell code XGC

The global total-f gyrokinetic particle-in-cell code XGC, used to study transport in magnetic fusion plasmas or to couple with a core gyrokinetic code while functioning as an edge gyrokinetic code, implements a five-dimensional continuum grid to perform the dissipative operations, such as plasma collisions, or to exchange the particle distribution function information with a core code. To transfer the distribution function between marker particles and a rectangular two-dimensional velocity-space grid, XGC employs a bilinear mapping. The conservation of particle density and momentum is accurate enough in this bilinear operation, but the error in the particle energy conservation can become undesirably large and cause non-negligible numerical heating in a steep edge pedestal. In the present work we update XGC to use a novel mapping technique, based on the calculation of a pseudo-inverse, to exactly preserve moments up to the order of the discretization space. Here we describe the details of the implementation and we demonstrate the reduced interpolation error for a tokamak test plasma using first- and second-order elements with the pseudo-inverse method and comparing with the bilinear mapping.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast nonlinear iterative solver for an implicit, energy-conserving, asymptotic-preserving charged-particle orbit integrator

Here recently, an asymptotic-preserving (AP) particle orbit integrator has been proposed with remarkable properties including exact energy conservation, the ability to capture of all first-order drifts (including the ∇B-drift), the ability to capture trapped-passing boundaries with parallel velocity extremely close to the critical velocity, and the ability to transition from strongly to weakly magnetized spatial regions. The new AP orbit integrator is implicit, employing a Crank-Nicolson (CN) temporal discretization to ensure exact energy conservation. This, in turn, requires a local nonlinear iteration involving particle velocities and positions, and the local electromagnetic fields, to obtain the new-time solution. Ref. [1] did not attempt to provide an efficient solver for this system, and employed a brute-force GMRES-driven Jacobian-free Newton-Krylov (JFNK) solver to invert the particle orbit equations at every timestep for expediency. While JFNK is robust and reliable, it is also expensive and very intrusive for practical implementations of the method (it requires having the JFNK machinery available and solving a 6 x 6 Jacobian system iteratively once per iteration per particle).

97 MATHEMATICS AND COMPUTING↗

Exascale Multiphysics Nuclear Reactor Simulations for Advanced Designs

ENRICO is a coupled application developed under the U.S. Department of Energy's Exascale Computing Project (ECP) targeting the modeling of advanced nuclear reactors. It couples radiation transport with heat and fluid simulation, including the high-fidelity, highresolution Monte-Carlo code Shift and the Computational fluid dynamics code NekRS. NekRS is a highly-performant open-source code for simulation of incompressible and low-Mach fluid flow, heat transfer, and combustion with a particular focus on turbulent flows in complex domains. It is based on rapidly convergent high-order spectral element discretizations that feature minimal numerical dissipation and dispersion. State-of-the-art multilevel preconditioners, efficient high-order time-splitting methods, and runtime-adaptive communication strategies are built on a fast OCCA-based kernel library, libParanumal, to provide scalability and portability across the spectrum of current and future high-performance computing platforms. On Frontier, Nek5000/RS has recently achieved an unprecedented milestone in breaching over 1 billion spectral elements and 350 billion degrees of freedom. Shift has demonstrated the capability to transport upwards of 1 billion particles per second in full core nuclear reactor simulations featuring complete temperature-dependent, continuous-energy physics on Frontier. Shift achieved a weak-scaling efficiency of 97.8% on 8192 nodes of Frontier and calculated 6 reactions in 214,896 fuel pin regions below 1% statistical error yielding first-of-a-kind resolution for a Monte Carlo transport application.

Hamilton, Steven P.↗

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗