Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic methods”

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 919 records · Page 51

Stochastic Dynamic Analysis for Power Systems Under Uncertain Variability

This paper proposes a novel method to analyze impacts of uncertain variability on power system dynamics. There is considerable interest in integrating intermittent renewable energy and plug-in electric vehicles into power systems. Therefore, power systems are in an environment with increasing uncertain variability. In this paper, the uncertain variability is described as a continuous-time stochastic process, and thus, the power system under uncertain variability is modeled by stochastic differential equations. To quantify impacts of uncertain variability on power system dynamics, an intra-region probability index is presented. Based on the stochastic averaging method, an analytical method is proposed to calculate the intra-region probability. Compared to Monte Carlo simulation, the proposed method is many orders of magnitude faster without sacrificing the result accuracy. As a result, several insights are given to improve the power system dynamics under uncertain variability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Application of Variance Reduction Techniques in RMC Burnup and Thermal-Hydraulic Coupled Calculation

In reactor analog simulation, the Monte Carlo method has relatively high fidelity since it can reduce calculation errors resulting from using approximation methods by describing complex geometry and neutron energy spectra. The Monte Carlo method is, in essence, a stochastic simulation of the neutron transport process, and statistical uncertainty of all the computed results must be provided. In large-scale reactor computation, this method can accurately estimate integral quantities such as the effective multiplication factor (K{sub eff}), and it can limit the uncertainty within an acceptable range via reasonably selecting simulation particles. Nevertheless, it faces great challenges in estimating local quantities like neutron flux and fission power, with uncertainty of estimators beyond acceptance. To decrease the uncertainty of local quantities by increasing simulation particles may cost much time and reduce efficiency. The main reasons are as follows. Firstly, the scale of reactors is so large that common pressurized water reactors have tens of thousands of lattice cells; secondly, uneven distribution of neutron flux and fission power causes uneven distribution of uncertainty. Smith K. puts forward the 95/95 principle to estimate whether uncertainty calculated with Monte Carlo Code satisfies the requirement. According to the principle, with a confidence level of 95%, statistical errors of power density in more than 95% of the regions should be less than 1%. To meet the requirement of the principle, the uniform fission site (UFS) method is raised currently. UFS aims at redistributing fission sources to uniformize the fission source sampling, which can make statistical variance distribution more uniform. This method, which is easy to use, will not obviously increase computation time. Many studies show that UFS has a good variance reduction effect in Monte Carlo criticality calculation, but less attention is paid to its performance in burnup calculation and thermal-hydraulic coupled calculation. Uncertainty arising from the Monte Carlo method has a large impact on burnup calculation and thermal-hydraulic coupled calculation. Variance propagates between burnup steps and between iterative steps of coupled calculation, which causes asymmetry of results of the physical symmetrical regions and instability of coupled iterative convergence errors. To further verify the effect of UFS, this study uses it in the RMC (the Reactor Monte Carlo code) burnup calculation module and the neutronics/thermohydraulics coupled calculation module, and conducts two-dimensional pressurized water reactor burnup calculation and BEAVRS benchmark thermalhydraulic coupled calculation. In this way, it verifies the improvement effect of UFS on variance propagation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Efficient estimators for likelihood ratio sensitivity indices of complex stochastic dynamics

We demonstrate that centered likelihood ratio estimators for the sensitivity indices of complex stochastic dynamics are highly efficient with low, constant in time variance and consequently they are suitable for sensitivity analysis in long-time and steady-state regimes. These estimators rely on a new covariance formulation of the likelihood ratio that includes as a submatrix a Fisher information matrix for stochastic dynamics and can also be used for fast screening of insensitive parameters and parameter combinations. The proposed methods are applicable to broad classes of stochastic dynamics such as chemical reaction networks, Langevin-type equations and stochastic models in finance, including systems with a high dimensional parameter space and/or disparate decorrelation times between different observables. Furthermore, they are simple to implement as a standard observable in any existing simulation algorithm without additional modifications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GPU Acceleration of History-Based Multigroup Monte Carlo

