Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic sampling”

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 145 records · Page 8

Girsanov's transformation based variance reduced Monte Carlo simulation schemes for reliability estimation in nonlinear stochastic dynamics

The study considers the problem of simulation based time variant reliability analysis of nonlinear randomly excited dynamical systems. Attention is focused on importance sampling strategies based on the application of Girsanov's transformation method. Controls which minimize the distance function, as in the first order reliability method (FORM), are shown to minimize a bound on the sampling variance of the estimator for the probability of failure. Two schemes based on the application of calculus of variations for selecting control signals are proposed: the first obtains the control force as the solution of a two-point nonlinear boundary value problem, and, the second explores the application of the Volterra series in characterizing the controls. The relative merits of these schemes, vis-à-vis the method based on ideas from the FORM, are discussed. Illustrative examples, involving archetypal single degree of freedom (dof) nonlinear oscillators, and a multi-degree of freedom nonlinear dynamical system, are presented. The credentials of the proposed procedures are established by comparing the solutions with pertinent results from direct Monte Carlo simulations. - Highlights: • The distance minimizing control forces minimize a bound on the sampling variance. • Establishing Girsanov controls via solution of a two-point boundary value problem. • Girsanov controls via Volterra's series representation for the transfer functions.

97 MATHEMATICS AND COMPUTING↗

Developing and Implementing the Data Mining Algorithms in RAVEN

The RAVEN code is becoming a comprehensive tool to perform probabilistic risk assessment, uncertainty quantification, and verification and validation. The RAVEN code is being developed to support many programs and to provide a set of methodologies and algorithms for advanced analysis. Scientific computer codes can generate enormous amounts of data. To post-process and analyze such data might, in some cases, take longer than the initial software runtime. Data mining algorithms/methods help in recognizing and understanding patterns in the data, and thus discover knowledge in databases. The methodologies used in the dynamic probabilistic risk assessment or in uncertainty and error quantification analysis couple system/physics codes with simulation controller codes, such as RAVEN. RAVEN introduces both deterministic and stochastic elements into the simulation while the system/physics code model the dynamics deterministically. A typical analysis is performed by sampling values of a set of parameter values. A major challenge in using dynamic probabilistic risk assessment or uncertainty and error quantification analysis for a complex system is to analyze the large number of scenarios generated. Data mining techniques are typically used to better organize and understand data, i.e. recognizing patterns in the data. This report focuses on development and implementation of Application Programming Interfaces (APIs) for different data mining algorithms, and the application of these algorithms to different databases.

97 MATHEMATICS AND COMPUTING↗

Distribution System State Estimation With High Penetration of Demand Response Enabled Loads

Demand-side operations incentivize utility customers to take part in various grid services. A demand response enabled load (DREL) is a flexible grid asset that schedules electricity consumption in response to a time-of-use (TOU) energy price. Consequently, its energy profile differs from that of a conventional load that is insensitive to price. This difference may cause new challenges for distribution system state estimation (DSSE). It is well known that DSSE often needs to use pseudo-measurements based on historic load profiles to increase system observability. However, historic profiles of conventional loads are not representative of DREL behaviors. Additionally, the inaccuracy impacts DSSE results and other DSSE-dependent operations. In this paper, we propose an online pseudo-measurement generation approach for DSSE with DRELs. We formulate an optimization model to represent DRELs self-adjusting actions. Sampling-based stochastic optimization techniques are proposed to account for uncertainties in DRELs. A set of representative DREL behavior data corresponding to the samples are used to characterize DREL pseudo-measurements. Case studies with modified IEEE 123-bus test system verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗

Multi-element stochastic spectral projection for high quantile estimation

We investigate quantile estimation by multi-element generalized Polynomial Chaos (gPC) metamodel where the exact numerical model is approximated by complementary metamodels in overlapping domains that mimic the model’s exact response. The gPC metamodel is constructed by the non-intrusive stochastic spectral projection approach and function evaluation on the gPC metamodel can be considered as essentially free. Thus, large number of Monte Carlo samples from the metamodel can be used to estimate α-quantile, for moderate values of α. As the gPC metamodel is an expansion about the means of the inputs, its accuracy may worsen away from these mean values where the extreme events may occur. By increasing the approximation accuracy of the metamodel, we may eventually improve accuracy of quantile estimation but it is very expensive. A multi-element approach is therefore proposed by combining a global metamodel in the standard normal space with supplementary local metamodels constructed in bounded domains about the design points corresponding to the extreme events. To improve the accuracy and to minimize the sampling cost, sparse-tensor and anisotropic-tensor quadratures are tested in addition to the full-tensor Gauss quadrature in the construction of local metamodels; different bounds of the gPC expansion are also examined. The global and local metamodels are combined in the multi-element gPC (MEgPC) approach and it is shown that MEgPC can be more accurate than Monte Carlo or importance sampling methods for high quantile estimations for input dimensions roughly below N=8, a limit that is very much case- and α-dependent.

