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



Projection based MOR: Difference between revisions

No edit summary
No edit summary
Line 42: Line 42:
</math>
</math>


Notice that the approximation <math>\tilde x(t)=Vz(t)</math> of <math>x(t)</math>  can be obtained from <math> z}(t)</math> by solving the system in(3). The system in~(3) is much smaller than the system in~(1) in the sense that there are many less equations in (3) than in (1). Therefore, the system in (3) is much easier to be solved, which is the so-called reduced model. In order to save the simulation time of solving (1), reduced model can be used to replace (1) to attain a fast simulation. Furthermore, the error between the two systems should be within acceptable tolerance. The error can be measured through the error between the the state vectors <math>x(t), \tilde x(t)</math>, or between the output responses <math>y(t), \hat y(t)</math>, or between the transfer functions of the two systems.
Notice that the approximation <math>\hat x(t)=Vz(t)</math> of <math>x(t)</math>  can be obtained from <math> z(t)</math> by solving the system in(3). The system in~(3) is much smaller than the system in~(1) in the sense that there are many less equations in (3) than in (1). Therefore, the system in (3) is much easier to be solved, which is the so-called reduced model. In order to save the simulation time of solving (1), reduced model can be used to replace (1) to attain a fast simulation. Furthermore, the error between the two systems should be within acceptable tolerance. The error can be measured through the error between the the state vectors <math>x(t), \hat x(t)</math>, or between the output responses <math>y(t), \hat y(t)</math>, or between the transfer functions of the two systems.

Revision as of 15:42, 12 March 2013


All the existing model order reduction (MOR) methods are based on projection. That is to find a subspace S1 which approximates the manifold where the state vector x(t) resides. Afterwards, x(t) is approximated by a vector x~(t) in S1. The reduced model is produced by Petrov-Galerkin projection onto a subspace S2, or by Galerkin projection onto the same subspace S1.

We use the system

Edx(t)dt=Ax(t)+Bu(t), y(t)=Cx(t),

as an example to explain the basic idea. Assuming that an orthonormal basis V=(v1,v2,,vq) of the subspace S1 has been found, then the approximation x~(t) in S1 can be represented by the basis as x~(t)=Vz(t). Therefore x(t) can be approximated by x(t)Vz(t). Here z is a vector of length $q \ll n$.

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

Step 1. By replacing x in (1) with Vz, we get


EdVzdtAVz+Bu(t), y(t)CVz.


Step 2. The residual is denoted as e=AVz+Bu(t)EdVzdt. Force e=0 in a properly chosen subspace S2 of n leads to the Petrov-Galerkin projection: WTe=0, where the columns of W are the basis of S2. The the reduced model is

WTEdVzt=WTAVz+WTBu(t), y^(t)=CVz.

By defining E^=WTEV, A^=WTAV,B^=WTB, C^=CV, we get the final reduced model

E^dz(t)dt=A^z(t)+B^u(t), y^(t)=C^z(t).

Notice that the approximation x^(t)=Vz(t) of x(t) can be obtained from z(t) by solving the system in(3). The system in~(3) is much smaller than the system in~(1) in the sense that there are many less equations in (3) than in (1). Therefore, the system in (3) is much easier to be solved, which is the so-called reduced model. In order to save the simulation time of solving (1), reduced model can be used to replace (1) to attain a fast simulation. Furthermore, the error between the two systems should be within acceptable tolerance. The error can be measured through the error between the the state vectors x(t),x^(t), or between the output responses y(t),y^(t), or between the transfer functions of the two systems.