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!



Revision as of 09:22, 6 December 2018 by Himpe (talk | contribs) (init)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Note: This page has not been verified by our editors.


Dominant Subspace Projection Model Reduction Method

The Dominant Subspace Projection Model Reduction Method (DSPMR), introduced in [1], or short Dominant Subspaces method is closely related to Balanced Truncation, and can be seen as a simplification. This is projection-based method is designed for linear time-invariant systems:

x˙(t)=Ax(t)+Bu(t),y(t)=Cx(t).

Similar to Balanced Truncation, the controllability Gramian matrix WC and the observability Gramian matrix WO are computed:

AWC+WCAT=BBT,
ATWO+WOA=CTC.

As a second step, instead of balancing controllability and observability subspaces, the respective subspaces are conjoined. Typically, (low-rank) Cholesky factors of the system Gramians are computed directly,

WC=LCLCT,
WO=LOLOT,

which are then combined using a singular value decomposition of the concatenated factors:

[LC,LO]=UDV.

The principal left (or right) singular vectors, based on the magnitude of the singular values, then serve as a Galerkin projection.

Alternatively, different approaches for the combination of subspaces can be used. For example in [2] and [3], the singular vectors of the singular value decompositions of the system Gramians,

WC=UCDCVC,
WO=UODOVO,

are concatenated and orthogonalized by a rank-revealing QR decomposition:

[UC,UO]=QR,

with Q being the resulting Galerkin projection.

Furthermore, the singular vectors of the system Gramians can also be combined by a second singular value decomposition as in [4].

Variants

Refined DSPMR

In [1], a variant called Refined Dominant Subspace Projection Model Reduction Method is presented. For this variant the subspaces are weighted by their Frobenius norm before combination, so for example:

[1LCFroLC,1LOFroLO]=UDV.
[1UCFroUC,1UOFroUO]=QR.

Cross-Gramian-Based DSPMR

Instead of using controllability and observability Gramians, also the cross Gramian WX can be used for the DSPMR procedure [4],

AWX+WXA=BC,.

The cross Gramian encodes controllability and observability, hence a singular value decompostion of the (the generally not-symmetric) cross Gramian matrix reveals dominant controllability and observability subspaces,

WX=UCDXVO,

which can then be combined by another singular value decomposition:

[UC,VO]=UDV.

The principal left (or right) singular values then represent the Galerkin projection.

This variant can also be refined, as proposed in [4], by scaling the left and right singular vectors by their associated singular values:

[UCDX,VODX]=UDV.

References

  1. 1.0 1.1 T. Penzl, "Algorithms for model reduction of large dynamical systems", Linear Algebra Appl., 415(2--3): 322--343, 2006. (Reprint of Technical Report SFB393/99-40, TU Chemnitz, 1999.).
  2. J.-R. Li and J. White. "Efficient model reduction of interconnect via approximate system Gramians", In 1999 IEEE/ACM International Conference on Computer-Aided Design: 380--383, 1999.
  3. J.-R. Li and J. White. "Reduction of large circuit models via low rank approximate Gramians", Int. J. Appl. Math. Comput. Sci, 11(5):1151–1171, 2001
  4. 4.0 4.1 4.2 P. Benner, C. Himpe, "Cross-Gramian-Based Dominant Subspaces", arXiv, math.OC: 1809.08066, 2018.