Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic collocation”

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 91 records · Page 5

Stochastic methods for uncertainty quantification in radiation transport

The use of generalized polynomial chaos (gPC) expansions is investigated for uncertainty quantification in radiation transport. The gPC represents second-order random processes in terms of an expansion of orthogonal polynomials of random variables and is used to represent the uncertain input(s) and unknown(s). We assume a single uncertain input-the total macroscopic cross section-although this does not represent a limitation of the approaches considered here. Two solution methods are examined: The Stochastic Finite Element Method (SFEM) and the Stochastic Collocation Method (SCM). The SFEM entails taking Galerkin projections onto the orthogonal basis, which, for fixed source problems, yields a linear system of fully -coupled equations for the PC coefficients of the unknown. For k-eigenvalue calculations, the SFEM system is non-linear and a Newton-Krylov method is employed to solve it. The SCM utilizes a suitable quadrature rule to compute the moments or PC coefficients of the unknown(s), thus the SCM solution involves a series of independent deterministic transport solutions. The accuracy and efficiency of the two methods are compared and contrasted. The PC coefficients are used to compute the moments and probability density functions of the unknown(s), which are shown to be accurate by comparing with Monte Carlo results. Our work demonstrates that stochastic spectral expansions are a viable alternative to sampling-based uncertainty quantification techniques since both provide a complete characterization of the distribution of the flux and the k-eigenvalue. Furthermore, it is demonstrated that, unlike perturbation methods, SFEM and SCM can handle large parameter uncertainty.

97 MATHEMATICS AND COMPUTING↗

Time-Dependent Sensitivity Analysis of OECD Benchmark using BISON and RAVEN

Developments in uncertainty quantification for nuclear simulations have decreased the computational cost required to perform accurate sensitivity analysis. This work demonstrates implementation of these methods in the RAVEN framework, allowing for time-dependent sensitivity analysis. By demonstration we consider an OECD benchmark case. We propagate uncertainties using RAVEN operating on the BISON fuels performance code. We then consider the time-evolution of output response sensitivity to uncertain inputs. We perform sensitivity analysis using time-based stochastic collocation for generalized polynomial chaos (SCgPC) and high-dimension model reduction (HDMR). While uncertainty quantification applied to end-of-cycle statistics is useful, we demonstrate that dominant sources of uncertainty for figures of merit may fluctuate throughout the simulation. Time-dependent sensitivity analysis allows more insight on key design parameters for fuel. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Impact of parametric uncertainty on estimation of the energy deposition into an irradiated brain tumor

Predictions of the total energy deposited into a brain tumor through X-ray irradiation are notoriously error-prone. We investigate how this predictive uncertainty is affected by uncertainty in both the location of the region occupied by a dose-enhancing iodinated contrast agent and the agent's concentration. This is done within the probabilistic framework in which these uncertain parameters are modeled as random variables. We employ the stochastic collocation (SC) method to estimate statistical moments of the deposited energy in terms of statistical moments of the random inputs, and the global sensitivity analysis (GSA) to quantify the relative importance of uncertainty in these parameters on the overall predictive uncertainty. A nonlinear radiation–diffusion equation dramatically magnifies the coefficient of variation of the uncertain parameters, yielding a large coefficient of variation for the predicted energy deposition. This demonstrates that accurate prediction of the energy deposition requires a proper treatment of even small parametric uncertainty. Our analysis also reveals that SC outperforms standard Monte Carlo, but its relative efficiency decreases as the number of uncertain parameters increases from one to three. A robust GSA ameliorates this problem by reducing this number.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A minimally invasive, efficient method for propagation of full-field uncertainty in solid dynamics

In this work, we present a minimally invasive method for forward propagation of material property uncertainty to full-field quantities of interest in solid dynamics. Full-field uncertainty quantification enables the design of complex systems where quantities of interest, such as failure points, are not known a priori. The method, motivated by the well-known probability density function (PDF) propagation method of turbulence modeling, uses an ensemble of solutions to provide the joint PDF of desired quantities at every point in the domain. A small subset of the ensemble is computed exactly, and the remainder of the samples are computed with approximation of the evolution equations based on those exact solutions. Although the proposed method has commonalities with traditional interpolatory stochastic collocation methods applied directly to quantities of interest, it is distinct and exploits the parameter dependence and smoothness of the driving term of the evolution equations. The implementation is model independent, storage and communication efficient, and straightforward. We demonstrate its efficiency, accuracy, scaling with dimension of the parameter space, and convergence in distribution with two problems: a quasi-one-dimensional bar impact, and a two material notched plate impact. For the bar impact problem, we provide an analytical solution to PDF of the solution fields for method validation. With the notched plate problem, we also demonstrate good parallel efficiency and scaling of the method.

42 ENGINEERING↗

Adaptive experimental design for multi-fidelity surrogate modeling of multi-disciplinary systems

We present an adaptive algorithm for constructing surrogate models of multi-disciplinary systems composed of a set of coupled components. With this goal we introduce “coupling” variables with a priori unknown distributions that allow surrogates of each component to be built independently. Once built, the surrogates of the components are combined to form an integrated-surrogate that can be used to predict system-level quantities of interest at a fraction of the cost of the original model. The error in the integrated-surrogate is greedily minimized using an experimental design procedure that allocates the amount of training data, used to construct each component-surrogate, based on the contribution of those surrogates to the error of the integrated-surrogate. Here, the multi-fidelity procedure presented is a generalization of multi-index stochastic collocation that can leverage ensembles of models of varying cost and accuracy, for one or more components, to reduce the computational cost of constructing the integrated-surrogate. Extensive numerical results demonstrate that, for a fixed computational budget, our algorithm is able to produce surrogates that are orders of magnitude more accurate than methods that treat the integrated system as a black-box.

42 ENGINEERING↗

Characterizing the elements of Earth's radiative budget: Applying uncertainty quantification to the CESM

Understanding and characterizing sources of uncertainty in climate modeling is an important task. Because of the ever increasing sophistication and resolution of climate modeling it is increasing important to develop uncertainty quantification methods that minimize the computational cost that occurs when these methods are added to climate modeling. This research explores the application of sparse stochastic collocation with polynomial edge detection to characterize portions of the probability space associated with the Earth's radiative budget in the Community Earth System Model (CESM). Specifically, we develop surrogate models with error estimates for a range of acceptable input parameters that predict statistical values of the Earth's radiative budget as derived from the CESM simulation.

42 ENGINEERING↗

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↗

DAKOTA Design Analysis Kit for Optimization and Terascale

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes (computational models) and iterative analysis methods. 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 analysis of computational models on high performance computers.A user provides a set of DAKOTA commands in an input file and launches DAKOTA. DAKOTA invokes instances of the computational models, collects their results, and performs systems analyses. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, polynomial chaos, stochastic collocation, and epistemic 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 hybrid optimization, surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. Services for parallel computing, simulation interfacing, approximation modeling, fault tolerance, restart, and graphics are also included.

SciDAC↗

Risk Analysis Virtual ENvironment

RAVEN has 3 major functionalities: 1. Provides a Graphical User Interface for the pre- and post-processing of the RELAP-7 input and output. 2. Provides the capability to model nuclear power plants control logic for the RELAP-7 code and dynamic control of the accident scenario evolution. This capability is based on a software structure that realizes a direct connection between the RELAP-7 solver engine (MOOSE) and a python environment where the variables describing the plant status are accessible in a scripting environment. RAVEN support the generation of the probabilistic scenario control by supplying a wide range of probability and cumulative distribution functions and their inverse functions. 3. Provides a general environment to perform probability risk analysis for RELAP-7, RELAP-5 and any generic MOOSE based applications. The probabilistic analysis is performed by sampling the input space of the coupled code parameters and it is enhanced by using modern artificial intelligence algorithms that accelerate the identification of the areas of major risk (in the input parameter space). This environment also provides a graphical visualization capability to analyze the outcomes. Among other approaches, the classical Monte Carlo and Latin Hypercube sampling algorithms are available. For the acceleration of the convergence of the sampling methodologies, Support Vector Machines, Bayesian regression, and collocation stochastic polynomials chaos are implemented. The same methodologies here described could be used to solve optimization and uncertainties propagation problems using the RAVEN framework.

Rabiti, Cristian↗

Emulation to simulate low resolution atmospheric data

Climate simulations require significant compute power, they are complex and therefore it is time consuming to simulate them. We have developed an emulator to simulate unknown climate datasets. The emulator uses stochastic collocation and multi-dimensional in- terpolation to simulate the datasets. We have used the emulator to determine various physical quantities such as temperature, short and long wave cloud forcing, zonal winds etc. The emulation gives results which are very close to those obtained by simulations. The emulator was tested on 2 degree atmospheric datasets. The work evaluates the pros and cons of evaluating the mean first and inter- polating and vice versa. To determine the physical quantities, we have assumed them to be a function of time, longitude, latitude and a random parameter. We have looked at parameters that govern high stable clouds, low stable clouds, timescale for convection etc. The emulator is especially useful as it requires negligible compute times when compared to the simulation itself.

