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 199 records · Page 11

Localised distributions and criteria for correctness in complex Langevin dynamics

Complex Langevin dynamics can solve the sign problem appearing in numerical simulations of theories with a complex action. In order to justify the procedure, it is important to understand the properties of the real and positive distribution, which is effectively sampled during the stochastic process. In the context of a simple model, we study this distribution by solving the Fokker–Planck equation as well as by brute force and relate the results to the recently derived criteria for correctness. We demonstrate analytically that it is possible that the distribution has support in a strip in the complexified configuration space only, in which case correct results are expected. -- Highlights: •Characterisation of the equilibrium distribution sampled in complex Langevin dynamics. •Connection between criteria for correctness and breakdown. •Solution of the Fokker–Planck equation in the case of real noise. •Analytical determination of support in complexified space.

97 MATHEMATICS AND COMPUTING↗

Stochastic level-set method for shape optimisation

We present a new method for stochastic shape optimisation of engineering structures. The method generalises an existing deterministic scheme, in which the structure is represented and evolved by a level-set method coupled with mathematical programming. The stochastic element of the algorithm is built on the methods of statistical mechanics and is designed so that the system explores a Boltzmann–Gibbs distribution of structures. In non-convex optimisation problems, the deterministic algorithm can get trapped in local optima: the stochastic generalisation enables sampling of multiple local optima, which aids the search for the globally-optimal structure. The method is demonstrated for several simple geometrical problems, and a proof-of-principle calculation is shown for a simple engineering structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coarse-graining and hybrid methods for efficient simulation of stochastic multi-scale models of tumour growth

The development of hybrid methodologies is of current interest in both multi-scale modelling and stochastic reaction–diffusion systems regarding their applications to biology. We formulate a hybrid method for stochastic multi-scale models of cells populations that extends the remit of existing hybrid methods for reaction–diffusion systems. Such method is developed for a stochastic multi-scale model of tumour growth, i.e. population-dynamical models which account for the effects of intrinsic noise affecting both the number of cells and the intracellular dynamics. In order to formulate this method, we develop a coarse-grained approximation for both the full stochastic model and its mean-field limit. Such approximation involves averaging out the age-structure (which accounts for the multi-scale nature of the model) by assuming that the age distribution of the population settles onto equilibrium very fast. We then couple the coarse-grained mean-field model to the full stochastic multi-scale model. By doing so, within the mean-field region, we are neglecting noise in both cell numbers (population) and their birth rates (structure). This implies that, in addition to the issues that arise in stochastic-reaction diffusion systems, we need to account for the age-structure of the population when attempting to couple both descriptions. We exploit our coarse-graining model so that, within the mean-field region, the age-distribution is in equilibrium and we know its explicit form. This allows us to couple both domains consistently, as upon transference of cells from the mean-field to the stochastic region, we sample the equilibrium age distribution. Furthermore, our method allows us to investigate the effects of intracellular noise, i.e. fluctuations of the birth rate, on collective properties such as travelling wave velocity. We show that the combination of population and birth-rate noise gives rise to large fluctuations of the birth rate in the region at the leading edge of front, which cannot be accounted for by the coarse-grained model. Such fluctuations have non-trivial effects on the wave velocity. Beyond the development of a new hybrid method, we thus conclude that birth-rate fluctuations are central to a quantitatively accurate description of invasive phenomena such as tumour growth. - Highlights: • A hybrid method for stochastic multi-scale models of cells populations that extends existing hybrid methods for reaction–diffusion system. • Our analysis unveils non-trivial macroscopic effects triggered by noise at the level of structuring variables. • Our hybrid method hugely speeds up age-structured SSA simulations while preserving stochastic effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global sensitivity analysis in stochastic simulators of uncertain reaction networks

Stochastic models of chemical systems are often subjected to uncertainties in kinetic parameters in addition to the inherent random nature of their dynamics. Uncertainty quantification in such systems is generally achieved by means of sensitivity analyses in which one characterizes the variability with the uncertain kinetic parameters of the first statistical moments of model predictions. In this work, we propose an original global sensitivity analysis method where the parametric and inherent variability sources are both treated through Sobol’s decomposition of the variance into contributions from arbitrary subset of uncertain parameters and stochastic reaction channels. The conceptual development only assumes that the inherent and parametric sources are independent, and considers the Poisson processes in the random-time-change representation of the state dynamics as the fundamental objects governing the inherent stochasticity. Here, a sampling algorithm is proposed to perform the global sensitivity analysis, and to estimate the partial variances and sensitivity indices characterizing the importance of the various sources of variability and their interactions. The birth-death and Schlögl models are used to illustrate both the implementation of the algorithm and the richness of the proposed analysis method. The output of the proposed sensitivity analysis is also contrasted with a local derivative-based sensitivity analysis method classically used for this type of systems.