97 MATHEMATICS AND COMPUTING↗

Constrained approximation of effective generators for multiscale stochastic reaction networks and application to conditioned path sampling

Efficient analysis and simulation of multiscale stochastic systems of chemical kinetics is an ongoing area for research, and is the source of many theoretical and computational challenges. In this paper, we present a significant improvement to the constrained approach, which is a method for computing effective dynamics of slowly changing quantities in these systems, but which does not rely on the quasi-steady-state assumption (QSSA). The QSSA can cause errors in the estimation of effective dynamics for systems where the difference in timescales between the “fast” and “slow” variables is not so pronounced. This new application of the constrained approach allows us to compute the effective generator of the slow variables, without the need for expensive stochastic simulations. This is achieved by finding the null space of the generator of the constrained system. For complex systems where this is not possible, or where the constrained subsystem is itself multiscale, the constrained approach can then be applied iteratively. This results in breaking the problem down into finding the solutions to many small eigenvalue problems, which can be efficiently solved using standard methods. Since this methodology does not rely on the quasi steady-state assumption, the effective dynamics that are approximated are highly accurate, and in the case of systems with only monomolecular reactions, are exact. We will demonstrate this with some numerics, and also use the effective generators to sample paths of the slow variables which are conditioned on their endpoints, a task which would be computationally intractable for the generator of the full system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resource distribution under spatiotemporal uncertainty of disease spread: Stochastic versus robust approaches

We consider the problem of optimizing locations of distribution centers (DCs) and plans for distributing resources such as test kits and vaccines, under spatiotemporal uncertainties of disease spread and demand for the resources. We aim to balance the operational cost (including costs of deploying facilities, shipping, and storage) and quality of service (reflected by demand coverage), while ensuring equity and fairness of resource distribution across multiple populations. We compare a sample-based stochastic programming (SP) approach with a distributionally robust optimization (DRO) approach using a moment-based ambiguity set. Numerical studies are conducted on instances of distributing COVID-19 vaccines in the United States and test kits, to compare SP and DRO models with a deterministic formulation using estimated demand and with the current resource distribution plans implemented in the US. We demonstrate the results over distinct phases of the pandemic to estimate the cost and speed of resource distribution depending on scale and coverage, and show the “demand-driven” properties of the SP and DRO solutions. Furthermore, our results further indicate that if the worst-case unmet demand is prioritized, then the DRO approach is preferred despite of its higher overall cost. Nevertheless, the SP approach can provide an intermediate plan under budgetary restrictions without significant compromises in demand coverage.

97 MATHEMATICS AND COMPUTING↗

Number-phase Wigner representation for efficient stochastic simulations

Phase-space representations based on coherent states (P,Q, Wigner) have been successful in the creation of stochastic differential equations (SDEs) for the efficient stochastic simulation of high-dimensional quantum systems. However, many problems using these techniques remain intractable over long integration times. We present a number-phase Wigner representation that can be unraveled into SDEs. We demonstrate convergence to the correct solution for an anharmonic oscillator with small dampening for significantly longer than other phase-space representations. This process requires an effective sampling of a nonclassical probability distribution. We describe and demonstrate a method of achieving this sampling using stochastic weights.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inverse Modeling of Hydrologic Parameters Using Surface Flux and Runoff Observations in the Community Land Model

This study demonstrates the possibility of inverting hydrologic parameters using surface flux and runoff observations in version 4 of the Community Land Model (CLM4). Previous studies showed that surface flux and runoff calculations are sensitive to major hydrologic parameters in CLM4 over different watersheds, and illustrated the necessity and possibility of parameter calibration. Two inversion strategies, the deterministic least-square fitting and stochastic Markov-Chain Monte-Carlo (MCMC) - Bayesian inversion approaches, are evaluated by applying them to CLM4 at selected sites. The unknowns to be estimated include surface and subsurface runoff generation parameters and vadose zone soil water parameters. We find that using model parameters calibrated by the least-square fitting provides little improvements in the model simulations but the sampling-based stochastic inversion approaches are consistent - as more information comes in, the predictive intervals of the calibrated parameters become narrower and the misfits between the calculated and observed responses decrease. In general, parameters that are identified to be significant through sensitivity analyses and statistical tests are better calibrated than those with weak or nonlinear impacts on flux or runoff observations. Temporal resolution of observations has larger impacts on the results of inverse modeling using heat flux data than runoff data. Soil and vegetation cover have important impacts on parameter sensitivities, leading to the different patterns of posterior distributions of parameters at different sites. Overall, the MCMC-Bayesian inversion approach effectively and reliably improves the simulation of CLM under different climates and environmental conditions. Bayesian model averaging of the posterior estimates with different reference acceptance probabilities can smooth the posterior distribution and provide more reliable parameter estimates, but at the expense of wider uncertainty bounds.

inverse, modeling, hydrologic, parameters, flux, r↗

Quadratic partial eigenvalue assignment in large-scale stochastic dynamic systems for resilient and economic design

Failure of structural systems under dynamic loading can be prevented via active vibration control which shifts the damped natural frequencies of the systems away from the dominant range of loading spectrum. The damped natural frequencies and the dynamic load typically show significant variations in practice. A computationally efficient methodology based on quadratic partial eigenvalue assignment technique and optimization under uncertainty has been formulated in the present work that will rigorously account for these variations and result in an economic and resilient design of structures. A novel scheme based on hierarchical clustering and importance sampling is also developed in this work for accurate and efficient estimation of probability of failure to guarantee the desired resilience level of the designed system. Numerical examples are presented to illustrate the proposed methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reweighted ℓ{sub 1} minimization method for stochastic elliptic differential equations

We consider elliptic stochastic partial differential equations (SPDEs) with random coefficients and solve them by expanding the solution using generalized polynomial chaos (gPC). Under some mild conditions on the coefficients, the solution is “sparse” in the random space, i.e., only a small number of gPC basis makes considerable contribution to the solution. To exploit this sparsity, we employ reweighted l{sub 1} minimization to recover the coefficients of the gPC expansion. We also combine this method with random sampling points based on the Chebyshev probability measure to further increase the accuracy of the recovery of the gPC coefficients. We first present a one-dimensional test to demonstrate the main idea, and then we consider 14 and 40 dimensional elliptic SPDEs to demonstrate the significant improvement of this method over the standard l{sub 1} minimization method. For moderately high dimensional (∼10) problems, the combination of Chebyshev measure with reweighted l{sub 1} minimization performs well while for higher dimensional problems, reweighted l{sub 1} only is sufficient. The proposed approach is especially suitable for problems for which the deterministic solver is very expensive since it reuses the sampling results and exploits all the information available from limited sources.

97 MATHEMATICS AND COMPUTING↗

Simplex-stochastic collocation method with improved scalability

The Simplex-Stochastic Collocation (SSC) method is a robust tool used to propagate uncertain input distributions through a computer code. However, it becomes prohibitively expensive for problems with dimensions higher than 5. The main purpose of this paper is to identify bottlenecks, and to improve upon this bad scalability. In order to do so, we propose an alternative interpolation stencil technique based upon the Set-Covering problem, and we integrate the SSC method in the High-Dimensional Model-Reduction framework. In addition, we address the issue of ill-conditioned sample matrices, and we present an analytical map to facilitate uniformly-distributed simplex sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Three-omega thermal-conductivity measurements with curved heater geometries

The three-omega method, a powerful technique to measure the thermal conductivity of nanometer-thick films and the interfaces between them, has historically employed straight conductive wires to act as both heaters and thermometers. When investigating stochastically prepared samples such as two-dimensional materials and nanomembranes, residue and excess material can make it difficult to fit the required millimeter-long straight wire on the sample surface. There are currently no available criteria for how diverting three-omega heater wires around obstacles affects the validity of the thermal measurement. In this Letter, we quantify the effect of the wire curvature by performing three-omega experiments with a wide range of frequencies using both curved and straight heater geometries on SiO 2 /Si samples. When the heating wire is curved, we find that the measured Si substrate thermal conductivity changes by only 0.2%. Similarly, we find that wire curvature has no significant effect on the determination of the thermal resistance of an ~65 nm SiO 2 layer, even for the sharpest corners considered here, for which the largest measured ratio of the thermal penetration depth of the applied thermal wave to radius of curvature of the heating wire is 4.3. This result provides useful design criteria for three-omega experiments by setting a lower bound for the maximum ratio of the thermal penetration depth to wire radius of curvature.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling

A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle non-stationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction of sequential designs. Several sequential design procedures with different infill criteria are proposed based on the generated posterior samples. As a result, numerical studies show that the proposed schemes are capable of solving problems of positive point identification, optimization, and surrogate fitting.

97 MATHEMATICS AND COMPUTING↗

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

42 ENGINEERING↗