Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “deterministic 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 127 records · Page 7

A survey of nonlinear robust optimization

Robust optimization (RO) has attracted great attention from the optimization community over the past decade. RO is dedicated to solving optimization problems subject to uncertainty: design constraints must be satisfied for all the values of the uncertain parameters within a given uncertainty set. Uncertainty sets may be modeled as deterministic sets (boxes, polyhedra, ellipsoids), in which case the RO problem may be reformulated via worst-case analysis, or as families of distributions. The challenge of RO is to reformulate or approximate robust constraints so that the uncertain optimization problem is transformed into a tractable deterministic optimization problem. Most reformulation methods assume linearity of the robust constraints or uncertainty sets of favorable shape, which represents only a fraction of real-world applications. This survey addresses nonlinear RO and includes problem formulations and applications, solution approaches, and available software with code samples.

97 MATHEMATICS AND COMPUTING↗

Analysis of the Zero Relaxation Limit of Hyperbolic Balance Laws with Random Initial Data

We show the convergence of the zero relaxation limit of $2 \times 2$ systems of hyperbolic balance laws with stochastic initial data. Precisely, solutions converge to a solution of the local equilibrium approximation as the relaxation time tends to zero. The initial data are assumed to depend on finitely many random variables, and the convergence is then proved via the appropriate analogues of the compensated compactness methods used in treating the deterministic case. We also demonstrate the validity of this limit in the case of the semilinear $p$-system; the well-posedness of both the system and its equilibrium approximation is proved, and the convergence is shown with no a priori conditions on solutions. Here, this model serves as a prototype for understanding how asymptotic approximations can be used as control variates for hyperbolic balance laws with uncertainty.

$p$-system↗

Impedance Response Influenced by Variability in the Random Distribution of Physical Properties of Coated Materials in Two-Dimensional Space

Heterogeneous physical characteristics of a system featuring a single-layer film on a metallic surface have been explored via its impedance response. The Nyquist plot showed a distorted semicircle, indicative of the system's unique distribution characteristics. Utilizing a copula-based probability method, a two-dimensional deterministic impedance model was successfully integrated, accounting for spatial physical properties such as permittivity and electrical conductivity. This strategy enabled in-depth exploration and mechanistic quantification of a broad spectrum of properties. A quantitative understanding of impedance signal alterations, characterized by normally or log-normally correlated variables, was achieved through the variation in aspect ratio and characteristic frequency of the impedance spectra. Log-normally distributed electrical properties provided a superior representation of the distorted impedance spectra. As coefficient of variation (CV) values fluctuated, the aspect ratio and characteristic frequency showed heightened sensitivity to log-normal permittivity compared to log-normal electrical conductivity. Notably, a marked positive linear correlation between electrical properties resulted in an impedance response that approximated perfect semicircular spectra. The variability in the electrical properties' distribution was demonstrated by considering the correlation coefficient between electrical conductivity and the z-direction position. Furthermore, the highest aspect ratio of the impedance spectra was observed when the electrical conductivity was randomly distributed across the z-direction space.

36 MATERIALS SCIENCE↗

An improved target velocity sampling algorithm for free gas elastic scattering

We present an improved algorithm for sampling the target velocity when simulating elastic scattering in a Monte Carlo neutron transport code that correctly accounts for the energy dependence of the scattering cross section. The algorithm samples the relative velocity directly, thereby avoiding a potentially inefficient rejection step based on the ratio of cross sections. Here, we have shown that this algorithm requires only one rejection step, whereas other methods of similar accuracy require two rejection steps. The method was verified against stochastic and deterministic reference results for upscattering percentages in 238 U. Simulations of a light water reactor pin cell problem demonstrate that using this algorithm results in a 3% or less penalty in performance when compared with an approximate method that is used in most production Monte Carlo codes

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Generalization Bounds↗

The LLNL nuclear data infrastructure for the GNDS data format

The next generation of nuclear data infrastructure tools at the Livermore National Laboratory (LLNL) consists of pipeline of codes that read and process nuclear data from evaluated files saved in the new GNDS (Generalised Nuclear Data Structure) nuclear data format. The processing code FUDGE (For Updating Data and Generating Evaluations) is at the front-end of this pipeline as it reads and process the evaluated data for use in downstream transport codes. FUDGE is Python based with C and C++ extensions for computationally intensive tasks. As is the case for the evaluated data, the processed output is also saved in the GNDS format and the GIDI+ API is provided as the interface between the processed data and the transport codes. GIDI+ is a C++ based suite of codes and it includes GIDI (General Interaction Data Interface), a library for reading and writing GNDS data, and MCGIDI which is the cross section lookup, and reaction and product distribution sampling interface between Monte Carlo transport codes and the GNDS data. GIDI provides methods for easy access to the multi-group processed GNDS data and this is demonstrated through its implementation in ARDRA, the LLNL deterministic transport code. The evaluation and sampling methods in MCGIDI are available as both CPU and GPU methods which facilitates the use of MCGIDI in both traditional CPU-based as well as the next generation mixed model computational architectures. This is demonstrated through the GIDI+ implementation in MERCURY, the LLNL Monte Carlo transport code. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A multigroup moment-accelerated deterministic particle solver for 1-D time-dependent thermal radiative transfer problems

