Line 1: | Line 1: | ||
[[Category:method]] |
[[Category:method]] |
||
− | + | All the existing model order reduction (MOR) methods is based on projection. That 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 |
||
vector <math>x(t)</math> resides. Afterwards, <math>x(t)</math> is approximated by a vector <math>\tilde x(t)</math> in <math>S_1</math>. The reduced model is produced by Petrov-Galerkin projection onto a subspace <math>S_2</math>, or by Galerkin projection onto the same subspace <math>S_1</math>. |
vector <math>x(t)</math> resides. Afterwards, <math>x(t)</math> is approximated by a vector <math>\tilde x(t)</math> in <math>S_1</math>. The reduced model is produced by Petrov-Galerkin projection onto a subspace <math>S_2</math>, or by Galerkin projection onto the same subspace <math>S_1</math>. |
Revision as of 17:18, 12 March 2013
All the existing model order reduction (MOR) methods is based on projection. That is to
find a subspace which approximates the manifold where the state
vector
resides. Afterwards,
is approximated by a vector
in
. The reduced model is produced by Petrov-Galerkin projection onto a subspace
, 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
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.