Rao, Vishwas Hebbur Venkata Subba↗

Adaptive resource allocation for surrogate modeling of systems comprised of multiple disciplines with varying fidelity

We present an adaptive algorithm for constructing surrogate models for integrated systems composed of a set of coupled components. With this goal we introduce ‘coupling’ variables with a priori unknown distributions that allow approximations of each component to be built independently. Once built, the surrogates of the components are combined and used to predict system-level quantities of interest (QoI) at a fraction of the cost of interrogating the full system model. We use a greedy experimental design procedure, based upon a modification of Multi-Index Stochastic Collocation (MISC), to minimize the error of the combined surrogate. This is achieved by refining each component surrogate in accordance with its relative contribution to error in the approximation of the system-level QoI. Our adaptation of MISC is a multi-fidelity procedure that can leverage ensembles of models of varying cost and accuracy, for one or more components, to produce estimates of system-level QoI. Several numerical examples demonstrate the efficacy of the proposed approach on systems involving feed-forward and feedback coupling. For a fixed computational budget, the proposed algorithm is able to produce approximations that are orders of magnitude more accurate than approximations that treat the integrated system as a black-box.

97 MATHEMATICS AND COMPUTING↗

Characterizing the elements of Earth s radiative budget: Applying uncertainty quantification to the CESM

Understanding and characterizing sources of uncertainty in climate modeling is an important task. Because of the ever increasing sophistication and resolution of climate modeling it is increasing important to develop uncertainty quantification methods that minimize the computational cost that occurs when these methods are added to climate modeling. This research explores the application of sparse stochastic collocation with polynomial edge detection to characterize portions of the probability space associated with the Earth s radiative budget in the Community Earth System Model (CESM). Specifically, we develop surrogate models with error estimates for a range of acceptable input parameters that predict statistical values of the Earth s radiative budget as derived from the CESM simulation. We extend these results in resolution from T31 to T42 and in parameter space increasing the degrees of freedom from two to three.

Archibald, Richard K↗

Quantifying the Uncertainty in Deterministic Phonon Transport Calculations of Thermal Conductivity using Polynomial Chaos Expansions

The nature of computational simulations requires the inclusion of an uncertainty analysis, as we have limited knowledge of all physically determined input parameters for a computationally simulated problem. We rely on uncertainty quantification (UQ) to characterize our confidence in the outcomes. Quantifying uncertainty can provide a basis for certifications in high-consequence decisions, such as nuclear reactor design, and is a fundamental component of model validation. We employ a previously developed method of uncertainty quantification, polynomial chaos expansion with stochastic collocation (PCE-SC), applied to deterministic phonon transport simulations. In these simulations, we use the neutron transport code Rattlesnake, which solves the Self-Adjoint Angular Flux (SAAF) formulation of the transport equation with a continuous finite element (CFEM) spatial discretization and discrete ordinates, spherical harmonics angular discretizations. Rattlesnake was developed in the multi-physics object oriented simulation environment (MOOSE) framework. We have previously shown Rattlesnake to be effective in simulating phonon transport. We aim to provide a deterministic phonon transport framework for heterogeneous nuclear fuel with fission product defects to predict thermal conductivity (?). A first principles, physics-based calculation of thermal conductivity must involve factors such as the microstructure of nuclear fuel, which constantly changes during the fission process through the formation of isotopic decay products. Heat transport in oxide nuclear fuels is dominated by phonon transport. Impurities in the bulk material influence the transport of energy at the fundamental level, altering the scattering behavior of phonons and electrons. Conventionally, heat transport follows classical physics based on the heat equation derived from Fourier's law q = -k∇T, where q is heat flux, k is thermal conductivity and ∇T is a temperature gradient. However, Fourier's law is a macroscopic empirical law in which the thermal conductivity? does not have a mechanistic connection to the underpinning heat transport processes. Thermal conductivity of a material depends both on the material's intrinsic ability to transport heat and a variety of resistive effects caused by defects in the material. Thus ab initio prediction of the macroscopic conductivity - the property of interest for safe reactor operation - requires simulating detailed processes of heat transport, and then determining the effective thermal conductivity of the simulated material from the resulting heat flux under the imposed temperature difference. The thermal conductivity of a bulk, homogeneous, dielectric material can be well estimated by the mechanistically derived expression: k{sub bulk} = 1/3 C{sub ν}νgλ (2), where C{sub ν}, νg, and λ are the volumetric specific heat, phonon speed, and phonon mean free path, respectively. In these problems the relevant parameter is the material's acoustic thickness, its characteristic distance L relative to the phonon mean free path λ. In Eq. (2) the largest source of uncertainty is λ. While propagating uncertainty in λ to uncertainty in k through Eq. (2) is trivial, systems with extrinsic scattering require more sophisticated approaches. At the microscopic level, uncertainty in λ changes both a material's intrinsic thermal conductivity. Our goal is to propagate the uncertainty in λ through the deterministic transport computation of k. Because there are a small number of uncertain input quantities, we use the method of polynomial chaos expansion (PCE), which expresses solutions in the form of spectral expansions of an uncertain variable. This approach combines both intrusive and nonintrusive methods of uncertainty propagation techniques and results in a unique formulation which is very effective and efficient for problems with few uncertain parameters. Uncertainty Quantification and Sensitivity Analysis We use PCE-SC to measure propagation of uncertainty in a 3-D phonon transport problem of homogeneous silicon, to compute the mean and variance in temperature, heat flux and thermal conductivity. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

