Double Greedy Algorithms: Reduced Basis Methods for Transport Dominated Problems

Abstract

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 solution sets. The central ingredient is the construction of computationally feasible "tight" surrogates which in turn are based on deriving a suitable well-conditioned variational formulation for the parameter dependent problem. The theoretical results are illustrated by numerical experiments for convection-diffusion and pure transport equations. In particular, the latter example sheds some light on the smoothness of the dependence of the solutions on the parameters.

Cited by in corpus (8)

• Interpolation of inverse operators for preconditioning parameter-dependent equations
• (Parametrized) First Order Transport Equations: Realization of Optimally Stable Petrov-Galerkin Methods
• Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases
• Multiscale stabilization for convection-dominated diffusion in heterogeneous media
• Projection based model order reduction methods for the estimation of vector-valued variables of interest
• ArbiLoMod: Local Solution Spaces by Random Training in Electrodynamics
• FastLRNR and Sparse Physics Informed Backpropagation
• A Low Rank Neural Representation of Entropy Solutions