We introduce an efficient, robust, Lagrangian (characteristic-based) transport solver for 1-D time-dependent thermal radiative transfer (TRT) applications within the context of a moment-accelerated (High-Order/Low-Order, HOLO) algorithm. This novel transport algorithm inherits the best features of both particle methods (e.g., time accuracy, phase-space adaptivity, positivity) and deterministic, grid-based methods (e.g., no stochastic noise). Particles are adapted by the method of characteristics, with a time-dependent weight that accounts for stiff absorption and reemission process self-consistently. As a result, this approach is able to obtain accurate results while employing large time steps and a moderate number of particles (compared to Implicit Monte Carlo).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Neutronics and thermal-hydraulics simulation of generic pebble-bed fluoride-salt-cooled high-temperature reactor (gFHR)

The fluoride-salt-cooled high-temperature reactor (FHR) is one type of the advanced reactors and has been attracting great interest from the research institutes and commercial companies in the recent years. However, currently the technology is relatively immature. To facilitate the design and safety analysis of FHRs, Kairos Power published the generic FHR (gFHR) benchmark. In this paper, a hybrid method combining the stochastic code and deterministic code is developed to simulate the gFHR benchmark. Serpent 2 is employed as a few-group cross section generator and the cross sections are applied to the finite difference neutron diffusion code AGREE. A good consistency with the gFHR benchmark is achieved. The agreement between the Serpent 2 results and the AGREE results shows that the hybrid method is applicable to FHRs. The thermal-hydraulics are coupled to neutronics for the steady-state calculations and good agreement between AGREE and SAM is achieved. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Calculation of multi-group migration areas in deterministic transport simulations

Recent work on the Cumulative Migration Method (CMM) has demonstrated that it is possible to define multi-group transport cross sections directly from Monte Carlo spectral calculations by utilizing edits of the energy-dependent neutron migration areas. However, it is difficult to demonstrate that downstream deterministic transport calculations actually preserve Monte Carlo migration areas. This paper addresses this issue by: 1) demonstrating the relationship of migration area with the concept of mean squared displacement, 2) deriving, and validating vs. Monte Carlo, an analytic expression for computing one-group migration areas for a homogeneous medium with energy-independent cross sections, 3) deriving, and validating vs. Monte Carlo, an analytic expression for computing multi-group migration areas for a homogenized medium with energy-dependent cross sections, and 4) rigorously proving that energy condensation of multi-group transport cross section must be inverse flux weighted in order to preserve Monte Carlo neutron migration areas.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Extended Summary: Performance Improvements to the 2D/1D Subplane Method in MPACT

Recent work in MPACT, the primary deterministic neutron transport solver in CASL’s VERA, has focused on significantly improving the overall performance of the calculations and many components within the code have been improved. The paper focuses on the most recent development to improve the 2D/1D subplane method in preparation for a production-level capability. The key developments presented here focus on incorporating a multilevel-in-space CMFD solver that also collapses on the subplane bases, a dynamic subplane meshing capability that better preserves accuracy during control rod movements, and overall usability improvements to make using the subplane method seamless. Compared to the current default 2D/1D solver in MPACT, substantial improvements are demonstrated on two progression problems, including a standard quarter core model, where potential savings observed at ~2× in memory and ~5-6× in core-hour requirements.

Stimpson, Shane G.↗

Performance Improvements to the 2D/1D Subplane Method in MPACT

Recent work in MPACT, the primary deterministic neutron transport solver in CASL’s VERA, has focused on significantly improving the overall performance of the calculations and many components within the code have been improved. The paper focuses on the most recent development to improve the 2D/1D subplane method in preparation for a production-level capability. The key developments presented here focus on incorporating a multilevel-in-space CMFD solver that also collapses on the subplane bases, a dynamic subplane meshing capability that better preserves accuracy during control rod movements, and overall usability improvements to make using the subplane method seamless. Compared to the current default 2D/1D solver in MPACT, substantial improvements are demonstrated on two progression problems, including a standard quarter core model, where potential savings observed at ~2× in memory and ~5-6× in core-hour requirements.

Stimpson, Shane G.↗

Approximate Dynamic Programming With Enhanced Off-Policy Learning for Coordinating Distributed Energy Resources

