Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Discrete Element Modeling”

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 739 records · Page 41

TOWARD A NEW KIND OF ASTEROSEISMIC GRID FITTING

Recent developments in instrumentation (e.g., in particular the Kepler and CoRoT satellites) provide a new opportunity to improve the models of stellar pulsations. Surface layers, rotation, and magnetic fields imprint erratic frequency shifts, trends, and other non-random behavior in the frequency spectra. As our observational uncertainties become smaller, these are increasingly important and difficult to deal with using standard fitting techniques. To improve the models, new ways to compare their predictions with observations need to be conceived. In this paper, we present a completely probabilistic (Bayesian) approach to asteroseismic model fitting. It allows for varying degrees of prior mode identification, corrections for the discrete nature of the grid, and most importantly implements a treatment of systematic errors, such as the 'surface effects'. It removes the need to apply semi-empirical corrections to the observations prior to fitting them to the models and results in a consistent set of probabilities with which the model physics can be probed and compared. As an example, we show a detailed asteroseismic analysis of the Sun. We find a most probable solar age, including a 35 {+-} 5 million year pre-main-sequence phase, of 4.591 billion years, and initial element mass fractions of X{sub 0} = 0.72, Y{sub 0} = 0.264, Z{sub 0} = 0.016, consistent with recent asteroseismic and non-asteroseismic studies.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimal Design of Intensified Towers for CO2 Capture with Internal, Printed Heat Exchangers

Solvent-based carbon capture processes typically suffer from the temperature rise of the solvent due to the heat of absorption of CO2. This increased temperature is not thermodynamically favor-able and results in a significant reduction in performance in the absorber column. As opposed to interstage coolers, which only remove, cool, and return the solvent at discrete locations in the column, internal coolers that are integrated with the packing can cool the process inline, which can result in improved efficiency. This work presents the modeling of these internal coolers within an existing generic, equation-oriented absorber column model that can cool the process while allowing for simultaneous mass transfer. Optimization of this model is also performed, which is capable of optimally choosing the best locations to place these devices, such that heat removal and mass transfer area are balanced. Results of the optimization have shown that optimally placed cooling elements result in a significant increase in the capture efficiency of the process, compared to a similar column with no internal cooling, with a common trend being the cooling of the column in the temperature bulge region. It is observed that by optimally placing an internal cooler, the solvent flow rate can be decreased, and the CO2 lean loading can be increased while still maintaining the same efficiency. These process changes can lead to a substantial reduction in costs due to lower reboiler duty.

Summits, Stephen↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

36 MATERIALS SCIENCE↗

PDE-constrained Optimization under Uncertainty

Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.

42 ENGINEERING↗

A robust framework for frictional fault contact in geological formations using a stabilized augmented Lagrangian approach

Numerical simulations are essential to evaluate the performance and safety of engineered subsurface systems such as geological carbon storage sites, enhanced geothermal fields, and oil and gas reservoirs. A key challenge lies in accurately modeling the frictional contact behavior along fault surfaces. This problem involves inequality constraints that arise from the physics of frictional slip, requiring specialized numerical methods to handle the resulting highly nonlinear and path-dependent behavior. Here, in this work, we address this challenge using an Augmented Lagrangian Method (ALM) implemented via the Uzawa algorithm. The formulation employs mixed finite element spaces, combining low-order piecewise linear displacements within the 3D domain cells with piecewise constant tractions defined on the fault surfaces. Furthermore, to ensure stability and satisfy the inf-sup condition, the discrete displacement space is enriched with face bubble functions on both sides of the contact interfaces. This approach offers several advantages over other stabilization techniques that rely on additional terms, and it integrates naturally in the Uzawa framework.

58 GEOSCIENCES↗

Learning in continuous action space for developing high dimensional potential energy models

Reinforcement learning (RL) approaches that combine a tree search with deep learning have found remarkable success in searching exorbitantly large, albeit discrete action spaces, as in chess, Shogi and Go. Many real-world materials discovery and design applications, however, involve multi-dimensional search problems and learning domains that have continuous action spaces. Exploring high-dimensional potential energy models of materials is an example. Traditionally, these searches are time consuming (often several years for a single bulk system) and driven by human intuition and/or expertise and more recently by global/local optimization searches that have issues with convergence and/or do not scale well with the search dimensionality. Here, in a departure from discrete action and other gradient-based approaches, we introduce a RL strategy based on decision trees that incorporates modified rewards for improved exploration, efficient sampling during playouts and a “window scaling scheme" for enhanced exploitation, to enable efficient and scalable search for continuous action space problems. Using high-dimensional artificial landscapes and control RL problems, we successfully benchmark our approach against popular global optimization schemes and state of the art policy gradient methods, respectively. We demonstrate its efficacy to parameterize potential models (physics based and high-dimensional neural networks) for 54 different elemental systems across the periodic table as well as alloys. We analyze error trends across different elements in the latent space and trace their origin to elemental structural diversity and the smoothness of the element energy surface. Broadly, our RL strategy will be applicable to many other physical science problems involving search over continuous action spaces.

