Publications

Results 76–100 of 290

Search results

Jump to search filters

UQTk User Manual (V.3.1.0)

Sargsyan, Khachik; Safta, Cosmin; Johnston, Katherine; Khalil, Mohammad; Chowdhary, Kenny; Rai, Prashant; Casey, Tiernan A.; Zeng, Xiaoshu; Debusschere, Bert J.

The UQ Toolkit (UQTk) is a collection of libraries and tools for the quantification of uncertainty in numerical model predictions. Version 3.1.0 offers intrusive and non-intrusive methods for propagating input uncertainties through computational models, tools for sensitivity analysis, methods for sparse surrogate construction, and Bayesian inference tools for inferring parameters from experimental data. This manual discusses the download and installation process for UQTk, provides pointers to the UQ methods used in the toolkit, and describes some of the examples provided with the toolkit.

More Details

Transitional Markov Chain Monte Carlo Sampler in UQTk

Safta, Cosmin; Khalil, Mohammad; Najm, Habib N.

Transitional Markov Chain Monte Carlo (TMCMC) is a variant of a class of Markov Chain Monte Carlo algorithms known as tempering-based methods. In this report, the implementation of TMCMC in the Uncertainty Quantification Toolkit is investigated through the sampling of high-dimensional distributions, multi-modal distributions, and nonlinear manifolds. Furthermore, the Bayesian model evidence estimates obtained from TMCMC are tested on problems with known analytical solutions and shown to provide consistent results.

More Details

Design optimization of a scramjet under uncertainty using probabilistic learning on manifolds

Journal of Computational Physics

Safta, Cosmin; Ghanem, R.G.; Huan, X.; Lacaze, G.; Oefelein, J.C.; Najm, Habib N.

We demonstrate, on a scramjet combustion problem, a constrained probabilistic learning approach that augments physics-based datasets with realizations that adhere to underlying constraints and scatter. The constraints are captured and delineated through diffusion maps, while the scatter is captured and sampled through a projected stochastic differential equation. The objective function and constraints of the optimization problem are then efficiently framed as non-parametric conditional expectations. Different spatial resolutions of a large-eddy simulation filter are used to explore the robustness of the model to the training dataset and to gain insight into the significance of spatial resolution on optimal design.

More Details

Estimating Regional Methane Emissions Through Atmospheric Measurements and Inverse Modeling

Safta, Cosmin; Bambha, Ray; Michelsen, Hope

In this report we describe an enhanced methodology for performing stochastic Bayesian inversions of atmospheric trace gas inversions that allows the time variation of model parameters to be inferred. We use measurements of methane atmospheric mixing ratio made in Livermore, California along with atmospheric transport modeling and published prior estimates of emissions to estimate the regional emissions of methane and the temporal variations in inferred bias parameters. We compute Bayesian model evidence and continuous rank probability score to optimize the model with respect to temporal resolution. Using two different emissions inventories, we perform inversions for a series of models with increasing temporal resolution in the model bias representation. We show that temporal variation in the model bias can improve the model fit and can also increase the likelihood that the parameterization is appropriate, as measured by the Bayesian model evidence.

More Details

Entropy-based closure for probabilistic learning on manifolds

Journal of Computational Physics

Safta, Cosmin; Soize, C.; Ghanem, R.; Huan, Xun H.; Vane, Z.P.; Oefelein, J.; Lacaze, G.; Najm, Habib N.; Tang, Q.; Chen, X.

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization from a non-Gaussian random vector. The manifold structure is learned using diffusion manifolds and the statistical sample generation is accomplished using a projected Itô stochastic differential equation. This probabilistic learning approach has been extended to polynomial chaos representation of databases on manifolds and to probabilistic nonconvex constrained optimization with a fixed budget of function evaluations. The methodology introduces an isotropic-diffusion kernel with hyperparameter ε. Currently, ε is more or less arbitrarily chosen. In this paper, we propose a selection criterion for identifying an optimal value of ε, based on a maximum entropy argument. The result is a comprehensive, closed, probabilistic model for characterizing data sets with hidden constraints. This entropy argument ensures that out of all possible models, this is the one that is the most uncertain beyond any specified constraints, which is selected. Applications are presented for several databases.

More Details

EGSim - a C++ Toolkit for Analysis of Power Grid Systems

Najm, Habib N.; Safta, Cosmin

We describe the load flow formulation and the solution algorithms available in the Electric power Grid Simulator (EGSim) software toolkit. EGSim contains tools aimed at simulating static load flow solutions for electric power grids. It parses power grid models described in IEEE Common Data Format, and generates solutions for the bus voltages and voltage angles, and real and reactive power values through the transmission lines. The software, written in C++, implements both Gauss-Seidel and Newton solution methods. Example results for the 118 bus models and 300 bus models are also presented.

More Details

Compressive sensing adaptation for polynomial chaos expansions

Journal of Computational Physics

Safta, Cosmin; Tsilifis, Panagiotis; Huan, Xun H.; Sargsyan, Khachik; Lacaze, Guilhem; Oefelein, Joseph C.; Najm, Habib N.; Ghanem, Roger G.

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorithms, resulting in a reduced polynomial chaos approximation with optimal sparsity. The developed adaptation algorithm consists of a two-step optimization procedure that computes the optimal coefficients and the input projection matrix of a low dimensional chaos expansion with respect to an optimally rotated basis. We demonstrate the attractive features of our algorithm through several numerical examples including the application on Large-Eddy Simulation (LES) calculations of turbulent combustion in a HIFiRE scramjet engine.

More Details
Results 76–100 of 290
Results 76–100 of 290
Top