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

Reconstruction of time-dependent coefficients: A check of approximation schemes for non-Markovian convolutionless dissipative generators

We propose a procedure to fully reconstruct the time-dependent coefficients of convolutionless non-Markovian dissipative generators via a finite number of experimental measurements. By combining a tomography-based approach with a proper data sampling, our proposal allows to relate the time-dependent coefficients governing the dissipative evolution of a quantum system to experimentally accessible quantities. The proposed scheme not only provides a way to retrieve the full information about potentially unknown dissipative coefficients, but also, most valuably, can be employed as a reliable consistency test for the approximations involved in the theoretical derivation of a given non-Markovian convolutionless master equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filters for Improvement of Multiscale Data from Atomistic Simulations

Multiscale computational models strive to produce accurate and efficient numerical simulations of systems involving interactions across multiple spatial and temporal scales that typically differ by several orders of magnitude. Some such models utilize a hybrid continuum-atomistic approach combining continuum approximations with first-principles-based atomistic models to capture multiscale behavior. By following the heterogeneous multiscale method framework for developing multiscale computational models, unknown continuum scale data can be computed from an atomistic model. Concurrently coupling the two models requires performing numerous atomistic simulations which can dominate the computational cost of the method. Furthermore, when the resulting continuum data is noisy due to sampling error, stochasticity in the model, or randomness in the initial conditions, filtering can result in significant accuracy gains in the computed multiscale data without increasing the size or duration of the atomistic simulations. In this work, we demonstrate the effectiveness of spectral filtering for increasing the accuracy of noisy multiscale data obtained from atomistic simulations. Moreover, we present a robust and automatic method for closely approximating the optimum level of filtering in the case of additive white noise. By improving the accuracy of this filtered simulation data, it leads to a dramatic computational savings by allowing for shorter and smaller atomistic simulations to achieve the same desired multiscale simulation precision.

97 MATHEMATICS AND COMPUTING↗

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗

Evaluating Energy Impacts and Costs from PV Component Failures: Preprint

The PV Reliability Performance Model (PV-RPM) tool is used to simulate the cost and energy impacts of component faults and failures for a hypothetical PV system. This model, originally developed by Sandia National Laboratories, is a new feature in the National Renewable Energy Laboratory's System Advisor Model (SAM), which performs stochastic analysis sampling of probability distributions for faults, failures, and repairs. One PV system was created for this analysis to be representative of a portfolio of maintenance data maintained by Sandia National Laboratories. Fault, failure, and repair distributions from this system are varied from current baseline conditions to simulate different reliability and repair scenarios and resulting energy and cost impacts. Results highlight ways to express the uncertainty around PV system performance when considering the probabilistic behavior of components in the system, and ways the PV-RPM model can be used to explore different failure and repair scenarios.

14 SOLAR ENERGY↗

Evolving Metrics for Resource Adequacy Assessment

Resource adequacy analysis quantifies the likelihood of capacity shortfall on a power system in a probabilistic manner. Using a combination of statistical techniques and power system fundamentals, the analysis typically evaluates hundreds or thousands of stochastic random samples (replications) of varying load, generator outages, variable renewable energy availability, and other aspects of power system uncertainty. In this range of uncertainty, there are - at times - periods where the power system's available resources are insufficient to meet system demand, referred to as a shortfall event. Today's power systems' rapidly evolving generation mix is changing the types of data needed by system planners and regulators, which can often render traditional resource adequacy metrics insufficient for ensuring resource adequacy for tomorrow's grid. In this paper we provide a critical assessment of traditional measures of shortfall risk in power systems, discussing their shortcomings and how they compare to metrics used in other domains. From this analysis we propose four steps forward for improving power system resource adequacy risk metrics in the future.

ENERGY PLANNING, POLICY, AND ECONOMY,POWER TRANSMI↗

Correlation Calculations for the Russian Pu Metal Fast Experiments