Accurate solutions of the radiation transport equation play an important role in the analysis of many nuclear systems. Because there is no need to discretize the problem, Monte Carlo methods offer the most accurate possible solutions to the transport equation. However, significant computational effort is required to reduce the stochastic noise inherent to Monte Carlo methods. Current trends in high performance computing are moving towards vectorized, single instruction multiple data (SIMD), architectures such as Intel Xeon Phis and graphics processing units (GPUs) due to their favorable ratio of performance to power consumption. The challenge of adapting Monte Carlo transport to vectorized computing architectures was first addressed by Brown with an algorithm known as event-based Monte Carlo. In this approach, rather than simulating individual particle histories from birth to death, groups of particles are processed one event at a time. This allows each event batch to perform the same operations in lockstep, enabling use of the vector hardware. Although modern vectorized hardware is more versatile than the early vector machines, reducing so-called thread divergence is nonetheless still an important consideration for algorithm design. Many of the algorithms proposed so far for Monte Carlo transport on advanced architectures have focused on variants of event-based transport. Some evidence, however, suggests that low-level thread divergence, resulting from short-lived branching statements, may not be detrimental to overall performance on GPUs as long as the effect on achievable memory bandwidth is considered. This paper characterizes the performance of a traditional history-based Monte Carlo algorithm on GPUs. We show that with only minor modifications to traditional algorithms, significant performance gains relative to CPUs are possible. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Supervised paralled-in-time algorithm for long-time Lagrangian simulations of stochastic dynamics: Application to hydrodynamics

Lagrangian particle methods based on detailed atomic and molecular and nanoscale systems. However, the maximum time step is limited by the smallest oscillation period of the fastest atomic motion, rendering long-time simulations very expensive. To resolve this bottleneck, we propose a supervised parallel-in-time algorithm for stochastic dynamics to accelerate long-time Lagrangian particle simulations. Our method is inspired by bottom-up coarse-graining projections that yield mean-field hydrodynamic behavior in the continuum limit.

Multiscale modeling, Lagrangian method, Parallel-i↗

A characterization of robust radiation therapy treatment planning methods-from expected value to worst case optimization

Purpose: To characterize a class of optimization formulations used to handle systematic and random errors in radiation therapy, and to study the differences between the methods within this class. Methods: The class of robust methods that can be formulated as minimax stochastic programs is studied. This class generalizes many previously used methods, ranging between optimization of the expected and the worst case objective value. The robust methods are used to plan intensity-modulated proton therapy (IMPT) treatments for a case subject to systematic setup and range errors, random setup errors with and without uncertain probability distribution, and combinations thereof. As reference, plans resulting from a conventional method that uses a margin to account for errors are shown. Results: For all types of errors, target coverage robustness increased with the conservativeness of the method. For systematic errors, best case organ at risk (OAR) doses increased and worst case doses decreased with the conservativeness. Accounting for random errors of fixed probability distribution resulted in heterogeneous dose. The heterogeneities were reduced when uncertainty in the probability distribution was accounted for. Doing so, the OAR doses decreased with the conservativeness. All robust methods studied resulted in more robust target coverage and lower OAR doses than the conventional method. Conclusions: Accounting for uncertainties is essential to ensure plan quality in complex radiation therapy such as IMPT. The utilization of more information than conventional in the optimization can lead to robust target coverage and low OAR doses. Increased target coverage robustness can be achieved by more conservative methods.

60 APPLIED LIFE SCIENCES↗

Determining structural performance

An overview of the methods and concepts developed to enhance and predict structural dynamic characteristics of advanced aeropropulsion systems is presented. Aeroelasticity, vibration control, dynamic systems, and computational structural methods are four disciplines that make up the structural dynamic effort at LeRC. The aeroelasticity program develops analytical and experimental methods for minimizing flutter and forced vibration of aerospace propulsion systems. Both frequency domain and time domain methods were developed for applications on the turbofan, turbopump, and advanced turboprop. In order to improve life and performance, the vibration control program conceives, analyzes, develops, and demonstrates new methods for controlling vibrations in aerospace systems. Active and passive vibration control is accomplished with electromagnetic dampers, magnetic bearings, and piezoelectric crystals to control rotor vibrations. The dynamic systems program analyzes and verifies the dynamics of interacting systems, as well as develops concepts and methods for high-temperature dynamic seals. Work in this field involves the analysis and parametric identification of large, nonlinear, damped, stochastic systems. The computational structural methods program exploits modern computer science as an aid to the solutions of structural problems.

Ernst, Michael A.↗

Modeling and Analysis of DC Microgrids as Stochastic Hybrid Systems

This study proposes a method of predicting the influence of random load behavior on the dynamics of dc microgrids and distribution systems. This is accomplished by combining stochastic load models and deterministic microgrid models. Together, these elements constitute a stochastic hybrid system. The resulting model enables straightforward calculation of dynamic state moments, which are used to assess the probability of desirable operating conditions. Specific consideration is given to systems based on the dual active bridge (DAB) topology. Bounds are derived for the probability of zero voltage switching (ZVS) in DAB converters. A simple example is presented to demonstrate how these bounds may be used to improve ZVS performance as an optimization problem. In conclusion, predictions of state moment dynamics and ZVS probability assessments are verified through comparisons to Monte Carlo simulations.

42 ENGINEERING↗

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗

Robust Parameter Design on Dual Stochastic Response Models With Constrained Bayesian Optimization

In engineering system design, minimizing the variations of the quality measurements while guaranteeing their overall quality up to certain levels, namely the robust parameter design (RPD), is crucial. Recent works have dealt with the design of a system whose response-control variables relationship is a deterministic function with a complex shape and function evaluation is expensive. In this work, we propose a Bayesian optimization method for the RPD of stochastic functions. Dual stochastic response models are carefully designed for stochastic functions. The heterogeneous variance of the sample mean is addressed by the predictive mean of the log variance surrogate model in a two-step approach. We establish an acquisition function that favors exploration across the feasible and optimality-improvable regions to effectively and efficiently solve the stochastic constrained optimization problem. Further, the performance of our proposed method is demonstrated by the extensive numerical and case studies. Note to Practitioners-Many manufacturing processes involve undesirable variations, which create variations in the final products. For example, many emerging manufacturing processes, such as nanomanufacturing, involve complex physical and chemical dynamics and transformation, creating variations in the manufacturing output. In such processes, it is crucial to design the manufacturing processes or products so that they have minimum variations in their quality. Meanwhile, it is also important to maintain the overall quality of the designed processes or products. Furthermore, acquiring data from many advanced manufacturing processes is often very costly, especially in the designing stage. In this work, we propose a data-driven method that automatically finds the best setting of manufacturing processes or products with the minimum variations of quality and a given constraint on the average quality satisfied. Our proposed method is used before conducting every experiment; It analyzes the historical data from previous experiments and provides a setting to be used in the next experiment. Our proposed method efficiently utilizes the historical data, and thus finds the best robust setting by conducting only a small number of experiments.

42 ENGINEERING↗

Comparison of Lagrangian Superdroplet and Eulerian Double-Moment Spectral Microphysics Schemes in Large-Eddy Simulations of an Isolated Cumulus Congestus Cloud

Abstract Advanced microphysics schemes (such as Eulerian bin and Lagrangian superdroplet) are becoming standard tools for cloud physics research and parameterization development. This study compares a double-moment bin scheme and a Lagrangian superdroplet scheme via large-eddy simulations of nonprecipitating and precipitating cumulus congestus clouds. Cloud water mixing ratio in the bin simulations is reduced compared to the Lagrangian simulations in the upper part of the cloud, likely from numerical diffusion, which is absent in the Lagrangian approach. Greater diffusion in the bin simulations is compensated by more secondary droplet activation (activation above cloud base), leading to similar or somewhat higher droplet number concentrations and smaller mean droplet radius than the Lagrangian simulations for the nonprecipitating case. The bin scheme also produces a significantly larger standard deviation of droplet radius than the superdroplet method, likely due to diffusion associated with the vertical advection of bin variables. However, the spectral width in the bin simulations is insensitive to the grid spacing between 50 and 100 m, suggesting other mechanisms may be compensating for diffusion as the grid spacing is modified. For the precipitating case, larger spectral width in the bin simulations initiates rain earlier and enhances rain development in a positive feedback loop. However, with time, rain formation in the superdroplet simulations catches up to the bin simulations. Offline calculations using the same drop size distributions in both schemes show that the different numerical methods for treating collision–coalescence also contribute to differences in rain formation. The stochastic collision–coalescence in the superdroplet method introduces more variability in drop growth for a given rain mixing ratio.

54 ENVIRONMENTAL SCIENCES↗

Effective computation of stochastic protein kinetic equation by reducing stiffness via variable transformation

The stochastic protein kinetic equations can be stiff for certain parameters, which makes their numerical simulation rely on very small time step sizes, resulting in large computational cost and accumulated round-off errors. For such situation, we provide a method of reducing stiffness of the stochastic protein kinetic equation by means of a kind of variable transformation. Theoretical and numerical analysis show effectiveness of this method. Its generalization to a more general class of stochastic differential equation models is also discussed.

97 MATHEMATICS AND COMPUTING↗

Verifying Autonomous Air Traffic Algorithms in the Presence of Sensor Error and Flight Perturbations

