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 "Modal truncation"

m
 
(23 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
[[Category:method]]
 
[[Category:method]]
[[Category:DAE order unspecified]]
 
 
[[Category:linear]]
 
[[Category:linear]]
  +
[[Category:Differential_algebraic_system]]
 
[[Category:time invariant]]
 
[[Category:time invariant]]
 
[[Category:first differential order]]
 
[[Category:first differential order]]
Line 8: Line 8:
   
 
==Description==
 
==Description==
Model truncation is one of the oldest MOR methods for linear time invariant systems
+
Model truncation<ref name="Dav66"/> is one of the oldest MOR methods for linear time invariant systems
   
  +
:<equation id="gensys" shownumber>
 
<math>
 
<math>
 
E\dot{x}(t)=A x(t)+B u(t), \quad
 
E\dot{x}(t)=A x(t)+B u(t), \quad
  +
y(t)=Cx(t)+Du(t),\quad E,A\in\mathbb{R}^{n\times n},~B\in\mathbb{R}^{n\times m},~C\in\mathbb{R}^{p\times n},~D\in\mathbb{R}^{p\times m}.\qquad (1)
y(t)=Cx(t)+Du(t) \quad \quad (1)
 
 
</math>
 
</math>
  +
</equation>
   
The main idea is to construct the projection matrices as <math>V=[x_1,\ldots,x_r], W=[y_1,\ldots,y_r]</math> where the <math>x_i, y_i</math> are right and left eigenvectors corresponding to
+
The main idea is to construct the [[Projection_based_MOR|projection matrices]] as <math>V=[x_1,\ldots,x_r], W=[y_1,\ldots,y_r]</math> where the <math>x_i, y_i</math> are right and left eigenvectors corresponding to
 
certain eigenvalues <math>\lambda_i\in\Lambda(A,E)</math>. The eigentriples <math>(\lambda_i,x_i,y_i)</math> satisfy.
 
certain eigenvalues <math>\lambda_i\in\Lambda(A,E)</math>. The eigentriples <math>(\lambda_i,x_i,y_i)</math> satisfy.
   
<math>
+
:<math>
 
Ax_i=\lambda_iEx_i,\quad A^Hy_i=\overline{\lambda_i}E^Hy_i,\quad i=1,\ldots,r.
 
Ax_i=\lambda_iEx_i,\quad A^Hy_i=\overline{\lambda_i}E^Hy_i,\quad i=1,\ldots,r.
 
</math>
 
</math>
Line 26: Line 28:
 
One advantage of such eigenvalue based MOR methods is that they can be easily adapted to more general time invariant systems, for instance, systems in second order form
 
One advantage of such eigenvalue based MOR methods is that they can be easily adapted to more general time invariant systems, for instance, systems in second order form
   
<math>
+
:<math>
 
M\ddot{x}(t)+D\dot{x}(t)+K x(t)=B u(t), \quad
 
M\ddot{x}(t)+D\dot{x}(t)+K x(t)=B u(t), \quad
y(t)=C_px(t)+C_v\dot x(t)+Du(t) \quad \quad (2)
+
y(t)=C_px(t)+C_v\dot x(t)+Du(t)
 
</math>
 
</math>
   
which occur frequently in vibration analysis for mechanical systems. There, <math>M,D,K</math> being referred to as Mass, Damping, and Stiffness matrix are represent a finite element discretization of the mechanical system. In fact, a large variety of modal truncation type approaches originated in this application<ref>P. Koutsovasilis and M. Beitelschmidt, "Comparison of Model Reduction Techniques for Large Mechanical Systems", Multibody
+
which occur frequently in vibration analysis for mechanical systems. There, <math>M,D,K</math> being referred to as Mass, Damping, and Stiffness matrix are represent a finite element discretization of the mechanical system. In fact, a large variety of modal truncation type approaches originated in this application<ref name="KouB08"/>, e.g., Condensation (Guyan reduction)<ref name="Guy65"/> and Component Mode Synthesis (Craig-Bampton)<ref name="CraB68"/>.
System Dynamics, vol.20, no.2, pp.111,128, 2008</ref>, e.g., Condensation (Guyan reduction)<ref>R.J. Guyan, "Reduction of Stiffness and Mass Matrices", AIAA Journal, vol.3, no.2, pp.380, 1965</ref> and Component Mode Synthesis (Craig-Bampton)<ref>R. Craig and M. Bampton, "Coupling of Substructures for Dynamic Analyses", AIAA Journal, vol.6, no.7, pp.1313,1319, 1968</ref>.
 
 
Modal truncation methods can also be generalized to handle linear, time-invariant system with higher time derivatives and even with time-delays, e.g.
 
Modal truncation methods can also be generalized to handle linear, time-invariant system with higher time derivatives and even with time-delays, e.g.
   
<math>
+
:<math>
 
E\dot{x}(t)=A x(t)+Fx(t-\tau)+B u(t), \quad
 
E\dot{x}(t)=A x(t)+Fx(t-\tau)+B u(t), \quad
y(t)=Cx(t)+Du(t) \quad \quad (3),
+
y(t)=Cx(t)+Du(t),
 
</math>
 
</math>
   
Line 48: Line 49:
   
 
== Dominant pole based modal truncation ==
 
== Dominant pole based modal truncation ==
  +
  +
<figure id="bode1">
  +
[[File:Transferf.jpg|350px|thumb|right|<caption>3D Bode plot of transfer function.</caption>]]
  +
</figure>
  +
<figure id="bode2">
  +
[[File:Bode_newengland.jpg|350px|thumb|right|<caption>2D Bode plot of transfer function.</caption>]]
  +
</figure>
  +
 
This modal truncation variant aims at the identification of eigentriplets <math>(\lambda_i,x_i,y_i)</math> which have a strong contribution to the input-output behavior of the dynamical. For this purpose, let all eigenvalues be semisimple and consider the residue expansion of the transfer function matrix (exemplary of (1))
 
This modal truncation variant aims at the identification of eigentriplets <math>(\lambda_i,x_i,y_i)</math> which have a strong contribution to the input-output behavior of the dynamical. For this purpose, let all eigenvalues be semisimple and consider the residue expansion of the transfer function matrix (exemplary of (1))
   
  +
:<equation id="residue" shownumber>
<math>H(s)=C(sE-A)^{-1}B+D=\sum\limits_{j=1}^{n_f}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D+R_{\infty},\quad\quad (4)</math>
+
<math>H(s)=C(sE-A)^{-1}B+D=\sum\limits_{j=1}^{n_f}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D+R_{\infty},\qquad(2)</math>
  +
</equation>
   
 
where <math>n_f</math> is the number of finite eigenvalue of <math>(A,E)</math> and <math>R_{\infty}</math> is the residue corresponding to the infinite eigenvalues. For simplicity we assume <math>R_{\infty}=0</math>. The quantities <math>R_j:=(Cx_j)(y_j^HB)</math> in the numerator of the above series are the residues w.r.t. <math>\lambda_i</math>. Each finite eigenvalue <math>\lambda_i</math> is pole of <math>H(s)</math> and is called dominant pole if its scaled residue norm
 
where <math>n_f</math> is the number of finite eigenvalue of <math>(A,E)</math> and <math>R_{\infty}</math> is the residue corresponding to the infinite eigenvalues. For simplicity we assume <math>R_{\infty}=0</math>. The quantities <math>R_j:=(Cx_j)(y_j^HB)</math> in the numerator of the above series are the residues w.r.t. <math>\lambda_i</math>. Each finite eigenvalue <math>\lambda_i</math> is pole of <math>H(s)</math> and is called dominant pole if its scaled residue norm
Line 56: Line 67:
 
\frac{\|R_j\|}{|\real{\lambda_j}|}
 
\frac{\|R_j\|}{|\real{\lambda_j}|}
 
</math>
 
</math>
is larger than the ones of the other eigentriples which corresponds in some sense to the largest summand in the residue expansion of <math>H(s)</math>. Dominant poles can be observed in the Bode, or sigma plot of <math>H(s)</math> where peaks occur near the imaginary part of the dominant eigenvalue.
+
is larger than the ones of the other eigentriples which corresponds in some sense to the largest summand in the residue expansion of <math>H(s)</math>. Dominant poles can be observed in the Bode, or sigma plot. Fig.&nbsp;1 and Fig.&nbsp;2 illustrates this phenomenon for the [[Power_system_examples|New England]] test system.
   
  +
The upper figure shows a three dimensional surface plot of <math>H(s)</math> in a region in the left half plane. The poles of <math>H(s)</math> (eigenvalues of
Dominant pole based model truncation then amounts to computed the, say <math>r\ll n_f</math>, most dominant poles (i.e., the dominant eigentriplets) and
 
  +
<math>(A,E)</math>) are marked as black dots in the <math>\real(s)-\Im(s)</math>-plane. Observe that the function values grow in the limit
take the associated right and left eigenvectors as columns of the truncation matrices <math>V, W</math>. Equivalently, the reduced order model is obtained by truncating the residue expansion (4):
 
  +
towards infinity as <math>s</math> reaches an eigenvalue <math>\lambda\in\Lambda(A,E)</math>. However, the poles marked as
  +
thick blue dots elevate the function values in a stronger way and are the one with the largest scaled residues, i.e., the dominant poles. The cutsection of this plot along the <math>\Im(s)</math> axis gives the Bode plot and is shown in the bottom figure where peaks occur near the imaginary parts of the dominant poles which are marked by the blue dots.
   
 
Dominant pole based model truncation then amounts to compute the, say <math>r\ll n_f</math>, most dominant poles (i.e., the dominant eigentriplets) and
<math>H(s)\approx\tilde{H}(s)=\sum\limits_{j=1}^{r}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D</math>.
 
 
take the associated right and left eigenvectors as columns of the truncation matrices <math>V, W</math>. Equivalently, the reduced order model is obtained by truncating the residue expansion (2):
  +
 
:<math>H(s)\approx\tilde{H}(s)=\sum\limits_{j=1}^{r}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D</math>.
   
 
Note that <math>\tilde{H}(s)</math> constructed in that way is often called modal equivalent of <math>H(s)</math>.
 
Note that <math>\tilde{H}(s)</math> constructed in that way is often called modal equivalent of <math>H(s)</math>.
A specially tailored eigenvalue algorithm to compute the sought dominant eigentriplets for this task is the (Subspace Accelerated) Dominant Pole Algorithm.
+
A specially tailored eigenvalue algorithm to compute the sought dominant eigentriplets for this task is the [[DPA|(Subspace Accelerated) Dominant Pole Algorithm]]
  +
<ref name="MarLP96"/><ref name="RomM06a"/><ref name="RomM06b"/><ref name="Rom07"/><ref name="RomS08"/><ref name="Kue10"/>.
<ref>N. Martins, L. Lima, and H. Pinto, "Computing dominant poles
 
of power system transfer functions", IEEE Transactions on
 
Power Systems, vol.11, no.1, pp.162,170, 1996</ref>
 
<ref>J. Rommes and N. Martins, "Efficient computation of transfer
 
function dominant poles using subspace acceleration", IEEE Transactions on
 
Power Systems, vol.21, no.3, pp.1218,1226, 2006</ref>
 
<ref>J. Rommes and N. Martins, "Efficient computation of multivariable
 
transfer function dominant poles using subspace acceleration", IEEE Transactions on
 
Power Systems, vol.21, no.4, pp.1471,1483, 2006</ref>
 
<ref>J. Rommes, "Methods for eigenvalue problems with applications
 
in model order reduction", Ph.D. dissertation, Universiteit
 
Utrecht, 2007.</ref>
 
<ref>P. K&uuml;rschner, "Two-sided eigenvalue methods for modal approximation”, Master’s thesis, Chemnitz University of Technology,
 
Department of Mathematics, Germany, 2010.</ref>
 
   
  +
A MATLAB implementation of this algorithms and certain variants thereof can be found at [https://sites.google.com/site/rommes/software https://sites.google.com/site/rommes/software].
   
 
==References==
 
==References==
 
<references>
  +
<ref name="Dav66">E. J. Davison, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098264 A method for simplifying linear dynamic systems]</span>"
  +
, IEEE Transaction on Automated Control, vol. 11, no. 1, 93–101, 1966</ref>
   
  +
<ref name="KouB08">P. Koutsovasilis and M. Beitelschmidt, "<span class="plainlinks">[http://link.springer.com/article/10.1007%2Fs11044-008-9116-4# Comparison of Model Reduction Techniques for Large Mechanical Systems]</span>", Multibody
<references/>
 
  +
System Dynamics, vol.20, no.2, pp.111-128, 2008</ref>
  +
  +
<ref name="Guy65">R.J. Guyan, "<span class="plainlinks">[http://arc.aiaa.org/doi/pdf/10.2514/3.2874 Reduction of Stiffness and Mass Matrices]</span>", AIAA Journal, vol.3, no.2, pp.380, 1965</ref>
  +
  +
<ref name="CraB68">R. Craig and M. Bampton, "<span class="plainlinks">[http://arc.aiaa.org/doi/pdf/10.2514/3.4741 Coupling of Substructures for Dynamic Analyses]</span>", AIAA Journal, vol.6, no.7, pp.1313-1319, 1968</ref>
  +
  +
<ref name="MarLP96">N. Martins, L. Lima, and H. Pinto, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=486093 Computing dominant poles of power system transfer functions]</span>", IEEE Transactions on
 
