Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic simulation algorithm”

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 91 records · Page 5

Extension of moment projection method to the fragmentation process

The method of moments is a simple but efficient method of solving the population balance equation which describes particle dynamics. Recently, the moment projection method (MPM) was proposed and validated for particle inception, coagulation, growth and, more importantly, shrinkage; here the method is extended to include the fragmentation process. The performance of MPM is tested for 13 different test cases for different fragmentation kernels, fragment distribution functions and initial conditions. Comparisons are made with the quadrature method of moments (QMOM), hybrid method of moments (HMOM) and a high-precision stochastic solution calculated using the established direct simulation algorithm (DSA) and advantages of MPM are drawn.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Weak Convergence of a Mass-Structured Individual-Based Model

We propose a model of chemostat where the bacterial population is individually-based, each bacterium is explicitly represented and has a mass evolving continuously over time. The substrate concentration is represented as a conventional ordinary differential equation. These two components are coupled with the bacterial consumption. Mechanisms acting on the bacteria are explicitly described (growth, division and washout). Bacteria interact via consumption. We set the exact Monte Carlo simulation algorithm of this model and its mathematical representation as a stochastic process. We prove the convergence of this process to the solution of an integro-differential equation when the population size tends to infinity. Finally, we propose several numerical simulations.

60 APPLIED LIFE SCIENCES↗

PWR loading pattern optimization with reinforcement learning

The core loading pattern optimization problem belongs to the class of combinatorial optimization problem and has been studied since the dawn of commercial nuclear energy industry. It is characterized by multiple objectives and constraints, with a very high number of candidate patterns, which makes it impossible to solve explicitly. Stochastic optimization methodologies including Genetic Algorithms and Simulated Annealing are used by different nuclear utilities and vendors to perform fuel cycle reload design. Nevertheless, hand-designed solutions continue to be the prevalent method in the industry. To improve the state-of-the-art core reload patterns, we aim to create a method as scalable as possible, that agrees with the designer's goal of performance and safety. To help in this task Deep Reinforcement Learning (DRL), in particular Proximal Policy Optimization is leveraged. DRL has recently experienced a strong impetus from its successes applied to games, sometimes even reaching 'super-human' performances. This paper lays out the foundation of this method and proposes to study the behavior of several hyper-parameters that influence the DRL algorithm. The algorithm is highly dependent on multiple factors such as an exploration/exploitation trade-off that manifests through different parameters such as the number of loading patterns seen and the number of samples collected before a policy update, but also the shape of the objective function derived for the core design. Experimental results also demonstrate the effectiveness of the method in finding high-quality solutions from scratch within a reasonable amount of time. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Scheduling Earth Observing Satellites with Evolutionary Algorithms

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

Globus, Al↗

Real-time calibration of a feedback trap

Feedback traps use closed-loop control to trap or manipulate small particles and molecules in solution. They have been applied to the measurement of physical and chemical properties of particles and to explore fundamental questions in the non-equilibrium statistical mechanics of small systems. These applications have been hampered by drifts in the electric forces used to manipulate the particles. Although the drifts are small for measurements on the order of seconds, they dominate on time scales of minutes or slower. Here, we show that a recursive maximum likelihood (RML) algorithm can allow real-time measurement and control of electric and stochastic forces over time scales of hours. Simulations show that the RML algorithm recovers known parameters accurately. Experimental estimates of diffusion coefficients are also consistent with expected physical properties.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Stochastic noise can be helpful for variational quantum algorithms

Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided, for example, by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle-points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. Published by the American Physical Society 2025

Liu, Junyu↗

An overview of the essential differences and similarities of system identification techniques

Information is given in the form of outlines, graphs, tables and charts. Topics include system identification, Bayesian statistical decision theory, Maximum Likelihood Estimation, identification methods, structural mode identification using a stochastic realization algorithm, and identification results regarding membrane simulations and X-29 flutter flight test data.

Mehra, Raman K.↗

An FEM-MLMC algorithm for a moving shutter diffraction in time stochastic model

We consider a moving shutter and non-deterministic generalization of the diffraction in time model introduced by Moshinsky several decades ago to study a class of quantum transients. We first develop a moving-mesh finite element method (FEM) to simulate the determisitic version of the model. We then apply the FEM and multilevel Monte Carlo (MLMC) algorithm to the stochastic moving-domain model for simulation of approximate statistical moments of the density profile of the stochastic transients.

97 MATHEMATICS AND COMPUTING↗

Fluctuating hydrodynamics and the Rayleigh–Plateau instability