Herein this paper proposes an innovative approximate dynamic programming (ADP) method for distributed energy resource coordination with the loss of life of battery energy storage system (BESS) explicitly modeled. The dispatch policy is designed to account for both calendrical and cyclical aging effects on BESS, explicitly modeling the impacts of ambient temperature on BESS lifespan. The proposed ADP employs an adaptive critic method and enhanced off-policy deterministic policy gradient (DPG) strategy, addressing the limitations of the on-policy gradient-based ADP approaches, including inadequate exploration, low data usage, and computational complexity. In particular, a customized policy is proposed to guide the algorithm to explore some promising decisions and thereby improve exploration capability and learning efficiency compared to conventional DPG-based learning approaches, which may struggle to find a global optimum due to random noisy action-based exploration or require expert demonstration with extra effort. The proposed method is illustrated using the IEEE 123-node system and compared with the existing ADP methods to prove solution accuracy and demonstrate the effects of incorporating degradation models into control design. Case studies showed that the proposed ADP effectively coordinates DERs with a 10 times smaller optimization gap compared to existing methods, and the incorporation of the BESS life loss model ensures the expected lifespan and results in significant cost savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multirobot Collaborative Pursuit Target Robot by Improved MADDPG

Policy formulation is one of the main problems in multirobot systems, especially in multirobot pursuit-evasion scenarios, where both sparse rewards and random environment changes bring great difficulties to find better strategy. Existing multirobot decision-making methods mostly use environmental rewards to promote robots to complete the target task that cannot achieve good results. This paper proposes a multirobot pursuit method based on improved multiagent deep deterministic policy gradient (MADDPG), which solves the problem of sparse rewards in multirobot pursuit-evasion scenarios by combining the intrinsic reward and the external environment. The state similarity module based on the threshold constraint is as a part of the intrinsic reward signal output by the intrinsic curiosity module, which is used to balance overexploration and insufficient exploration, so that the agent can use the intrinsic reward more effectively to learn better strategies. The simulation experiment results show that the proposed method can improve the reward value of robots and the success rate of the pursuit task significantly. The intuitive change is obviously reflected in the real-time distance between the pursuer and the escapee, the pursuer using the improved algorithm for training can get closer to the escapee more quickly, and the average following distance also decreases.

Zhou, Xiao↗

Probabilistic Forecast of Single–Phase Flow in Porous Media With Uncertain Properties

Uncertainty about geologic makeup and properties of the subsurface renders inadequate a unique quantitative prediction of flow and transport. Instead, multiple alternative scenarios have to be explored within the probabilistic framework, typically by means of Monte Carlo simulations (MCS). These can be computationally expensive, and often prohibitively so, especially when the goal is to compute the tails of a distribution, i.e., probabilities of rare events, which are necessary for risk assessment and decision making under uncertainty. We deploy the method of distributions to derive a deterministic equation for the cumulative distribution function (CDF) of hydraulic head in an aquifer with uncertain (random) hydraulic conductivity. The CDF equation relies on a self-consistent closure approximation, which ensures that the resulting CDF of hydraulic head has the same mean and variance as those computed with either statistical moment equation (the approach used herein) or MCS. We conduct a series of numerical experiments dealing with steady-state two-dimensional flow driven by either a natural hydraulic head gradient or a pumping well. Furthermore, these experiments reveal that the CDF method remains accurate and robust for highly heterogeneous formations with the variance of log conductivity as large as five. For the same accuracy, it is also up to four orders of magnitude faster than MCS in computing hydraulic head with a required degree of confidence (probability).

42 ENGINEERING↗

Harnessing structural stochasticity in the computational discovery and design of microstructures

This paper presents a deep generative model-based design methodology for tailoring the structural stochasticity of microstructures. Although numerous methods have been established for designing deterministic (periodic) or stochastic microstructures, a systematic design approach that allows the unified treatment of both deterministic and stochastic microstructure design domains has yet to be created. The proposed methodology resolves this issue by learning a unified feature space that embodies diverse structural patterns with continuously varying stochasticity levels. A highly diverse microstructure database is established to incorporate various types of deterministic and stochastic microstructure patterns. A property-aware deep generative model is proposed to learn a unified feature space of the structural characteristics, as well as the relationship between structure features and properties of interest. Autoencoder (AE), Variational Autoencoder (VAE), and Adversarial Autoencoder (AAE) are compared to understand their relative merits in the property-aware learning of the unified feature space. Microstructural designs with tailorable stochasticity and properties are obtained by searching the unified feature space. Multiple design cases are presented to demonstrate the capability of designing microstructures for structural stochasticity and properties. Furthermore, the proposed method is employed to create stochastically graded structures, which manipulate the mechanical behaviors by varying the local stochasticity of the structure.

36 MATERIALS SCIENCE↗

High-fidelity Pebble Bed Reactor Depletion Based on Pebble Tracking Transport in Griffin

The pebble tracking transport (PTT) method is a high-fidelity, heterogeneous deterministic transport technique for pebble bed reactor analysis. It discretizes the broad-group neutron transport equation in space and angle with the discontinuous finite element and the discrete ordinates method, and utilizes various solving techniques, including mesh sweeping and diffusion acceleration, to provide pebble- wise reaction rates. This work presents the extension of the PTT method to enable fuel depletion capability in the Griffin code. We discuss the implementation details of the PTT-based high-fidelity depletion where isotope inventory of all individual pebbles is tracked through pre-determined pebble flow paths in the core. The implementation is verified with a generic pebble bed reactor model. Some preliminary equilibrium core results are included. Future works are also discussed.

97 - MATHEMATICS AND COMPUTING↗