COMING SOON! PQDT Open is getting a new home!

ProQuest Open Access Dissertations & Theses will remain freely available as part of a new and enhanced search experience at

Questions? Please refer to this FAQ.

Dissertation/Thesis Abstract

Multi-fidelity Stochastic Collocation
by Raissi, Maziar, Ph.D., George Mason University, 2013, 80; 3591697
Abstract (Summary)

Over the last few years there have been dramatic advances in our understanding of mathematical and computational models of complex systems in the presence of uncertainty. This has led to a growth in the area of uncertainty quantification as well as the need to develop efficient, scalable, stable and convergent computational methods for solving differential equations with random inputs. Stochastic Galerkin methods based on polynomial chaos expansions have shown superiority to other non-sampling and many sampling techniques. However, for complicated governing equations numerical implementations of stochastic Galerkin methods can become non-trivial. On the other hand, Monte Carlo and other traditional sampling methods, are straightforward to implement. However, they do not offer as fast convergence rates as stochastic Galerkin. Other numerical approaches are the stochastic collocation (SC) methods, which inherit both, the ease of implementation of Monte Carlo and the robustness of stochastic Galerkin to a great deal. However, stochastic collocation and its powerful extensions, e.g. sparse grid stochastic collocation, can simply fail to handle more levels of complication. The seemingly innocent Burgers equation driven by Brownian motion is such an example. In this work we propose a novel enhancement to stochastic collocation methods using deterministic model reduction techniques that can handle this pathological example and hopefully other more complicated equations like Stochastic Navier Stokes. Our numerical results show the efficiency of the proposed technique. We also perform a mathematically rigorous study of linear parabolic partial differential equations with random forcing terms. Justified by the truncated Karhunen-Loève expansions, the input data are assumed to be represented by a finite number of random variables. A rigorous convergence analysis of our method applied to parabolic partial differential equations with random forcing terms, supported by numerical results, shows that the proposed technique is not only reliable and robust but also very efficient.

Indexing (document details)
Advisor: Seshaiyer, Padmanabhan
Commitee: Antil, Harbir, Draganescu, Andrei, Walnut, David, Wanner, Thomas
School: George Mason University
Department: Mathematics
School Location: United States -- Virginia
Source: DAI-B 74/12(E), Dissertation Abstracts International
Subjects: Applied Mathematics, Mathematics, Statistics
Keywords: Finite elements, Proper orthogonal decomposition, Smolyak algorithm, Sparse grids, Stochastic collocation, Stochastic partial differential equations
Publication Number: 3591697
ISBN: 978-1-303-32397-3
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy