Reduced order methods for uncertainty quantification problems
METADATA ONLY
Loading...
Author / Producer
Date
2015-01
Publication Type
Report
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
This work provides a review on reduced order methods in solving uncertainty quantification problems. A quick introduction of the reduced order methods, including proper orthogonal decomposition and greedy reduced basis methods, are presented along with the essential components of general greedy algorithm, a posteriori error estimation and Offline-Online decomposition. More advanced reduced order methods are then developed for solving typical uncertainty quantification problems involving pointwise evaluation and/or statistical integration, such as failure probability evaluation, Bayesian inverse problems and variational data assimilation. Three expository examples are provided to demonstrate the efficiency and accuracy of the reduced order methods, shedding the light on their potential for solving problems dealing with more general outputs, as well as time dependent, vectorial noncoercive parametrized problems.
Permanent link
Publication status
published
Editor
Book title
Journal / series
Volume
2015-03
Pages / Article No.
Publisher
Seminar for Applied Mathematics, ETH Zurich
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Uncertainty quantification; Reduced basis method; Proper orthogonal decomposition; Greedy algorithm; A posteriori error estimate; Failure probability evaluation; Inverse problem; Data assimilation
Organisational unit
03435 - Schwab, Christoph / Schwab, Christoph