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 55 records · Page 3

Evaluation of convergence behavior of metamodeling techniques for bridging scales in multi-scale multimaterial simulation

The effectiveness of several metamodeling techniques, viz. the Polynomial Stochastic Collocation method, Adaptive Stochastic Collocation method, a Radial Basis Function Neural Network, a Kriging Method and a Dynamic Kriging Method is evaluated. This is done with the express purpose of using metamodels to bridge scales between micro- and macro-scale models in a multi-scale multimaterial simulation. The rate of convergence of the error when used to reconstruct hypersurfaces of known functions is studied. For sufficiently large number of training points, Stochastic Collocation methods generally converge faster than the other metamodeling techniques, while the DKG method converges faster when the number of input points is less than 100 in a two-dimensional parameter space. Because the input points correspond to computationally expensive micro/meso-scale computations, the DKG is favored for bridging scales in a multi-scale solver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial chaos expansions for dependent random variables

Polynomial chaos expansions (PCE) are well-suited to quantifying uncertainty in models parameterized by independent random variables. The assumption of independence leads to simple strategies for building multivariate orthonormal bases and for sampling strategies to evaluate PCE coefficients. In contrast, the application of PCE to models of dependent variables is much more challenging. Three approaches can be used to construct PCE of models of dependent variables. The first approach uses mapping methods where measure transformations, such as the Nataf and Rosenblatt transformation, can be used to map dependent random variables to independent ones; however we show that this can significantly degrade performance since the Jacobian of the map must be approximated. A second strategy is the class of dominating support methods. In these approaches a PCE is built using independent random variables whose distributional support dominates the support of the true dependent joint density; we provide evidence that this approach appears to produce approximations with suboptimal accuracy. A third approach, the novel method proposed here, uses Gram-Schmidt orthogonalization (GSO) to numerically compute orthonormal polynomials for the dependent random variables. This approach has been used successfully when solving differential equations using the intrusive stochastic Galerkin method, and in this paper we use GSO to build PCE using a non-intrusive stochastic collocation method. The stochastic collocation method treats the model as a black box and builds approximations of the input-output map from a set of samples. Building PCE from samples can introduce ill-conditioning which does not plague stochastic Galerkin methods. To mitigate this ill-conditioning we generate weighted Leja sequences, which are nested sample sets, to build accurate polynomial interpolants. We show that our proposed approach, GSO with weighted Leja sequences, produces PCE which are orders of magnitude more accurate than PCE constructed using mapping or dominating support methods.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Propagation for Turbulent, Compressible Flow in a Quasi-1D Nozzle Using Stochastic Methods

This paper describes a fully spectral, Polynomial Chaos method for the propagation of uncertainty in numerical simulations of compressible, turbulent flow, as well as a novel stochastic collocation algorithm for the same application. The stochastic collocation method is key to the efficient use of stochastic methods on problems with complex nonlinearities, such as those associated with the turbulence model equations in compressible flow and for CFD schemes requiring solution of a Riemann problem. Both methods are applied to compressible flow in a quasi-one-dimensional nozzle. The stochastic collocation method is roughly an order of magnitude faster than the fully Galerkin Polynomial Chaos method on the inviscid problem.

Zang, Thomas A.↗

ecode - Electron Transport Algorithm Testing v. 1.0

ecode is a Monte Carlo code used for testing algorithms related to electron transport. The code can read basic physics parameters, such as energy-dependent stopping powers and screening parameters. The code permits simple planar geometries of slabs or cubes. Parallelization consists of domain replication, with work distributed at the start of the calculation and statistical results gathered at the end of the calculation. Some basic routines (such as input parsing, random number generation, and statistics processing) are shared with the Integrated Tiger Series codes. A variety of algorithms for uncertainty propagation are incorporated based on the stochastic collocation and stochastic Galerkin methods. These permit uncertainty only in the total and angular scattering cross sections. The code contains algorithms for simulating stochastic mixtures of two materials. The physics is approximate, ranging from mono-energetic and isotropic scattering to screened Rutherford angular scattering and Rutherford energy-loss scattering (simple electron transport models). No production of secondary particles is implemented, and no photon physics is implemented.

Franke, Brian C.↗

Stochastic multiscale flux basis for Stokes-Darcy flows