We offer a method to verify algorithms for air traffic control in the presence of sensor errors and flight perturbations. Since errors and perturbations are described by stochastic processes, verification by analytical methods is difficult. We turn to Monte Carlo simulation, but there are two major obstacles. Since air traffic algorithms are safety-critical, the algorithm must be established at a very high confidence level which requires an enormous number of trials. Another is that a simulation attempts to show that an algorithm correctly handles a hazard that might appear, but there is a lack of information about the frequency of occurrence of hazards in the airspace. This paper offers a solution to these and other obstacles. It recognizes there may be a number of algorithms that address different hazards, and the results of the different simulations must be combined to satisfy a global reliability requirement at a high confidence level. To demonstrate the feasibility of the approach, we apply it to an example, an initial effort in collision avoidance.

verification↗

Using a derivative-free optimization method for multiple solutions of inverse transport problems

Identifying unknown components of an object that emits radiation is an important problem for national and global security. Radiation signatures measured from an object of interest can be used to infer object parameter values that are not known. This problem is called an inverse transport problem. An inverse transport problem may have multiple solutions and the most widely used approach for its solution is an iterative optimization method. This paper proposes a stochastic derivative-free global optimization algorithm to find multiple solutions of inverse transport problems. The algorithm is an extension of a multilevel single linkage (MLSL) method where a mesh adaptive direct search (MADS) algorithm is incorporated into the local phase. Furthermore, numerical test cases using uncollided fluxes of discrete gamma-ray lines are presented to show the performance of this new algorithm.

42 ENGINEERING↗

Geostatistical Approaches for Spatial Estimation of Vegetation Quantities Using Ground and Image Data

A major challenge in the study of the earth system is the mapping of vegetation quantities over large regions. Geostatistical methods, such as cokriging and stochastic simulation, have the potential to exploit more fully both remotely sensed data and ground information and improve the spatial estimation of vegetation variables over traditional regression methods. A synthetic example constructed from imaging spectrometer data allows a useful comparison among regression, cokriging and a simple probability-field method. A range of linear relationships between direct (sampled) and ancillary images is used. The lowest root-mean-square-error is achieved with cokriging until the correlation between direct and ancillary data exceeds .89, at which point regression is the superior estimator. Probability-field simulation gives a range of possible realizations, most more precise than those from regression. The relationship between ground measurements and image data is thus demonstrated to be one of the critical factors in the choice of a spatial estimation method.

Dungan, Jennifer L.↗

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Upscaling permeability for three-dimensional fractured porous rocks with the multiple boundary method

Upscaling permeability of grid blocks is crucial for groundwater models. A novel upscaling method for three-dimensional fractured porous rocks is presented. The objective of the study was to compare this method with the commonly used Oda upscaling method and the volume averaging method. First, the multiple boundary method and its computational framework were defined for three-dimensional stochastic fracture networks. Then, the different upscaling methods were compared for a set of rotated fractures, for tortuous fractures, and for two discrete fracture networks. The results computed by the multiple boundary method are comparable with those of the other two methods and fit best the analytical solution for a set of rotated fractures. The errors in flow rate of the equivalent fracture model decrease when using the multiple boundary method. Furthermore, the errors of the equivalent fracture models increase from well-connected fracture networks to poorly connected ones. Finally, the diagonal components of the equivalent permeability tensors tend to follow a normal or log-normal distribution for the well-connected fracture network model with infinite fracture size. By contrast, they exhibit a power-law distribution for the poorly connected fracture network with multiple scale fractures. The study demonstrates the accuracy and the flexibility of the multiple boundary upscaling concept. This makes it attractive for being incorporated into any existing flow-based upscaling procedures, which helps in reducing the uncertainty of groundwater models.

58 GEOSCIENCES↗

Adaptive tau-leaping methods for microscopic-lattice kinetic Monte Carlo simulations

Traditional Kinetic Monte Carlo (KMC) approaches, rooted in Gillespie’s stochastic simulation algorithm, become computationally demanding in systems with a large range of timescales. The goal of this work is to propose and study new adaptive lattice-KMC time integration strategies for spatially non-uniform systems. To that end, two novel adaptive tau-leaping methods and their corresponding time integration strategies are developed based on the idea of the “n-fold” direct KMC method. These strategies allow for the simultaneous execution of multiple reactions, advancing time by adaptively selected coarse increments. We present numerical experiments comparing the proposed methods with existing approaches in a catalytic surface kinetics application involving ammonia decomposition.

Bimolecular reactions↗