A Weighted POD Method for Elliptic PDEs with Random Inputs
arXiv:1802.08724 · doi:10.1007/s10915-018-0830-7
Abstract
In this work we propose and analyze a weighted proper orthogonal decomposition method to solve elliptic partial differential equations depending on random input data, for stochastic problems that can be transformed into parametric systems. The algorithm is introduced alongside the weighted greedy method. Our proposed method aims to minimize the error in a norm and, in contrast to the weighted greedy approach, it does not require the availability of an error bound. Moreover, we consider sparse discretization of the input space in the construction of the reduced model; for high-dimensional problems, provided the sampling is done accordingly to the parameters distribution, this enables a sensible reduction of computational costs, while keeping a very good accuracy with respect to high fidelity solutions. We provide many numerical tests to asses the performance of the proposed method compared to an equivalent reduced order model without weighting, as well as to the weighted greedy approach, in both low and higher dimensional problems.
References in corpus (3)
Cited by in corpus (6)
- Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: comparison with linear subspace techniques
- Continuous conditional generative adversarial networks for data-driven solutions of poroelasticity with heterogeneous material properties
- Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning
- Non-intrusive reduced order modeling of poroelasticity of heterogeneous media based on a discontinuous Galerkin approximation
- An optimisation-based domain-decomposition reduced order model for the incompressible Navier-Stokes equations
- A weighted POD-reduction approach for parametrized PDE-constrained Optimal Control Problems with random inputs and applications to environmental sciences