Three algorithms are developed for uncertainty quantification in modeling coupled Stokes and Darcy flows. The porous media may consist of multiple regions with different properties. The permeability is modeled as a non-stationary stochastic variable, with its log represented as a sum of local Karhunen-Loève (KL) expansions. The problem is approximated by stochastic collocation on either tensor-product or sparse grids, coupled with a multiscale mortar mixed finite element method for the spatial discretization. A non-overlapping domain decomposition algorithm reduces the global problem to a coarse scale mortar interface problem, which is solved by an iterative solver, for each stochastic realization. In the traditional domain decomposition implementation, each subdomain solves a local Dirichlet or Neumann problem in every interface iteration. To reduce this cost, two additional algorithms based on deterministic or stochastic multiscale flux basis are introduced. The basis consists of the local flux (or velocity trace) responses from each mortar degree of freedom. It is computed for each subdomain independently before the interface iteration begins. The use of the multiscale flux basis avoids the need for subdomain solves on each iteration. The deterministic basis is computed at each stochastic collocation and used only at this realization. The stochastic basis is formed by further looping over all local realizations of a subdomain's KL region before the stochastic collocation begins. It is used over multiple realizations. Numerical tests are presented to illustrate the performance of the three algorithms, with the stochastic multiscale flux basis showing significant savings in computational cost compared to the other two algorithms.

97 MATHEMATICS AND COMPUTING↗

Radiation Transport in Random Media With Large Fluctuations

Strongly heterogeneous media arise in several applications that include radiation shields, nuclear fuel, BWR moderators, clouds, planetary and stellar atmospheres, turbulent gases and plasmas. Neutral and charged particle transport computations in such media have relied heavily on formulating transport equations with spatially random coefficients (physical data) and developing solution methods to deal with the additional stochastic dimensions. Attempts at developing approximate closures that yield only low order statistical information (e.g., mean and variance of the flux) have proved to be highly restrictive under real physics conditions or rely on techniques that require fluctuation amplitudes to be small for robustness. Recently, stochastic spectral methods such as polynomial chaos and stochastic collocation have been developed for aleatoric uncertainty quantification and sensitivity analysis, and successfully applied in radiation transport work. Advances in UQ techniques have tended to focus on efficiently handling large numbers of uncertain variables but the rigorous stochastic basis of the approach also promotes its use in situations where stochasticity is due to spatial heterogeneity and the associated uncertainty is large. Here we apply these techniques to radiation transport in media with spatially randomly varying cross sections without restriction on fluctuation amplitudes. Specifically, we represent the cross sections as a lognormal spatial random process with specified mean, variance and covariance function and use a Karhunen-Loeve (KL) decomposition to generate cross section realizations that are strictly positive. Woodcock Monte Carlo (WMC) is then used to simulate transport using random sampling of cross sections and deterministic sampling based on a stochastic collocation technique. Numerical results for the mean and variance in the scalar flux and leakage currents are obtained for weak and strong random variations. We focus in this work on demonstrating the approach and defer application to specific problems to a future investigation. We have demonstrated that a combination of stochastic spectral representation and Woodcock Monte Carlo simulation allows efficient computation of radiation transport in strongly random media. The use of a lognormal distribution to represent the fluctuations in medium properties facilitates enforcement of strict positivity of cross section realizations, a condition that has challenged standard approaches that assume Gaussian fluctuations. The fact that the lognormal random process is a memoryless nonlinear transformation of a Gaussian process further enables efficient and accurate reconstruction of the random cross section realizations using a Karhunen-Loeve representation of the cross section. Finally, the robustness of this model enables fluctuations of arbitrarily large amplitude to be studied, using both random sampling Monte Carlo and more efficient stochastic collocation techniques. The present work is being extended to allow reconstruction of probability density functions of output variables using polynomial chaos representation, and to accommodate general cross section covariance functions. Also, techniques are being explored to more judiciously select ceiling cross sections to enhance the efficiency of Woodcock Monte Carlo for transport in random media. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Monte Carlo solution for uncertainty propagation in particle transport with a stochastic Galerkin method

The stochastic Galerkin method (SGM) is an intrusive technique for propagating data uncertainty in physical models. The method reduces the random model to a system of coupled deterministic equations for the moments of stochastic spectral expansions of result quantities. We investigate solving these equations using the Monte Carlo technique. We compare the efficiency with brute-force Monte Carlo evaluation of uncertainty, the non-intrusive stochastic collocation method (SCM), and an intrusive Monte Carlo implementation of the stochastic collocation method. We also describe the stability limitations of our SGM implementation. (authors)

97 MATHEMATICS AND COMPUTING↗