Power Systems, vol.11, no.1, pp.162-170, 1996</ref>
  +
  +
<ref name="RomM06a">J. Rommes and N. Martins, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=34850&arnumber=1664957&count=60&index=22 Efficient computation of transfer function dominant poles using subspace acceleration]</span>", IEEE Transactions on
 
Power Systems, vol.21, no.3, pp.1218-1226, 2006</ref>
  +
  +
<ref name="RomM06b">J. Rommes and N. Martins, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=36135&arnumber=1717547&count=61&index=0 Efficient computation of multivariable transfer function dominant poles using subspace acceleration]</span>", IEEE Transactions on
 
Power Systems, vol.21, no.4, pp.1471-1483, 2006</ref>
  +
  +
<ref name="Rom07">J. Rommes, "<span class="plainlinks">[http://igitur-archive.library.uu.nl/dissertations/2007-0626-202553/index.htm Methods for eigenvalue problems with applications in model order reduction]</span>", Ph.D. dissertation, Universiteit
 
Utrecht, 2007.</ref>
  +
  +
<ref name="RomS08">J. Rommes and G. L. G. Sleijpen, "<span class="plainlinks">[http://epubs.siam.org/doi/abs/10.1137/060671401 Convergence of the dominant pole algorithm and Rayleigh quotient iteration]</span>", SIAM
  +