Nuclear criticality experiments are often conducted in campaigns with multiple variations. These experiments reuse the same basic components, like the fuel, moderator, or positioning machines. The components have uncertainties in their geometry and composition that propagate to models of the experiments. Shared components create shared uncertainty between the $k_{eff}$ of benchmarks. The shared uncertainty is commonly quantified with a covariance, or correlation coefficient. These covariances can impact criticality safety and nuclear data validation applications. While benchmark evaluations tabulate an experiment’s uncertainty, they often lack a detailed calculation of correlations between experiments. Even some very commonly used benchmarks, like the Russian Pu Metal Fast (PMF) experiments, have missing correlations. This paper presents our approach to calculate the correlations for five of the Russian PMF experiments. The experiments share hemispherical Pu shells that induce a correlation between modeled $k_{eff}$ values. We estimated the correlations with simplified and detailed models of the experiments through linear-perturbation theory. The correlations between the experiments vary significantly between the detailed vs. simplified models. We also investigate how the correlations affect validation metrics of the experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Beyond Expected Values Evolving Metrics for Resource Adequacy Assessment

Resource adequacy analysis quantifies the likelihood of capacity shortfall on a power system in a probabilistic manner. Using a combination of statistical techniques and power system fundamentals, the analysis typically evaluates hundreds or thousands of stochastic random samples (replications) of varying load, generator outages, variable renewable energy availability, and other aspects of power system uncertainty. In this range of uncertainty, there are - at times - periods where the power system's available resources are insufficient to meet system demand, referred to as a shortfall event. Today's power systems' rapidly evolving generation mix is changing the types of data needed by system planners and regulators, which can often render traditional resource adequacy metrics insufficient for ensuring resource adequacy for tomorrow's grid. In this paper we provide a critical assessment of traditional measures of shortfall risk in power systems, discussing their shortcomings and how they compare to metrics used in other domains. From this analysis we propose four steps forward for improving power system resource adequacy risk metrics in the future.

ENERGY PLANNING, POLICY, AND ECONOMY↗

Conditional Point Sampling: A Monte Carlo Method for Radiation Transport in Stochastic Media.

Current methods for stochastic media transport are either computationally expensive or, by nature, approximate. Moreover, none of the well-developed, benchmarked approximate methods can compute the variance caused by the stochastic mixing, a quantity especially important to safety calculations. Therefore, we derive and apply a new conditional probability function (CPF) for use in the recently developed stochastic media transport algorithm Conditional Point Sampling (CoPS), which 1) leverages the full intra-particle memory of CoPS to yield errorless computation of stochastic media outputs in 1D, binary, Markovian-mixed media, and 2) leverages the full inter-particle memory of CoPS and the recently developed Embedded Variance Deconvolution method to yield computation of the variance in transport outputs caused by stochastic material mixing. Numerical results demonstrate errorless stochastic media transport as compared to reference benchmark solutions with the new CPF for this class of stochastic mixing as well as the ability to compute the variance caused by the stochastic mixing via CoPS. Using previously derived, non-errorless CPFs, CoPS is further found to be more accurate than the atomic mix approximation, Chord Length Sampling (CLS), and most of memory-enhanced versions of CLS surveyed. In addition, we study the compounding behavior of CPF error as a function of cohort size (where a cohort is a group of histories that share intra-particle memory) and recommend that small cohorts be used when computing the variance in transport outputs caused by stochastic mixing.

61 RADIATION PROTECTION AND DOSIMETRY↗

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗

An efficient, partitioned ensemble algorithm for simulating ensembles of evolutionary MHD flows at low magnetic Reynolds number

Studying the propagation of uncertainties in a nonlinear dynamical system usually involves generating a set of samples in the stochastic parameter space and then repeated simulations with different sampled parameters. The main difficulty faced in the process is the excessive computational cost. In this paper, we present an efficient, partitioned ensemble algorithm to determine multiple realizations of a reduced Magnetohydrodynamics (MHD) system, which models MHD flows at low magnetic Reynolds number. The algorithm decouples the fully coupled problem into two smaller subphysics problems, which reduces the size of the linear systems that to be solved and allows the use of optimized codes for each subphysics problem. Moreover, the resulting coefficient matrices are the same for all realizations at each time step, which allows faster computation of all realizations and significant savings in computational cost. We prove this algorithm is first order accurate and long time stable under a time step condition. Numerical examples are provided to verify the theoretical results and demonstrate the efficiency of the algorithm.

Jiang, Nan↗