Adaptive Sparse Grid Model Order Reduction for Fast Bayesian Estimation and Inversion

DOI10.1007/978-3-319-28262-6_1zbMath1337.65012OpenAlexW2505318619MaRDI QIDQ2808015

Peng Chen, Christoph Schwab

Publication date: 26 May 2016

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28262-6_1

Mathematics Subject Classification ID

Bayesian inference (62F15)

Related Items

Learning physics-based models from data: perspectives from inverse problems and model reduction, Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems, Sparse-grid, reduced-basis Bayesian inversion: nonaffine-parametric nonlinear equations, Higher-Order Quasi-Monte Carlo for Bayesian Shape Inversion, Sparse approximation of triangular transports. I: The finite-dimensional case, Finite element approximation of wave problems with correcting terms based on training artificial neural networks with fine solutions, Higher order quasi-Monte Carlo integration for Bayesian PDE inversion, Sampling-free Bayesian inversion with adaptive hierarchical tensor representations, Bayesian inference of heterogeneous epidemic models: application to COVID-19 spread accounting for long-term care facilities, Bayesian Probabilistic Numerical Methods in Time-Dependent State Estimation for Industrial Hydrocyclone Equipment, Multilevel Adaptive Sparse Leja Approximations for Bayesian Inverse Problems, Stein Variational Reduced Basis Bayesian Inversion, Gaussian process regression and conditional polynomial chaos for parameter estimation

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse adaptive approximation of high dimensional parametric initial value problems
• Comparison between reduced basis and stochastic collocation methods for elliptic problems
• Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
• Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
• Dimension-adaptive tensor-product quadrature
• An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
• A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
• Accurate and efficient evaluation of failure probability for partial different equations with random input data
• A general multipurpose interpolation procedure: The magic points
• Sparse Tensor Galerkin Discretization of Parametric and Random Parabolic PDEs---Analytic Regularity and Generalized Polynomial Chaos Approximation
• Inverse problems: A Bayesian perspective
• Weighted Reduced Basis Method for Stochastic Optimal Control Problems with Elliptic PDE Constraint
• Data-driven model reduction for the Bayesian solution of inverse problems
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations
• An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Non‐linear model reduction for uncertainty quantification in large‐scale inverse problems
• Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods