Related papers: A weighted reduced basis method for parabolic PDEs…
We derive computable error estimates for finite element approximations of linear elliptic partial differential equations (PDE) with rough stochastic coefficients. In this setting, the exact solutions contain high frequency content that…
Galerkin reduced order models (ROMs), e.g., based on proper orthogonal decomposition (POD) or reduced basis methods, have achieved significant success in the numerical simulation of fluid flows. The ROM numerical analysis, however, is still…
In this work, we analyze Parametrized Advection-Dominated distributed Optimal Control Problems with random inputs in a Reduced Order Model (ROM) context. All the simulations are initially based on a finite element method (FEM)…
Greedy Sampling Methods (GSMs) are widely used to construct approximate solutions of Configuration Optimization Problems (COPs), where a loss functional is minimized over finite configurations of points in a compact domain. While effective…
Computational models of complex physical systems often rely on simplifying assumptions which inevitably introduce model error, with consequent predictive errors. Given data on model observables, the estimation of parameterized model-error…
We analyze a novel multi-level version of a recently introduced compressed sensing (CS) Petrov-Galerkin (PG) method from [H. Rauhut and Ch. Schwab: Compressive Sensing Petrov-Galerkin approximation of high-dimensional parametric operator…
We consider Galerkin finite element methods for semilinear stochastic partial differential equations (SPDEs) with multiplicative noise and Lipschitz continuous nonlinearities. We analyze the strong error of convergence for spatially…
Classical Proper Orthogonal Decomposition (POD)-based Galerkin projection models of chaotic flows typically require a large number of modes as well as stabilization or closure terms to achieve adequate accuracy and long-term stability. We…
Efficiently solving the Fokker-Planck equation (FPE) is crucial for understanding the probabilistic evolution of stochastic particles in dynamical systems, however, analytical solutions or density functions are only attainable in specific…
We introduce the concept of data-driven finite element methods. These are finite-element discretizations of partial differential equations (PDEs) that resolve quantities of interest with striking accuracy, regardless of the underlying mesh…
The subject of this work is an adaptive stochastic Galerkin finite element method for parametric or random elliptic partial differential equations, which generates sparse product polynomial expansions with respect to the parametric…
In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high…
This paper is concerned with the development of weak Galerkin (WG) finite element method for optimal control problems governed by second order elliptic partial differential equations (PDEs). It is advantageous to use discontinuous finite…
It is known that standard stochastic Galerkin methods face challenges when solving partial differential equations (PDEs) with random inputs. These challenges are typically attributed to the large number of required physical basis functions…
The proximal Galerkin (PG) method is a finite element method for solving variational problems with inequality constraints. It has several advantages, including constraint-preserving approximations and mesh independence. This paper presents…
Design optimization and uncertainty quantification, among other applications of industrial interest, require fast or multiple queries of some parametric model. The Proper Generalized Decomposition (PGD) provides a separable solution, a…
The novel idea of weak Galerkin (WG) finite element methods is on the use of weak functions and their weak derivatives defined as distributions. Weak functions and weak derivatives can be approximated by polynomials with various degrees.…
A methodology to generate sparse Galerkin models of chaotic/unsteady fluid flows containing a minimal number of active triadic interactions is proposed. The key idea is to find an appropriate set of basis functions for the projection…
The central objective of this paper is to develop reduced basis methods for parameter dependent transport dominated problems that are rigorously proven to exhibit rate-optimal performance when compared with the Kolmogorov $n$-widths of the…
We present convergence estimates of two types of greedy algorithms in terms of the metric entropy of underlying compact sets. In the first part, we measure the error of a standard greedy reduced basis method for parametric PDEs by the…