Model Order Reduction Methods in Computational Uncertainty Quantification

Peng Chen () and Christoph Schwab ()
Additional contact information
Peng Chen: The University of Texas at Austin, Institute for Computational Engineering and Sciences
Christoph Schwab: Seminar for Applied Mathematics, Departement Mathematik

Chapter 27 in Handbook of Uncertainty Quantification, 2017, pp 937-990 from Springer

Abstract: Abstract This work surveys formulation and algorithms for model order reduction (MOR for short) techniques in accelerating computational forward and inverse UQ. Operator equations (comprising elliptic and parabolic partial differential equations (PDEs for short) and boundary integral equations (BIEs for short)) with distributed uncertain input, being an element of an infinite-dimensional, separable Banach space X, are admitted. Using an unconditional basis of X, computational UQ for these equations is reduced to numerical solution of countably parametric operator equations with smooth parameter dependence. In computational forward UQ, efficiency of MOR is based on recent sparsity results for countably parametric solutions which imply upper bounds on Kolmogorov N-widths of the manifold of (countably) parametric solutions and quantities of interest (QoI for short) with dimension-independent convergence rates. Subspace sequences which realize the N-width convergence rates are obtained by greedy search algorithms in the solution manifold. Heuristic search strategies in parameter space based on finite searches over anisotropic sparse grids render greedy searches in reduced basis construction feasible. Instances of the parametric forward problems which arise in the greedy searches are assumed to be discretized by abstract classes of Petrov–Galerkin (PG for short) discretizations of the parametric operator equation, covering most conforming primal, dual, and mixed finite element methods (FEMs), as well as certain space-time Galerkin schemes for the application problem of interest. Based on the PG discretization, MOR for both linear and nonlinear and affine and nonaffine parametric problems are presented. Computational inverse UQ for the mentioned operator equations is considered in the Bayesian setting of [M. Dashti and A.M. Stuart: Inverse problems a Bayesian perspective, arXiv:1302.6989v3, this Handbook]. The (countably) parametric Bayesian posterior density inherits, in the absence of concentration effects for small observation noise covariance, the sparsity and N-width bounds of the (countably) parametric manifolds of solution and QoI. This allows, in turn, for the deployment of MOR techniques for the parsimonious approximation of the parametric Bayesian posterior density, with convergence rates which are only limited by the sparsity of the uncertain inputs in the forward model.

Keywords: Uncertainty quantification; Sparse grid; Reduced basis; Empirical interpolation; Greedy algorithm; High fidelity; Petrov–Galerkin; A posteriori error estimate; A priori error estimate; Bayesian inversion (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-12385-1_70

Ordering information: This item can be ordered from
http://www.springer.com/9783319123851

DOI: 10.1007/978-3-319-12385-1_70

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().