No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[Category:method]] | |||
The basic idea of almost all the model order reduction (MOR) methods is to | The basic idea of almost all the model order reduction (MOR) methods is to | ||
find a subspace <math>S_1</math> which approximates the manifold where the state | find a subspace <math>S_1</math> which approximates the manifold where the state | ||
| Line 5: | Line 7: | ||
We use the system | We use the system | ||
<math> | <math> | ||
E \frac{d{\bf x}}{dt}=A {\bf x}+B {\bf u}(t), \quad | |||
{\bf y}(t)=C{\bf x}+D{\bf u}(t). | |||
</math> | </math> | ||
Revision as of 15:11, 12 March 2013
The basic idea of almost all the model order reduction (MOR) methods is to
find a subspace which approximates the manifold where the state
vector resides. Afterwards, is approximated by a vector in $S_1$. The reduced model is produced by Petrov-Galerkin projection onto a subspace $S_2$, or by Galerkin projection onto the same subspace .
We use the system
as an example to explain the basic idea. Assuming that an orthonormal basis of the subspace has been found, then the approximation in can be represented by the basis as . Therefore can be approximated by . Here ${\bf z}$ is a vector of length $q \ll n$.
Once is computed, we can get an approximate solution for . The vector can be computed from the reduced model which is derived by the following two steps.