The Rayleigh–Plateau instability occurs when surface tension makes a fluid column become unstable to small perturbations. At nanometer scales, thermal fluctuations are comparable to interfacial energy densities. Consequently, at these scales, thermal fluctuations play a significant role in the dynamics of the instability. These microscopic effects have previously been investigated numerically using particle-based simulations, such as molecular dynamics (MD), and stochastic partial differential equation–based hydrodynamic models, such as stochastic lubrication theory. In this paper, we present an incompressible fluctuating hydrodynamics model with a diffuse-interface formulation for binary fluid mixtures designed for the study of stochastic interfacial phenomena. An efficient numerical algorithm is outlined and validated in numerical simulations of stable equilibrium interfaces. We present results from simulations of the Rayleigh–Plateau instability for long cylinders pinching into droplets for Ohnesorge numbers of Oh = 0.5 and 5.0. Both stochastic and perturbed deterministic simulations are analyzed and ensemble results show significant differences in the temporal evolution of the minimum radius near pinching. Short cylinders, with lengths less than their circumference, were also investigated. As previously observed in MD simulations, we find that thermal fluctuations cause these to pinch in cases where a perturbed cylinder would be stable deterministically. Finally, we show that the fluctuating hydrodynamics model can be applied to study a broader range of surface tension–driven phenomena.

97 MATHEMATICS AND COMPUTING↗

Algorithms and analyses for stochastic optimization for turbofan noise reduction using parallel reduced-order modeling

Simulation-based optimization of acoustic liner design in a turbofan engine nacelle for noise reduction purposes can dramatically reduce the cost and time needed for experimental designs. Because uncertainties are inevitable in the design process, a stochastic optimization algorithm is posed based on the conditional value-at-risk measure so that an ideal acoustic liner impedance is determined that is robust in the presence of uncertainties. A parallel reduced-order modeling framework is developed that dramatically improves the computational efficiency of the stochastic optimization solver for a realistic nacelle geometry. The reduced stochastic optimization solver takes less than 500 s to execute. Additionally, well-posedness and finite element error analyses of the state system and optimization problem are provided.

97 MATHEMATICS AND COMPUTING↗

Stochastic Predictions of Cell Kill During Stereotactic Ablative Radiation Therapy: Do Hypoxia and Reoxygenation Really Matter?

Purpose: To simulate stereotactic ablative radiation therapy on hypoxic and well-oxygenated in silico tumors, incorporating probabilistic parameter distributions and linear-quadratic versus linear-quadratic-cubic methodology and the evaluation of optimal fractionation schemes using biological effective dose (BED{sub α/β=10} {sub or} {sub 3}) comparisons. Methods and Materials: A temporal tumor growth and radiation therapy algorithm simulated high-dose external beam radiation therapy using stochastic methods. Realistic biological proliferative cellular hierarchy and pO{sub 2} histograms were incorporated into the 10{sup 8}-cell tumor model, with randomized radiation therapy applied during continual cell proliferation and volume-based gradual tumor reoxygenation. Dose fractions ranged from 6-35 Gy, with predictive outcomes presented in terms of the total doses (converted to BED) required to eliminate all cells that could potentially regenerate the tumor. Results: Well-oxygenated tumor control BED{sub 10} outcomes were not significantly different for high-dose versus conventional radiation therapy (BED{sub 10}: 79-84 Gy; Equivalent Dose in 2 Gy fractions with α/β of 10: 66-70 Gy); however, total treatment times decreased from 7 down to 1-3 weeks. For hypoxic tumors, an additional 28 Gy (51 Gy BED{sub 10}) was required, with BED{sub 10} increasing with dose per fraction due to wasted dose in the final fraction. Fractions of 9 Gy compromised well for total treatment time and BED, with BED{sub 10}:BED{sub 3} of 84:176 Gy for oxic and 132:278 Gy for non-reoxygenating hypoxic tumors. Initial doses of 12 Gy followed by 6 Gy further increased the therapeutic ratio. When delivering ≥9 Gy per fraction, applying reoxygenation and/or linear-quadratic-cubic cell survival both affected tumor control doses by a significant 1-2 fractions. Conclusions: The complex temporal dynamics of tumor oxygenation combined with probabilistic cell kinetics in the modeling of radiation therapy requires sophisticated stochastic modeling to predict tumor cell kill. For stereotactic ablative radiation therapy, high doses in the first week followed by doses that are more moderate may be beneficial because a high percentage of hypoxic cells could be eradicated early while keeping the required BED{sub 10} relatively low and BED{sub 3} toxicity to tolerable levels.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.

97 MATHEMATICS AND COMPUTING↗

Implicit Kalman filtering

For an implicitly defined discrete system, a new algorithm for Kalman filtering is developed and an efficient numerical implementation scheme is proposed. Unlike the traditional explicit approach, the implicit filter can be readily applied to ill-conditioned systems and allows for generalization to descriptor systems. The implementation of the implicit filter depends on the solution of the congruence matrix equation (A1)(Px)(AT1) = Py. We develop a general iterative method for the solution of this equation, and prove necessary and sufficient conditions for convergence. It is shown that when the system matrices of an implicit system are sparse, the implicit Kalman filter requires significantly less computer time and storage to implement as compared to the traditional explicit Kalman filter. Simulation results are presented to illustrate and substantiate the theoretical developments.

