A probabilistic reduced basis method for parameter-dependent problems
From MaRDI portal
Abstract: Probabilistic variants of Model Order Reduction (MOR) methods have recently emerged for improving stability and computational performance of classical approaches. In this paper, we propose a probabilistic Reduced Basis Method (RBM) for the approximation of a family of parameter-dependent functions. It relies on a probabilistic greedy algorithm with an error indicator that can be written as an expectation of some parameter-dependent random variable. Practical algorithms relying on Monte Carlo estimates of this error indicator are discussed. In particular, when using Probably Approximately Correct (PAC) bandit algorithm, the resulting procedure is proven to be a weak greedy algorithm with high probability. Intended applications concern the approximation of a parameter-dependent family of functions for which we only have access to (noisy) pointwise evaluations. As a particular application, we consider the approximation of solution manifolds of linear parameter-dependent partial differential equations with a probabilistic interpretation through the Feynman-Kac formula.
Recommendations
- 4 Reduced basis methods
- How to best sample a solution manifold?
- Adaptive greedy algorithms based on parameter-domain decomposition and reconstruction for the reduced basis method
- Reduced Basis Greedy Selection Using Random Training Sets
- Offline-enhanced reduced basis method through adaptive construction of the surrogate training set
Cites work
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A general multipurpose interpolation procedure: The magic points
- A PAC algorithm in relative precision for bandit problem with costly sampling
- A spectral Monte Carlo method for the Poisson equation
- A variance reduction method for parametrized stochastic differential equations using the reduced basis paradigm
- Adaptivity and variational stabilization for convection-diffusion equations
- Approximation of boundary element matrices
- Bandit algorithms
- Convergence rates for greedy algorithms in reduced basis methods
- Error Estimation for Reduced‐Order Models of Dynamical Systems
- Goal-oriented error estimation for parameter-dependent nonlinear problems
- Greedy algorithms for reduced bases in Banach spaces
- scientific article; zbMATH DE number 5913352 (Why is no real title available?)
- Incomplete cross approximation in the mosaic-skeleton method
- Interpolation of inverse operators for preconditioning parameter-dependent equations
- Monte-Carlo methods and stochastic processes. From linear to non-linear
- Optimal weighted least-squares methods
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
- Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Randomized Residual-Based Error Estimators for Parametrized Equations
- Reduced Basis Greedy Selection Using Random Training Sets
- Sequential Control Variates for Functionals of Markov Processes
- Stochastic Methods for Solving High-Dimensional Partial Differential Equations
Cited in
(2)
This page was built for publication: A probabilistic reduced basis method for parameter-dependent problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126536)