97 MATHEMATICS AND COMPUTING↗

Stochastic and deterministic methods for the calculation of small-sample reactivity experiments

Several calculations methods for the analysis of small-sample reactivity experiments are presented, as their main advantages and drawbacks. A numerical benchmark has been defined for this study consisting in a regular lattice of UO{sub 2} fuel pins, in which the central one is successively poisoned with isotopes of interest (actinides, absorbers, ...). A first method, based on a forward calculation ('eigenvalues difference method'), is presented, using either a deterministic or a stochastic calculation code. A first perturbative method studied is based on the 'Exact Perturbation Theory' (EPT) implemented in the deterministic code APOLLO2.8, and gives consistent results against forward calculations. A second perturbative method, the 'correlated sampling method', implemented in the stochastic calculation code TRIPOLI4.7 is tested. It should be use carefully as it is generally validated against small atomic density changes, but can be useful for conception studies. An 'hybrid method', based on the EPT formalism, using both Monte Carlo and deterministic results is tested, and shows reliable results. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the DAKOTA software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of DAKOTA-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of DAKOTA's iterative analysis capabilities.

99 GENERAL AND MISCELLANEOUS↗

Uncertainty Quantification and Parameter Tuning in the CAM5 Zhang-McFarlane Convection Scheme and Impact of Improved Convection on the Global Circulation and Climate

In this study, we applied an uncertainty quantification (UQ) technique to improve convective precipitation in the global climate model, the Community Atmosphere Model version 5 (CAM5), in which the convective and stratiform precipitation partitioning is very different from observational estimates. We examined the sensitivity of precipitation and circulation to several key parameters in the Zhang-McFarlane deep convection scheme in CAM5, using a stochastic importance-sampling algorithm that can progressively converge to optimal parameter values. The impact of improved deep convection on the global circulation and climate was subsequently evaluated. Our results show that the simulated convective precipitation is most sensitive to the parameters of the convective available potential energy consumption time scale, parcel fractional mass entrainment rate, and maximum downdraft mass flux fraction. Using the optimal parameters constrained by the observed Tropical Rainfall Measuring Mission, convective precipitation improves the simulation of convective to stratiform precipitation ratio and rain-rate spectrum remarkably. When convection is suppressed, precipitation tends to be more confined to the regions with strong atmospheric convergence. As the optimal parameters are used, positive impacts on some aspects of the atmospheric circulation and climate, including reduction of the double Intertropical Convergence Zone, improved East Asian monsoon precipitation, and improved annual cycles of the cross-equatorial jets, are found as a result of the vertical and horizontal redistribution of latent heat release from the revised parameterization. Positive impacts of the optimal parameters derived from the 2 simulations are found to transfer to the 1 simulations to some extent.

CAM5↗

New Angle on the Parton Distribution Functions: Self-Organizing Maps

Neural network (NN) algorithms have been recently applied to construct Parton Distribution Function (PDF) parametrizations, providing an alternative to standard global fitting procedures. Here we explore a novel technique using Self-Organizing Maps (SOMs). SOMs are a class of clustering algorithms based on competitive learning among spatially-ordered neurons. We train our SOMs with stochastically generated PDF samples. On every optimization iteration the PDFs are clustered on the SOM according to a user-defined feature and the most promising candidates are used as a seed for the subsequent iteration using the topology of the map to guide the PDF generating process. Our goal is a fitting procedure that, at variance with the standard neural network approaches, will allow for an increased control of the systematic bias by enabling user interaction in the various stages of the process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ignition thresholds of aluminized HMX-based polymer-bonded explosives

Here, the ignition of aluminized HMX-based polymer-bonded explosives (PBXs) under shock loading is studied via mesoscale simulations. The conditions analyzed concern loading pulses of 20 nanoseconds to 0.8 microseconds in duration and impact piston velocities on the order of 400-1000 m/s or loading stresses on the order of 3-14 GPa. The sets of samples studied have stochastically similar microstructures consisting of a bimodal distribution of HMX grains, an Estane binder, and aluminum particles 50-100 µm in diameter. The computational model accounts for constituent elasto-viscoplasticity, viscoelasticity, bulk compressibility, fracture, interfacial debonding, internal contact, bulk and frictional heating, and heat conduction. The analysis focuses on the development of hotspots under different material settings and loading conditions. In particular, the ignition thresholds in the forms of the James relation and the Walker-Wasley relation and the corresponding ignition probability are calculated and expressed as functions of the aluminum volume fraction for the PBXs analyzed. Lastly, it is found that the addition of aluminum raises the ignition thresholds, causing the materials to be less sensitive. Dissipation and heating mechanism changes responsible for this trend are delineated.