36 MATERIALS SCIENCE↗

TADSim: Discrete Event-based Performance Prediction for Temperature Accelerated Dynamics

Next-generation high-performance computing will require more scalable and flexible performance prediction tools to evaluate software--hardware co-design choices relevant to scientific applications and hardware architectures. Here, we present a new class of tools called application simulators—parameterized fast-running proxies of large-scale scientific applications using parallel discrete event simulation. Parameterized choices for the algorithmic method and hardware options provide a rich space for design exploration and allow us to quickly find well-performing software--hardware combinations. We demonstrate our approach with a TADSim simulator that models the temperature-accelerated dynamics (TAD) method, an algorithmically complex and parameter-rich member of the accelerated molecular dynamics (AMD) family of molecular dynamics methods. The essence of the TAD application is captured without the computational expense and resource usage of the full code. We accomplish this by identifying the time-intensive elements, quantifying algorithm steps in terms of those elements, abstracting them out, and replacing them by the passage of time. We use TADSim to quickly characterize the runtime performance and algorithmic behavior for the otherwise long-running simulation code. We extend TADSim to model algorithm extensions, such as speculative spawning of the compute-bound stages, and predict performance improvements without having to implement such a method. Validation against the actual TAD code shows close agreement for the evolution of an example physical system, a silver surface. Finally, focused parameter scans have allowed us to study algorithm parameter choices over far more scenarios than would be possible with the actual simulation. This has led to interesting performance-related insights and suggested extensions.

97 MATHEMATICS AND COMPUTING↗

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↗

The Chemical Abundance Structure of the Inner Milky Way: A Signature of “Upside-down” Disk Formation

We present a model for the [α/Fe]--[Fe/H] distribution of stars in the inner Galaxy, 3 kpc<R<5 kpc, measured as a function of vertical distance |z| from the midplane by Hayden et al. (H15). Motivated by an “upside-down” scenario for thick disk formation, in which the thickness of the star-forming gas layer contracts as the stellar mass of the disk grows, we combine one-zone chemical evolution with a simple prescription in which the scale-height of the stellar distribution drops linearly from z{sub h}=0.8 kpc to z{sub h}=0.2 kpc over a timescale t {sub c}, remaining constant thereafter. We assume a linear-exponential star formation history, M-dot {sub ∗}(t)∝te{sup −t/t{sub s}{sub f}}. With a star formation efficiency timescale τ{sub ∗}=M{sub g}(t)/ M-dot {sub ∗}(t)=2 Gyr, an outflow mass-loading factor η= M-dot {sub out}(t)/ M-dot {sub ∗}(t)=1.5, t{sub sf}=3 Gyr, and t{sub c}=2.5 Gyr, the model reproduces the observed locus of inner disk stars in [α/Fe]--[Fe/H] and the metallicity distribution functions (MDFs) measured by H15 at |z|=0--0.5 kpc, 0.5--1 kpc, and 1--2 kpc. Substantial changes to model parameters lead to disagreement with the H15 data; for example, models with t{sub c}=1 Gyr or t{sub sf}=1 Gyr fail to match the observed MDF at high-|z| and low-|z|, respectively. The inferred scale-height evolution, with z {sub h}(t) dropping on a timescale t{sub c}∼t{sub sf} at large lookback times, favors upside-down formation over dynamical heating of an initially thin stellar population as the primary mechanism regulating disk thickness. The failure of our short-t {sub c} models suggests that any model in which thick disk formation is a discrete event will not reproduce the continuous dependence of the MDF on |z| found by H15. Our scenario for the evolution of the inner disk can be tested by future measurements of the |z|-distribution and the age–metallicity distribution at R=3--5 kpc.

79 ASTRONOMY AND ASTROPHYSICS↗

Very small-scale, segregating-fluidized-bed experiments: A dataset for CFD-DEM validation and uncertainty quantification

