# HOW TO BEST SAMPLE A SOLUTION MANIFOLD

@article{Dahmen2015HOWTB,
title={HOW TO BEST SAMPLE A SOLUTION MANIFOLD},
author={Wolfgang Dahmen},
journal={arXiv: Numerical Analysis},
year={2015},
pages={403-435}
}
• W. Dahmen
• Published 1 March 2015
• Mathematics
• arXiv: Numerical Analysis
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 chapter 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 solution manifold at judiciously chosen parameter values usually determined in a greedy fashion. The corresponding space growth…

## Figures and Tables from this paper

A Weighted POD Method for Elliptic PDEs with Random Inputs
• Computer Science, Mathematics
J. Sci. Comput.
• 2019
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
$h$ and $hp$-adaptive Interpolation by Transformed Snapshots for Parametric and Stochastic Hyperbolic PDEs
The numerical approximation of solutions of parametric or stochastic hyperbolic PDEs is still a serious challenge. Because of shock singularities, most methods from the elliptic and parabolic regime,
Greedy controllability of finite dimensional linear systems
• Mathematics, Computer Science
Autom.
• 2016
N A ] 1 F eb 2 02 0 State Estimation-The Role of Reduced Models
• 2020
The exploration of complex physical or technological processes usually requires exploiting available information from different sources: (i) physical laws often represented as a family of parameter
State Estimation - The Role of Reduced Models
• Computer Science, Mathematics
ArXiv
• 2020
This article reviews some recent developments for this "small-data" scenario where inversion is strongly aggravated by the typically large parametric dimensionality, and discusses optimality criteria which delineate intrinsic information limits.
Transformed snapshot interpolation
Functions with jumps and kinks typically arising from parameter dependent or stochastic hyperbolic PDEs are notoriously difficult to approximate. If the jump location in physical space is parameter
A Theoretical Analysis of Deep Neural Networks and Parametric PDEs
• Mathematics, Computer Science
ArXiv
• 2019
This work derives upper bounds on the complexity of ReLU neural networks approximating the solution maps of parametric partial differential equations using the inherent low-dimensionality of the solution manifold to obtain approximation rates significantly superior to those provided by classical approximation results.
Transformed Snapshot Interpolation with High Resolution Transforms
• G. Welper
• Computer Science, Mathematics
SIAM J. Sci. Comput.
• 2020
This paper introduces a new discretization of the transforms with an appropriate behaviour near singularities and considers their numerical computation via an optimization procedure.
Uncertainty Quantification for Low-Frequency, Time-Harmonic Maxwell Equations with Stochastic Conductivity Models
• Mathematics, Computer Science
SIAM/ASA J. Uncertain. Quantification
• 2018
This work forms and proves the well-posedness of the stochastic and the parametric problem, the latter obtained using a Karhunen--Loeve expansion for the random field with covariance function belonging to the anisotropic Whittle--Matern class, and achieves dimension-independent convergence rates for this model.

## References

SHOWING 1-10 OF 38 REFERENCES
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
• Mathematics, Computer Science
SIAM J. Math. Anal.
• 2011
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic PDEs by determining a “good” n-dimensional space to be used in approximating the elements of a compact set $\mathcal{F}$ in a Hilbert space $\ mathscal{H}$.
Greedy Algorithms for Reduced Bases in Banach Spaces
• Mathematics
• 2012
Given a Banach space X and one of its compact sets $\mathcal{F}$, we consider the problem of finding a good n-dimensional space Xn⊂X which can be used to approximate the elements of $\mathcal{F}$.
A posteriori error bounds for reduced-basis approximations of parametrized parabolic partial differential equations
• Mathematics
• 2005
In this paper, we extend the reduced-basis methods and associated a posteriori error estimators developed earlier for elliptic partial differential equations to parabolic problems with affine
Convergence Rates of Best N-term Galerkin Approximations for a Class of Elliptic sPDEs
• Computer Science, Mathematics
Found. Comput. Math.
• 2010
New regularity theorems describing the smoothness properties of the solution u as a map from y∈U=(−1,1)∞ to a smoothness space W⊂V are established leading to analytic estimates on the W norms of the gpc coefficients and on their space discretization error.
Adaptive Petrov-Galerkin Methods for First Order Transport Equations
• Mathematics, Computer Science
SIAM J. Numer. Anal.
• 2012
Stable variational formulations are proposed for certain linear, unsymmetric operators with first order transport equations in bounded domains serving as the primary focus of this paper to adaptively resolve anisotropic solution features such as propagating singularities.
Approximation and learning by greedy algorithms
• Mathematics
• 2008
We consider the problem of approximating a given element f from a Hilbert space H by means of greedy algorithms and the application of such procedures to the regression problem in statistical
Reduced Basis Approximation and a Posteriori Error Estimation for Affinely Parametrized Elliptic Coercive Partial Differential Equations
• Mathematics
• 2007
In this paper we consider (hierarchical, Lagrange) reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial
REDUCED BASIS A POSTERIORI ERROR BOUNDS FOR THE STOKES EQUATIONS IN PARAMETRIZED DOMAINS: A PENALTY APPROACH
• Mathematics
• 2011
We present reduced basis approximations and associated rigorous a posteriori error bounds for the Stokes equations in parametrized domains. The method, built upon the penalty formulation for saddle
Reduced Basis Approximation and A Posteriori Error Estimation for Parametrized Partial Differential Equations
• Mathematics
• 2007
The text is focused on formulation, analysis, and computational procedures for reduced basis approximation and a posteriori error estimation for parametrized PDEs in the real-time and many-query