Anonymous
×
Create a new article
Write your page title here:
We currently have 105 articles on MOR Wiki. Type your article name above or click on one of the titles below and start writing!



MOR Wiki

Difference between revisions of "Projection based MOR"

Line 1: Line 1:
 
[[Category:method]]
 
[[Category:method]]
   
The basic idea of almost all the model order reduction (MOR) methods is based on projection. That is to
+
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 S_1 which approximates the manifold where the state vector x(t) resides. Afterwards, x(t) is approximated by a vector \tilde x(t) 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 S_1.

We use the system


E \frac{dx(t)}{dt}=A x(t)+B u(t), 
y(t)=Cx(t)+Du(t),

as an example to explain the basic idea. Assuming that an orthonormal basis V=(v_1,v_2, \ldots, v_q) of the subspace S_1 has been found, then the approximation \tilde x(t) in S_1 can be represented by the basis as \tilde x(t)=V z(t). Therefore x(t) can be approximated by  x(t) \approx V z(t). Here z is a vector of length $q \ll n$.

Once z(t) is computed, we can get an approximate solution \tilde x(t)=V z(t) for x(t). The vector z(t) can be computed from the reduced model which is derived by the following two steps.