36 MATERIALS SCIENCE↗

Experimental quantum Bernoulli factories via Bell-basis measurements

Randomness processing in the Bernoulli factory framework provides a concrete setting in which quantum resources can outperform classical ones. We experimentally demonstrate quantum randomness processing based on Bell-basis measurements of two identical input quoins prepared on IBM superconducting hardware. Using only the measurement outcomes (and no external classical randomness source), we realize the classically inconstructible Bernoulli doubling primitive f(p)=2p, and, as intermediate outputs from the same Bell-measurement statistics, an exact fair coin f(p)=1/2 and the classically inconstructible function f(p)=4p(1−p). We benchmark the measured output biases against ideal predictions and discuss the impact of device noise. Our results establish a simple resource-efficient experimental primitive for quantum-to-classical randomness processing and support the viability of quantum Bernoulli factories for quantum-enhanced stochastic simulation and sampling tasks.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗

Full-stack Quantification of Variability in Predicting Ion Transport Properties using Machine-learned Interatomic Potentials

Machine-learned interatomic potentials (MLIPs) have become the state-of-the-art for performing accurate, scalable molecular dynamics (MD) simulations. It is therefore crucial to understand and quantify the reliability of MLIPs for downstream property predictions. Uncertainty in predicted properties can arise from limitations in first-principles training data, intrinsic MLIP model errors in representing the data, and the statistical noise introduced during subsequent MD simulations. Using ion transport in Li7P3S11 as a case study, we systematically assess the impact of training set size and selection, neural network stochasticity, and MD sampling statistics on predicted diffusivity and activation energy. We find that when using equivariant MLIP architectures with standard MD protocols, uncertainty arising from MD sampling dominates over model-induced errors. In contrast, MLIP errors relative to the underlying first-principles data are consistently minor. Given this, there are two main routes to improving the accuracy of predictions based on MLIP potentials: adopting higher accuracy reference data generation methods, and improving the MD sampling statistics.

36 MATERIALS SCIENCE↗

New avenue to the parton distribution functions: Self-organizing maps

Neural network algorithms have been recently applied to construct parton distribution function (PDF) parametrizations which provide an alternative to standard global fitting procedures. In this exploratory study we propose a technique using self-organizing maps (SOMs). SOMs are a class of clustering algorithms based on competitive learning among spatially ordered neurons. Our SOMs are trained on selections of stochastically generated PDF samples. The selection criterion for every optimization iteration is based on the features of the clustered PDFs. Our goal is a fitting procedure that, at variance with the standard neural network approaches, will allow for an increased control of the systematic bias by enabling user interaction in the various stages of the process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantifying Soiling Loss Directly From PV Yield

Soiling of photovoltaic (PV) panels is typically quantified through the use of specialized sensors. Here, we describe and validate a method for estimating soiling loss experienced by PV systems directly from system yield without the need for precipitation data. The method, termed the stochastic rate and recovery (SRR) method, automatically detects soiling intervals in a dataset, then stochastically generates a sample of possible soiling profiles based on the observed characteristics of each interval. In this paper, we describe the method, validate it against soiling station measurements, and compare it with other PV-yield-based soiling estimation methods. The broader application of the SRR method will enable the fleet scale assessment of soiling loss to facilitate mitigation planning and risk assessment.

14 SOLAR ENERGY↗

Parallel Element Agglomeration Multilevel Monte Carlo Library (ParELAGMC)

ParELAGMC is a parallel distributed memory C++ library for multilevel Monte Carlo (MLMC) simulations with algebraically constructed coarse spaces for estimating statistical moments of a quantity of interest involving solutions of partial differential equations with uncertain coefficients. A primary focus of the library is the scalable generation of Gaussian random fields using a novel stochastic PDE (SPDE) sampling technique for large-scale simulations. A key feature in the SPDE sampling technique is a novel non-matching mesh embedding technique to mitigate artificial boundary artifacts that are inherent in the method. Example applications to uncertainty quantification of subsurface flow simulations in the mixed finite element setting are provided as well.

Osborn, SarahV.↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis :

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