How to best sample a solution manifold?
From MaRDI portal
convection-diffusion problemconvergenceGalerkin methodKolmogorov \(n\)-widthmodel reductionnumerical examplereduced basis methodsingular perturbationsolution manifoldstabilizationweakd greedy algorithm
Singular perturbations in context of PDEs (35B25) Dependence of solutions to PDEs on initial and/or boundary data and/or on parameters of PDEs (35B30) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Abstract: Model reduction attempts to guarantee a desired "model quality", e.g. given in terms of accuracy requirements, with as small a model size as possible. This article highlights some recent developments concerning this issue for the so called Reduced Basis Method (RBM) for models based on parameter dependent families of PDEs. In this context the key task is to sample the {em solution manifold} at judiciously chosen parameter values usually determined in a {em greedy fashion}. The corresponding {em space growth} concepts are closely related to so called {em weak greedy} algorithms in Hilbert and Banach spaces which can be shown to give rise to convergence rates comparable to the best possible rates, namely the {em Kolmogorov -widths} rates. Such algorithms can be interpreted as {em adaptive sampling} strategies for approximating compact sets in Hilbert spaces. We briefly discuss the results most relevant for the present RBM context. The applicability of the results for weak greedy algorithms has however been confined so far essentially to well-conditioned coercive problems. A critical issue is therefore an extension of these concepts to a wider range of problem classes for which the conventional methods do not work well. A second main topic of this article is therefore to outline recent developments of RBMs that do realize -width rates for a much wider class of variational problems covering indefinite or singularly perturbed unsymmetric problems. A key element in this context is the design of {em well-conditioned variational formulations} and their numerical treatment via saddle point formulations. We conclude with some remarks concerning the relevance of uniformly approximating the whole solution manifold also when the {em quantity of interest} is only of a {em functional} of the parameter dependent solutions.
Recommendations
- Convergence rates for greedy algorithms in reduced basis methods
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- 4 Reduced basis methods
- Reduced Basis Greedy Selection Using Random Training Sets
- Generalized reduced basis methods and n-width estimates for the approximation of the solution manifold of parametric PDEs
Cites work
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- ``Natural norm a posteriori error estimators for reduced basis approximations
- A posteriorierror bounds for reduced-basis approximations of parametrized parabolic partial differential equations
- A class of discontinuous Petrov-Galerkin methods. I: The transport equation
- A class of discontinuous Petrov-Galerkin methods. II. Optimal test functions
- A Uniform Analysis of Nonsymmetric and Coercive Linear Operators
- Adaptive Petrov-Galerkin methods for first order transport equations
- Adaptivity and variational stabilization for convection-diffusion equations
- An optimal control approach to a posteriori error estimation in finite element methods
- Approximate symmetrization and Petrov-Galerkin methods for diffusion- convection problems
- Approximation and learning by greedy algorithms
- Certified reduced basis methods for parametrized saddle point problems
- Convergence rates for greedy algorithms in reduced basis methods
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Double greedy algorithms: Reduced basis methods for transport dominated problems
- First-Order System LL* (FOSLL*) for General Scalar Elliptic Problems in the Plane
- Greedy algorithms for reduced bases in Banach spaces
- Mixed and Hybrid Finite Element Methods
- On the stability of the reduced basis method for Stokes equations in parametrized domains
- Reduced basis a posteriori error bounds for the Stokes equations in parametrized domains: a penalty approach
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Robust A Posteriori Error Estimates for Stationary Convection-Diffusion Equations
- Stabilized reduced basis method for parametrized advection-diffusion PDEs
- Variational Multiscale Analysis: the Fine‐scale Green’s Function, Projection, Optimization, Localization, and Stabilized Methods
- Weak greedy algorithms
Cited in
(11)- A two-step model order reduction method to simulate a compressible flow over an extended rough surface
- A theoretical analysis of deep neural networks and parametric PDEs
- A weighted POD method for elliptic PDEs with random inputs
- A discontinuous Galerkin reduced basis numerical homogenization method for fluid flow in porous media
- Lipschitz dependence of the coefficients on the resolvent and greedy approximation for scalar elliptic problems
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- Transformed snapshot interpolation with high resolution transforms
- Interpolation of functions with parameter dependent jumps by transformed snapshots
- A probabilistic reduced basis method for parameter-dependent problems
- Transported snapshot model order reduction approach for parametric, steady-state fluid flows containing parameter-dependent shocks
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
This page was built for publication: How to best sample a solution manifold?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799929)
