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 379 records · Page 21

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗

Comparison of XSUSA and 'two-step' approaches for full-core uncertainty quantification

While there are multiple sources of error that are introduced into the standard computational regime for simulating reactor cores, rigorous uncertainty analysis methods are available primarily for quantifying the effects of cross section uncertainties. Two methods for propagating cross section uncertainties through core simulators are the XSUSA statistical approach and the 'Two-Step' method. The XSUSA approach, which is based on the SUSA code package, is fundamentally a stochastic sampling method. Alternatively, the Two-Step method utilizes generalized perturbation theory in the first step and stochastic sampling in the second step. The consistency of these two methods in quantifying uncertainties in the multiplication factor and in the core power distribution will be examined in the framework of phase 1-3 of the UAM Benchmark. Using the TMI core as a base model for analysis, the XSUSA and Two-Step methods are applied with certain limitations and the results are compared to those produced by other stochastic sampling-based codes. Based on the uncertainty analysis results, conclusions are made for which method is currently a more viable option for computing uncertainties in burnup and transient calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Comparison of XSUSA and "Two-Step" Approaches for Full Core Uncertainty Quantification

While there are multiple sources of error that are introduced into the standard computational regime for simulating reactor cores, rigorous uncertainty analysis methods are available primarily for quantifying the effects of cross section uncertainties. Two methods for propagating cross section uncertainties through core simulators are the XSUSA statistical approach and the 'Two-Step' method. The XSUSA approach, which is based on the SUSA code package, is fundamentally a stochastic sampling method. Alternatively, the Two-Step method utilizes generalized perturbation theory in the first step and stochastic sampling in the second step. The consistency of these two methods in quantifying uncertainties in the multiplication factor and in the core power distribution will be examined in the framework of phase I-3 of the UAM Benchmark. Using the TMI core as a base model for analysis, the XSUSA and Two-Step methods are applied with certain limitations and the results are compared to those produced by other stochastic sampling-based codes. Based on the uncertainty analysis results, conclusions are made for which method is currently a more viable option for computing uncertainties in burnup and transient calculations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactly constructing model of quantum mechanics with random environment

Dissipation and decoherence, interaction with the random media, continuous measurements and many other complicated problems of open quantum systems are a result of interaction of quantum system with the random environment. These problems mathematically are described in terms of complex probabilistic processes (CPP). Note that CPP satisfies the stochastic differential equation (SDE) of Langevin-Schroedinger(L-Sch)type, and is defined on the extended space R{sup 1} - R{sub {l_brace}{gamma}{r_brace}}, where R{sup 1} and R{sub {l_brace}{gamma}{r_brace}} are the Euclidean and the functional spaces, correspondingly. For simplicity, the model of 1D quantum harmonic oscillator (QHO) with the stochastic environment is considered. On the basis of orthogonal CPP, the method of stochastic density matrix (SDM) is developed. By S DM method, the thermodynamical potentials, such as the nonequilibrium entropy and the energy of the 'ground state' are constructed in a closed form. The expressions for uncertain relations and Wigner function depending on interaction's constant between 1D QHO and the environment are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Hybrid approaches for multiple-species stochastic reaction–diffusion models

Reaction–diffusion models are used to describe systems in fields as diverse as physics, chemistry, ecology and biology. The fundamental quantities in such models are individual entities such as atoms and molecules, bacteria, cells or animals, which move and/or react in a stochastic manner. If the number of entities is large, accounting for each individual is inefficient, and often partial differential equation (PDE) models are used in which the stochastic behaviour of individuals is replaced by a description of the averaged, or mean behaviour of the system. In some situations the number of individuals is large in certain regions and small in others. In such cases, a stochastic model may be inefficient in one region, and a PDE model inaccurate in another. To overcome this problem, we develop a scheme which couples a stochastic reaction–diffusion system in one part of the domain with its mean field analogue, i.e. a discretised PDE model, in the other part of the domain. The interface in between the two domains occupies exactly one lattice site and is chosen such that the mean field description is still accurate there. In this way errors due to the flux between the domains are small. Our scheme can account for multiple dynamic interfaces separating multiple stochastic and deterministic domains, and the coupling between the domains conserves the total number of particles. The method preserves stochastic features such as extinction not observable in the mean field description, and is significantly faster to simulate on a computer than the pure stochastic model. - Highlights: • A novel hybrid stochastic/deterministic reaction–diffusion simulation method is given. • Can massively speed up stochastic simulations while preserving stochastic effects. • Can handle multiple reacting species. • Can handle moving boundaries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic mean-field theory: Method and application to the disordered Bose-Hubbard model at finite temperature and speckle disorder

We discuss the stochastic mean-field theory (SMFT) method, which is a new approach for describing disordered Bose systems in the thermodynamic limit including localization and dimensional effects. We explicate the method in detail and apply it to the disordered Bose-Hubbard model at finite temperature, with on-site box disorder, as well as experimentally relevant unbounded speckle disorder. We find that disorder-induced condensation and re-entrant behavior at constant filling are only possible at low temperatures, beyond the reach of current experiments [M. Pasienski, D. McKay, M. White, and B. DeMarco, e-print arXiv:0908.1182]. Including off-diagonal hopping disorder as well, we investigate its effect on the phase diagram in addition to pure on-site disorder. To make connection to present experiments on a quantitative level, we also combine SMFT with an LDA approach and obtain the condensate fraction in the presence of an external trapping potential.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗

Improved stochastic estimation of quark propagation with Laplacian Heaviside smearing in lattice QCD

A new method of stochastically estimating the low-lying effects of quark propagation is proposed which allows accurate determinations of temporal correlations of single-hadron and multihadron operators in lattice QCD. The method is well suited for calculations in large volumes. Contributions involving quark propagation connecting hadron sink operators at the same final time can be handled in a straightforward manner, even for a large number of final time slices. The method exploits Laplacian Heaviside (LapH) smearing. Z{sub N} noise is introduced in a novel way, and variance reduction is achieved using judiciously-chosen noise-dilution projectors. The method is tested using isoscalar mesons in the scalar, pseudoscalar, and vector channels, and using the two-pion system of total isospin I=0, 1, 2 on large anisotropic 24{sup 3}x128 lattices with spatial spacing a{sub s}{approx}0.12 fm and temporal spacing a{sub t}{approx}0.034 fm for pion masses m{sub {pi}}{approx_equal}390 and 240 MeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