A goal-oriented reduced basis methods-accelerated generalized polynomial chaos algorithm
From MaRDI portal
Abstract: The non-intrusive generalized Polynomial Chaos (gPC) method is a popular computational approach for solving partial differential equations (PDEs) with random inputs. The main hurdle preventing its efficient direct application for high-dimensional input parameters is that the size of many parametric sampling meshes grows exponentially in the number of inputs (the "curse of dimensionality"). In this paper, we design a weighted version of the reduced basis method (RBM) for use in the non-intrusive gPC framework. We construct an RBM surrogate that can rigorously achieve a user-prescribed error tolerance, and ultimately is used to more efficiently compute a gPC approximation non-intrusively. The algorithm is capable of speeding up traditional non-intrusive gPC methods by orders of magnitude without degrading accuracy, assuming that the solution manifold has low Kolmogorov width. Numerical experiments on our test problems show that the relative efficiency improves as the parametric dimension increases, demonstrating the potential of the method in delaying the curse of dimensionality. Theoretical results as well as numerical evidence justify these findings.
Recommendations
- Reduced basis methods for uncertainty quantification
- Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs
- Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs
- An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk
- A weighted reduced basis method for elliptic partial differential equations with random input data
Cites work
- A posteriorierror bounds for reduced-basis approximations of parametrized parabolic partial differential equations
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- A certified natural-norm successive constraint method for parametric inf-sup lower bounds
- A natural-norm successive constraint method for inf-sup lower bounds
- A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
- A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
- A reduced basis approach for variational problems with stochastic parameters: application to heat conduction with variable Robin coefficient
- A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
- A survey of projection-based model reduction methods for parametric dynamical systems
- A weighted reduced basis method for elliptic partial differential equations with random input data
- A ‘best points’ interpolation method for efficient approximation of parametrized functions
- Adaptive Smolyak Pseudospectral Approximations
- An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
- Convergence rates for greedy algorithms in reduced basis methods
- Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations
- Fast numerical methods for stochastic computations: a review
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- High-Order Collocation Methods for Differential Equations with Random Inputs
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 42145 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- On the Reduced Basis Method
- Parametric analytical preconditioning and its applications to the reduced collocation methods
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Reduced Basis Collocation Methods for Partial Differential Equations with Random Coefficients
- Reduced basis method for the rapid and reliable solution of partial differential equations
- Reduced Basis Methods for Parameterized Partial Differential Equations with Stochastic Influences Using the Karhunen--Loève Expansion
- Reduced basis techniques for stochastic problems
- Reduced collocation methods: Reduced basis methods in the collocation framework
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Cited in
(7)- Offline-enhanced reduced basis method through adaptive construction of the surrogate training set
- A robust error estimator and a residual-free error indicator for reduced basis methods
- An efficient algorithm for a class of stochastic forward and inverse Maxwell models in \(\mathbb{R}^3\)
- Reduced basis methods for nonlocal diffusion problems with random input data
- A deep learning approach to Reduced Order Modelling of parameter dependent partial differential equations
- A reduced-basis polynomial-chaos approach with a multi-parametric truncation scheme for problems with uncertainties
- ANOVA Gaussian process modeling for high-dimensional stochastic computational models
This page was built for publication: A goal-oriented reduced basis methods-accelerated generalized polynomial chaos algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179335)