IWe report fluidization experiments were conducted on a small scale and with a rapid response (short duration) to enable corresponding simulations at low-computational cost. Rise times are reported for four or fewer polyethylene particles (intruders) in an air-fluidized bed of ~5000 group D glass beads. Experimental inputs were completely characterized—particle properties, system dimensions and operating conditions—which is necessary for validating computational fluid mechanics (CFD)-discrete element method (DEM) including a comprehensive uncertainty quantification (UQ) analysis. Input uncertainties are reported as bounds or cumulative distribution functions of measured values. The staggering number of simulations required to complete a UQ analysis (~O[10 4 ] simulations corresponding to ~5 uncertain inputs) motivates this study. These segregating-bed experiments are designed to permit analogous CFD-DEM simulations to complete in less than a day on a single (~2.5 GHz) computational processor unit (CPU). Segregation times are reported for several operating conditions, intruder sizes, and initial configurations, providing a rich dataset for numerical model testing, validation and UQ.

42 ENGINEERING↗

Inverse scattering transform for the nonlinear Schroedinger system on a zigzag-runged ladder lattice

A detailed description of four-component nonlinear Schroedinger system on zigzag-runged ladder lattice is given. In order to support the equivalence between the two pairs of field amplitudes, we introduce the two sets of auxiliary linear problems, allowing one to develop the inverse scattering technique in the most adequate symmetrical form. The two complementary sets of discrete Marchenko equations are derived and their multisoliton solutions for the true reflectionless field amplitudes are found. The dispersion relations for the diagonal elements of reduced monodromy matrices are obtained. We explicitly present the simplest realization of soliton dynamics corresponding to the time-independent intersite coupling parameters and zero Peierls phases and show that the two-site structure of the lattice unit cell is strictly manifested as the two splitted branches of soliton excitations. In the general case of time-dependent intersite coupling parameters and nonzero Peierls phases, the theory is capable to model the dynamics of parametrically driven nonlinear ladder systems subjected to external magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fundamental length in quantum theories with PT-symmetric Hamiltonians. II. The case of quantum graphs

PT-symmetrization of quantum graphs is proposed as an innovation where an adjustable, tunable nonlocality is admitted. The proposal generalizes the PT-symmetric square-well models of Ref. [M. Znojil, Phys. Rev. D 80, 045022 (2009).] (with real spectrum and with a variable fundamental length {theta}) which are reclassified as the most elementary quantum q-pointed-star graphs with minimal q=2. Their equilateral q=3,4,... generalizations are considered, with interactions attached to the vertices. Runge-Kutta discretization of coordinates simplifies the quantitative analysis by reducing our graphs to star-shaped lattices of N=qK+1 points. The resulting bound-state spectra are found real in an N-independent interval of couplings {lambda} is an element of (-1,1). Inside this interval the set of closed-form metrics {theta}{sub j}{sup (N)}({lambda}) is constructed, defining independent eligible local (at j=0) or increasingly nonlocal (at j=1,2,...) inner products in the respective physical Hilbert spaces of states H{sub j}{sup (N)}({lambda}). In this way each graph is assigned a menu of nonequivalent, optional probabilistic quantum interpretations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mechanistic model for creep and thermal aging in Alloy 709

This report describes a physics-based model for creep and thermal aging in Alloy 709. Alloy 709 is an advanced austenitic alloy, targeted for use in future Sodium Fast Reactors (SFRs) and other advanced reactors. The material has superior high temperature properties compared to currently qualified 316 and 304 stainless steels. However, the available creep and thermal aging test database for Alloy 709 is significantly more limited compared to the historical materials. The physics-based model developed here is one way to accelerate the qualification of the material by providing more accurate long-term predictions for creep properties and thermal aging, compared to current empirical time-extrapolate techniques. The crystal plasticity finite element model is used to predict the deformation and failure of alloy 709. The same setup for the CPFE model is used in both the baseline model calibration process and the simulation campaigns for parameter inference. Specific constitutive choices are made for Alloy 709 to capture the primary deformation mechanisms. The dislocation creep formulation developed by Hu and Cocks is extended to account for coupled precipitation formation and the grain boundary cavitation model developed by Sham, Needleman, et al. is used to model grain boundary cavitation-induced failure. A novel update algorithm is proposed to render the semi-discrete constitutive update for the Sham-Needleman model unconditionally stable. A progressive calibration approach is adopted based on the observations that several types of material responses can be effectively decoupled. A surrogate model is trained based on full-fledged CPFE simulations to accelerate the forward model evaluations, and stochastic variational inference (SVI) is used to calibrate the unknown microstructural model parameters. The calibrated mechanistic model is used to predict the long-term creep life of Alloy 709, and the predictions are compared against classical empirical approaches.

36 MATERIALS SCIENCE↗

Assessment of different coarse graining strategies to simulate polydisperse gas-solids flow

Continuum methods require the additional development of solids stress closures for polydisperse powders based on complex kinetic theories that are non-trivial to develop, code, and numerically converge for the wide range of fluidization regimes from very dilute to dense/frictional flow limit. On the other hand, it is straightforward to model the flow of polydisperse granular materials by treating particles as discrete rigid bodies that are tracked following simple physical laws of motion. The coarsening of these discrete methods by lumping several particles in a parcel alleviates the significant computational cost associated with these discrete methods while introducing some inaccuracies in the numerical results. In this research, we explore two different coarse graining methods that can be applied to polydisperse powders, namely the same statistic weight method (SSW) and the same size parcel method (SSP), and assess their accuracy by comparison with the finest simulation results obtained with a discrete element method (DEM). For Geldart group B powders fluidized at a relative low superficial velocity, the numerical results indicate that the SSW is more accurate than the SSP method. For type A powders fluidized at relatively high velocity, these two methods predict similar results. Interestingly, up to four times increase in the speed of simulation of the SSP method was obtained because the original polydisperse powder is scaled to a mono-disperse system in terms of particle-particle collision. Lastly, these results suggest that the SSP method is more favorable for the simulation of fluidized beds due to its accuracy and efficiency while the SSW method may be used for granular flow and dense fluidized bed systems where capturing the size segregation of particles due to collision is important.

42 ENGINEERING↗

Enabling Parallel Execution of System-level Simulations in SAM

This report summarizes the recent code updates related to “element ghosting” in SAM to enable the parallel execution of system-level simulations using multiple processors/cores. Unlike typical MOOSE-based applications, for system-level simulations, SAM mostly deals with a collection of discrete small pieces of meshes, and the connection of physics on these meshes are realized by using “connector” types of components/code structures, such as conjugate heat transfer and flow junctions. The required code implementation is to correctly mark the necessary ghost elements for each type of such components/code structures; thus, the lower-level libraries can correctly perform the necessary data transfer between processors (CPUs) when executed in parallel mode. After the code updates, SAM can now run system-level simulations in the parallel mode. The parallel execution capability was then tested with an ABTR input model with 23k DOFs. Significant speedup was demonstrated when the optimal number of CPUs were used in parallel mode. Future systematic studies on parallelization performance using additional test cases covering different physics/scenarios will be needed to provide additional insights into the scalability of SAM parallelization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Direct Prediction of Phonon Density of States With Euclidean Neural Networks

Abstract Machine learning has demonstrated great power in materials design, discovery, and property prediction. However, despite the success of machine learning in predicting discrete properties, challenges remain for continuous property prediction. The challenge is aggravated in crystalline solids due to crystallographic symmetry considerations and data scarcity. Here, the direct prediction of phonon density‐of‐states (DOS) is demonstrated using only atomic species and positions as input. Euclidean neural networks are applied, which by construction are equivariant to 3D rotations, translations, and inversion and thereby capture full crystal symmetry, and achieve high‐quality prediction using a small training set of examples with over 64 atom types. The predictive model reproduces key features of experimental data and even generalizes to materials with unseen elements, and is naturally suited to efficiently predict alloy systems without additional computational cost. The potential of the network is demonstrated by predicting a broad number of high phononic specific heat capacity materials. The work indicates an efficient approach to explore materials' phonon structure, and can further enable rapid screening for high‐performance thermal storage materials and phonon‐mediated superconductors.

97 MATHEMATICS AND COMPUTING↗

Numerical Evidence of Multiple Solutions for the Reynolds-Averaged Navier–Stokes Equations

In this paper, evidence is presented for the existence of multiple solutions of Reynolds-averaged Navier–Stokes equations with the one-equation Spalart–Allmaras and two-equation Wilcox $k-ω$ turbulence models on fixed grids in three dimensions and how they were obtained is described. The two major configurations considered are an “academic” extruded two-dimensional airfoil geometry and the trap wing test case. The observed appearance of the multiple solutions seems to be closely related to smooth body separation (sometimes massive) routinely observed in flows over high-lift configurations, especially near stall angles of attack. The results are obtained and cross-verified with two stabilized finite-element codes (streamwise upwind Petrov–Galerkin), which provide residual converged results for complex flows with second-order discretizations. In the paper, the ways multiple solutions have been obtained are described, including such obvious ones as providing a different initial guess to the steady-state solver as well as somewhat unexpected (in this context) techniques of using implicit residual smoothing while time marching to steady state. The phenomenon of the so-called pseudosolutions is also discussed, which is loosely defined as solutions to the discrete system of equations having “sharp” convergence behavior (sometimes up to six to seven orders of the relative residual reduction), which fail to achieve the stronger, machine-zero convergence criterion. Some numerical observations are also presented on the sensitivity of the obtained multiple solutions to the discretization and grid perturbations.

Engineering↗