Journal on Matrix Analysis and Applications, vol. 30, no. 1,
  +
pp. 346–363, 2008.</ref>
  +
 
<ref name="Kue10">P. K&uuml;rschner, "<span class="plainlinks">[http://www.mpi-magdeburg.mpg.de/mpcsc/mitarbeiter/kuerschner/docs/masterthesis.pdf Two-sided eigenvalue methods for modal approximation]</span>", Master’s thesis, Chemnitz University of Technology,
 
Department of Mathematics, Germany, 2010.</ref>
  +
</references>

Latest revision as of 14:57, 25 August 2022


Description

Model truncation[1] is one of the oldest MOR methods for linear time invariant systems


E\dot{x}(t)=A x(t)+B u(t), \quad
y(t)=Cx(t)+Du(t),\quad E,A\in\mathbb{R}^{n\times n},~B\in\mathbb{R}^{n\times m},~C\in\mathbb{R}^{p\times n},~D\in\mathbb{R}^{p\times m}.\qquad (1)
(1)

The main idea is to construct the projection matrices as V=[x_1,\ldots,x_r],  W=[y_1,\ldots,y_r] where the x_i, y_i are right and left eigenvectors corresponding to certain eigenvalues \lambda_i\in\Lambda(A,E). The eigentriples (\lambda_i,x_i,y_i) satisfy.