An Adaptive Reduced Basis Collocation Method Based on PCM ANOVA Decomposition for Anisotropic Stochastic PDEs

The combination of reduced basis and collocation methods enables efficient and accurate evaluation of the solutions to parameterized PDEs. Here, we study the stochastic collocation methods that can be combined with reduced basis methods to solve high-dimensional parameterized stochastic PDEs. We also propose an adaptive algorithm using a probabilistic collocation method (PCM) and ANOVA decomposition. This procedure involves two stages. First, the method employs an ANOVA decomposition to identify the effective dimensions, i.e., subspaces of the parameter space in which the contributions to the solution are larger, and sort the reduced basis solution in a descending order of error.Then, the adaptive search refines the parametric space by increasing the order of polynomials until the algorithm is terminated by a saturation constraint. We demonstrate the effectiveness of the proposed algorithm for solving a stationary stochastic convection-diffusion equation, a benchmark problem chosen because solutions contain steep boundary layers and anisotropic features. Lastly, we show that two stages of adaptivity are critical in a benchmark problem with anisotropic stochasticity.

97 MATHEMATICS AND COMPUTING↗

An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations

In recent years, there has been a growing interest in analyzing and quantifying the effects of random inputs in the solution of ordinary/partial differential equations. To this end, the spectral stochastic finite element method (SSFEM) is the most popular method due to its fast convergence rate. Recently, the stochastic sparse grid collocation method has emerged as an attractive alternative to SSFEM. It approximates the solution in the stochastic space using Lagrange polynomial interpolation. The collocation method requires only repetitive calls to an existing deterministic solver, similar to the Monte Carlo method. However, both the SSFEM and current sparse grid collocation methods utilize global polynomials in the stochastic space. Thus when there are steep gradients or finite discontinuities in the stochastic space, these methods converge very slowly or even fail to converge. In this paper, we develop an adaptive sparse grid collocation strategy using piecewise multi-linear hierarchical basis functions. Hierarchical surplus is used as an error indicator to automatically detect the discontinuity region in the stochastic space and adaptively refine the collocation points in this region. Numerical examples, especially for problems related to long-term integration and stochastic discontinuity, are presented. Comparisons with Monte Carlo and multi-element based random domain decomposition methods are also given to show the efficiency and accuracy of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation

Recent advances in coupling novel optimization methods to large-scale computing problems have opened the door to tackling a diverse set of physically realistic engineering design problems. A large computational overhead is associated with computing the cost function for most practical problems involving complex physical phenomena. Such problems are also plagued with uncertainties in a diverse set of parameters. We present a novel stochastic derivative-free optimization approach for tackling such problems. Our method extends the previously developed surrogate management framework (SMF) to allow for uncertainties in both simulation parameters and design variables. The stochastic collocation scheme is employed for stochastic variables whereas Kriging based surrogate functions are employed for the cost function. This approach is tested on four numerical optimization problems and is shown to have significant improvement in efficiency over traditional Monte-Carlo schemes. Problems with multiple probabilistic constraints are also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