m |
|||
Line 2: | Line 2: | ||
[[Category:linear]] |
[[Category:linear]] |
||
[[Category:time invariant]] |
[[Category:time invariant]] |
||
− | [[Category: |
+ | [[Category:linear algebra]] |
An important projection model reduction method which delivers high quality reduced models by making an extra effort in choosing the projection subspaces. |
An important projection model reduction method which delivers high quality reduced models by making an extra effort in choosing the projection subspaces. |
Revision as of 10:07, 22 April 2013
An important projection model reduction method which delivers high quality reduced models by making an extra effort in choosing the projection subspaces.
A stable minimal (controllable and observable) system , realized by (A,B,C,D) is called balanced, if the Gramians, i.e. the solutions P,Q of the Lyapunov equations
satisfy with
Since in general the spectrum of
are the Hankel singular values for such a balanced system they are given by:
Given an arbitrary system we transform into a balanced one via a state-space transformation
This transformed system has transformed Gramians
and
which are equal and diagonal.
The truncated reduced system is then given by
Implementation: SR Method
One computes it for example by the SR Method.
First one computes the (Cholesky) factors of the gramians . Then we compute the singular value decomposition of
Then the reduced order model is given by where
We get then that which makes
an oblique projector and hence balanced trunctation a Petrov-Galerkin projection method. The reduced model is stable with Hankel Singular Values given by
, where r is the order of the reduced system. It is possible to choose r via the computable error bound