Ax_i=\lambda_iEx_i,\quad A^Hy_i=\overline{\lambda_i}E^Hy_i,\quad i=1,\ldots,r.

They are different ways to select this typically small subset of eigenvalues. An often used criterion is to take the eigenvalue closest to the imaginary axis, i.e. the ones with the smallest real part, and their associated eigenvectors into account. Dominant pole based modal truncation selects (\lambda_i,x_i,y_i) with respect to their contribution in the transfer function and is described below.

One advantage of such eigenvalue based MOR methods is that they can be easily adapted to more general time invariant systems, for instance, systems in second order form


M\ddot{x}(t)+D\dot{x}(t)+K x(t)=B u(t), \quad
y(t)=C_px(t)+C_v\dot x(t)+Du(t)

which occur frequently in vibration analysis for mechanical systems. There, M,D,K being referred to as Mass, Damping, and Stiffness matrix are represent a finite element discretization of the mechanical system. In fact, a large variety of modal truncation type approaches originated in this application[2], e.g., Condensation (Guyan reduction)[3] and Component Mode Synthesis (Craig-Bampton)[4]. Modal truncation methods can also be generalized to handle linear, time-invariant system with higher time derivatives and even with time-delays, e.g.


E\dot{x}(t)=A x(t)+Fx(t-\tau)+B u(t), \quad
y(t)=Cx(t)+Du(t),

where \tau\geq0 is the time-delay.

Other advantages are that modal truncation can in principle applied to DAEs of arbitrary index and to unstable systems. They do, however, preserve stability since they do not change the eigenvalues of the original system. They rely on eigenvalue algorithms to compute the required eigentriplets. There are several algorithms available for this purpose for large and sparse matrices.

Disadvantages are the lack of a computationally feasible error bound and the often observed lower approximation accuracy compared to other MOR methods.

