Reduced Basis PMOR method

The Reduced Basis Method (RBM) we present here is applicable to static and time-dependent linear PDEs.

Time-Independent PDEs

The typical model problem of the RBM consists of a parametrized PDE stated in weak form with bilinear form $a(\cdot ,\cdot ;\mu )$ and linear form $f(\cdot ;\mu )$. The parameter $\mu$ is considered within a domain ${𝒟}$ and we are interested in an output quantity $s(\mu )$ which can be expressed via a linear functional of the field variable $l(\cdot ;\mu )$.

The exact, infinite-dimensional formulation, indicated by the superscript e, is given by

$\{\begin{array}{l}\text{For }\mu \in {𝒟}\subset {\mathbb{ℝ}}^P,\text{ evaluate }\\ s^e(\mu )=l(u^e(\mu );\mu ),\\ \text{where }{u}^e(\mu )\in X^e(\mathrm{\Omega })\text{ satisfies }\\ a(u^e(\mu ),v;\mu )=f(v;\mu ),\mathrm{\forall }v\in X^e.\end{array}$

We assume a large-scale discretization to be given, such that we consider

$\{\begin{array}{l}\text{For }\mu \in {𝒟}\subset {\mathbb{ℝ}}^P,\text{ evaluate }\\ s(\mu )=l(u(\mu );\mu ),\\ \text{where }u(\mu )\in X(\mathrm{\Omega })\text{ satisfies }\\ a(u(\mu ),v;\mu )=f(v;\mu ),\mathrm{\forall }v\in X.\end{array}$

The underlying assumption of the RBM is that the parametrically induced manifold ${ℳ}=\{u(\mu )|\mu \in {𝒟}\}$ can be approximated by a low dimensional space $V_N$.

It also applies the concept of an offline-online decomposition, in that a large pre-processing offline cost is acceptable in view of a very low online cost (of a reduced order model) for each input-output evaluation, when in a many-query or real-time context.

The essential assumption which allows the offline-online decomposition is that there exists an affine parameter dependence

$a(w,v;\mu )=\sum _{q=1}^Q{\mathrm{\Theta }}_a^q(\mu )a^q(w,v)$

$f(v;\mu )=\sum _{q=1}^{Q^f}{\mathrm{\Theta }}_f^q(\mu )f^q(v).$

The Lagrange Reduced Basis space is established by iteratively choosing Lagrange parameter samples

$S_N=\{{\mu }^1,...,{\mu }^N\}$

and considering the associated Lagrange RB spaces

$V_N=\text{span}\{u^{{𝒩}}({\mu }^n),1\le n\le N\}$

in a greedy sampling. This leads to hierarchical RB spaces: $V_1\subset V_2\subset ...\subset V_{N_{max}}$.

We then consider the galerkin projection onto the RB-space $V_N$

$\{\begin{array}{l}\text{For }\mu \in {𝒟}\subset {\mathbb{ℝ}}^P,\text{ evaluate }\\ s_N(\mu )=f(u_N(\mu )),\\ \text{where }{u}_N(\mu )\in V_N\text{ satisfies }\\ a(u_N(\mu ),v;\mu )=f(v),\mathrm{\forall }v\in V_N\end{array}$

The greedy sampling uses an error estimator ${\mathrm{\Delta }}_N(\mu )$ which estimates (even rigorously, in some cases) the approximation error $\Vert u(\mu )-u_N(\mu )\Vert$.

Let $\mathrm{\Xi }$ denote a finite sample of ${𝒟}$ and set $S_1=\{{\mu }^1\}\text{ and }{V}_1=span\{u({\mu }^1)\}$. For $N=2,...,N_{max}$, find ${\mu }^N={\text{arg max}}_{\mu \in \mathrm{\Xi }}{\mathrm{\Delta }}_{N-1}(\mu )$, and then set $S_N=S_{N-1}\cup {\mu }^N,V_N=V_{N-1}+span\{u({\mu }^N)\}$.

Time-Dependent PDEs

When time is involved, it can be roughly considered as an usual parameter just as time-independent problems. But more attention should be paid for the dynamics of the system and the stability is also a major concern, especially for the nonlinear case. Mostly, we use the same notation as time-independent case except the variable Failed to parse (unknown function "\math"): {\displaystyle t <\math> is added explicitly. The exact, infinite-dimensional formulation, indicated by the superscript e, is given by <math> \begin{cases} \text{For } \mu \in \mathcal{D} \subset \mathbb{R}^P, \text{ evaluate } \\ s^e(\mu;t) = l(u^e(\mu;t);\mu;t), \\ \text{where } u^e(\mu;t) \in X^e(\Omega) \text{ satisfies } \\ a(u^e(\mu;t),v;\mu;t) = f(v;\mu;t), \forall v \in X^e. \end{cases} }

References

G. Rozza, D.B.P. Huynh, A.T. Patera Reduced Basis Approximation and a Posteriori Error Estimation for Affinely Parametrized Elliptic Coercive Partial Differential Equations, Arch Comput Methods Eng (2008) 15: 229–275

Contact information:

Martin Hess