Non-NASA Center↗

Improved Sampling Algorithms in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC approach is developing advanced set of methodologies and algorithms in order to perform Probabilistic Risk Analyses (PRAs). In contrast to classical PRA methods, which are based on Event-Tree and Fault-Tree methods, the RISMC approach largely employs system simulator codes applied to stochastic analysis tools. The basic idea is to randomly perturb (by employing sampling algorithms) timing and sequencing of events and internal parameters of the system codes (i.e., uncertain parameters) in order to estimate stochastic parameters such as core damage probability. This approach applied to complex systems such as nuclear power plants requires to perform a series of computationally expensive simulation runs given a large set of uncertain parameters. These types of analysis are affected by two issues. Firstly, the space of the possible solutions (a.k.a., the issue space or the response surface) can be sampled only very sparsely, and this precludes the ability to fully analyze the impact of uncertainties on the system dynamics. Secondly, large amounts of data are generated and tools to generate knowledge from such data sets are not yet available. This report focuses on the first issue and in particular employs novel methods that optimize the information generated by the sampling process by sampling unexplored and risk-significant regions of the issue space: adaptive (smart) sampling algorithms. They infer system response from surrogate models constructed from existing samples and predict the most relevant location of the next sample. It is therefore possible to understand features of the issue space with a small number of carefully selected samples. In this report, we will present how it is possible to perform adaptive sampling using the RISMC toolkit and highlight the advantages compared to more classical sampling approaches such Monte-Carlo. We will employ RAVEN to perform such statistical analyses using both analytical cases but also another RISMC code: RELAP-7.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Eddy Current Probe Parameters Identification Using a Genetic Algorithm and Simultaneous Perturbation Stochastic Approximation

This study tries to identify the coil parameters using numerical methods. The eddy current testing (ECT) is used for evaluation of a crack with the aid of numerical simulations by utilizing the identification of these parameters. In this study, a comparison of the performance of the GA and SPSA algorithms to identify the parameter values of the coil sensors are presented. So, the optimization probe geometry is introduced in the simulation with Three-dimensional finite element simulations (FLUX finite element code) were conducted to obtain eddy current signals resulting from a crack in a plate made of aluminium. The simulation results are compared with experimental measurements for the defect present in a plate.

42 ENGINEERING↗

A reinforcement learning approach to long-horizon operations, health, and maintenance supervisory control of advanced energy systems

In this work, we develop a Reinforcement Learning (RL) approach to the supervisory control problem for advanced energy systems, such as novel nuclear reactors and other demand-driven, mission-critical, and component-health-sensitive energy plants. The inclusive problem landscape considered captures the stochastic confluence of plant performance, component health evolution, power demand from the grid, diverse maintenance actions, and operator-defined goals and constraints, all considered over meaningfully long-enough reasoning horizons. Key aspects of the proposed approach are a receding horizon control-inspired technique dictating time- or event-triggered supervisory policy (re-)constructions, as well as additional capability-enabling contributions such as timescale compression, to handle long reasoning horizons and uncertainty in parts of the problem, and practical yet demonstrably-effective handling of hybrid action spaces with continuous and discrete decision variables. The resulting algorithm consists of a simulation-based RL agent constructing stochastic supervisory control policies over nontrivial action spaces and for long horizons, applying the learned policy to the system for a much shorter interval, and perpetually repeating, to construct the next long-horizon policy. That next policy will only be applied, again, for a short interval, yet originally far-in-time events move progressively closer, their associated uncertainty decreases, and new events and aspects enter the reasoning horizon. The proposed methodology bridges fundamental receding horizon concepts with the unequivocally stronger and more scalable reasoning of contemporary RL. Numerical examples using Soft Actor–Critic Deep RL illustrate the operation and efficacy of the proposed technique for a power plant tasked with health-aware load following missions in a dynamic electricity market landscape.

97 MATHEMATICS AND COMPUTING↗

Stochastic simulation of electron avalanches on supercomputers

In the paper, we present a three-dimensional parallel Monte Carlo algorithm named ELSHOW which is developed for simulation of electron avalanches in gases. Parallel implementation of the ELSHOW was made on supercomputers with different architectures (massive parallel and hybrid ones). Using the ELSHOW, calculations of such integral characteristics as the number of particles in an avalanche, the coefficient of impact ionization, the drift velocity, and the others were made. Also, special precise computations were made to select an appropriate size of the time step using the technique of dependent statistical tests. Particularly, the algorithm consists of special methods of distribution modeling, a lexicographic implementation scheme for “branching” of trajectories, justified estimation of functionals. A comparison of the obtained results for nitrogen with previously published theoretical and experimental data was made.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