No edit summary |
|||
| Line 41: | Line 41: | ||
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. | 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 | |||
<math> | |||
a(w,v;\mu) = \sum_{q=1}^Q \Theta_a^q(\mu) a^q(w,v) \\ | |||
f(v;\mu) = \sum_{q=1}^{Q^f} \Theta_f^{q}(\mu) f^q(v). | |||
</math> | |||
The Lagrange Reduced Basis space is established by iteratively choosing Lagrange parameter samples <math> S_N = \{\mu^1,...,\mu^N\} </math> | |||
and considering the associated Lagrange RB spaces <math> V_N = \text{span}\{u^\mathcal{N}(\mu^n), 1 \leq n \leq N \} </math> in a greedy sampling. | |||
This leads to hierarchical RB spaces: <math> V_1 \subset V_2 \subset ... \subset V_{N_{max}} </math>. | |||
==Time-Dependent PDEs== | ==Time-Dependent PDEs== | ||
Revision as of 14:29, 19 November 2012
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 and linear form . The parameter is considered within a domain and we are interested in an output quantity which can be expressed via a linear functional of the field variable .
The exact, infinite-dimensional formulation, indicated by the superscript e, is given by
We assume a large-scale discretization to be given, such that we consider
The underlying assumption of the RBM is that the parametrically induced manifold can be approximated by a low dimensional space .
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
Failed to parse (syntax error): {\displaystyle a(w,v;\mu) = \sum_{q=1}^Q \Theta_a^q(\mu) a^q(w,v) \\ f(v;\mu) = \sum_{q=1}^{Q^f} \Theta_f^{q}(\mu) f^q(v). }
The Lagrange Reduced Basis space is established by iteratively choosing Lagrange parameter samples
and considering the associated Lagrange RB spaces in a greedy sampling. This leads to hierarchical RB spaces: .