Dominant pole based modal truncation

Figure 1: 3D Bode plot of transfer function.
Figure 2: 2D Bode plot of transfer function.

This modal truncation variant aims at the identification of eigentriplets (\lambda_i,x_i,y_i) which have a strong contribution to the input-output behavior of the dynamical. For this purpose, let all eigenvalues be semisimple and consider the residue expansion of the transfer function matrix (exemplary of (1))

H(s)=C(sE-A)^{-1}B+D=\sum\limits_{j=1}^{n_f}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D+R_{\infty},\qquad(2) (2)

where n_f is the number of finite eigenvalue of (A,E) and R_{\infty} is the residue corresponding to the infinite eigenvalues. For simplicity we assume R_{\infty}=0. The quantities R_j:=(Cx_j)(y_j^HB) in the numerator of the above series are the residues w.r.t. \lambda_i. Each finite eigenvalue \lambda_i is pole of H(s) and is called dominant pole if its scaled residue norm 
\frac{\|R_j\|}{|\real{\lambda_j}|}
is larger than the ones of the other eigentriples which corresponds in some sense to the largest summand in the residue expansion of H(s). Dominant poles can be observed in the Bode, or sigma plot. Fig. 1 and Fig. 2 illustrates this phenomenon for the New England test system.

The upper figure shows a three dimensional surface plot of H(s) in a region in the left half plane. The poles of H(s) (eigenvalues of (A,E)) are marked as black dots in the \real(s)-\Im(s)-plane. Observe that the function values grow in the limit towards infinity as s reaches an eigenvalue \lambda\in\Lambda(A,E). However, the poles marked as thick blue dots elevate the function values in a stronger way and are the one with the largest scaled residues, i.e., the dominant poles. The cutsection of this plot along the \Im(s) axis gives the Bode plot and is shown in the bottom figure where peaks occur near the imaginary parts of the dominant poles which are marked by the blue dots.

Dominant pole based model truncation then amounts to compute the, say r\ll n_f, most dominant poles (i.e., the dominant eigentriplets) and take the associated right and left eigenvectors as columns of the truncation matrices V, W. Equivalently, the reduced order model is obtained by truncating the residue expansion (2):

H(s)\approx\tilde{H}(s)=\sum\limits_{j=1}^{r}\frac{(Cx_j)(y_j^HB)}{s-\lambda_j}+D.

Note that \tilde{H}(s) constructed in that way is often called modal equivalent of H(s). A specially tailored eigenvalue algorithm to compute the sought dominant eigentriplets for this task is the (Subspace Accelerated) Dominant Pole Algorithm [5][6][7][8][9][10].

A MATLAB implementation of this algorithms and certain variants thereof can be found at https://sites.google.com/site/rommes/software.

References

  1. E. J. Davison, "A method for simplifying linear dynamic systems" , IEEE Transaction on Automated Control, vol. 11, no. 1, 93–101, 1966
  2. P. Koutsovasilis and M. Beitelschmidt, "Comparison of Model Reduction Techniques for Large Mechanical Systems", Multibody System Dynamics, vol.20, no.2, pp.111-128, 2008
  3. R.J. Guyan, "Reduction of Stiffness and Mass Matrices", AIAA Journal, vol.3, no.2, pp.380, 1965
  4. R. Craig and M. Bampton, "Coupling of Substructures for Dynamic Analyses", AIAA Journal, vol.6, no.7, pp.1313-1319, 1968
  5. N. Martins, L. Lima, and H. Pinto, "Computing dominant poles of power system transfer functions", IEEE Transactions on Power Systems, vol.11, no.1, pp.162-170, 1996
  6. J. Rommes and N. Martins, "Efficient computation of transfer function dominant poles using subspace acceleration", IEEE Transactions on Power Systems, vol.21, no.3, pp.1218-1226, 2006
  7. J. Rommes and N. Martins, "Efficient computation of multivariable transfer function dominant poles using subspace acceleration", IEEE Transactions on Power Systems, vol.21, no.4, pp.1471-1483, 2006
  8. J. Rommes, "Methods for eigenvalue problems with applications in model order reduction", Ph.D. dissertation, Universiteit Utrecht, 2007.
  9. J. Rommes and G. L. G. Sleijpen, "Convergence of the dominant pole algorithm and Rayleigh quotient iteration", SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 1, pp. 346–363, 2008.
  10. P. Kürschner, "Two-sided eigenvalue methods for modal approximation", Master’s thesis, Chemnitz University of Technology, Department of Mathematics, Germany, 2010.