<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://modelreduction.org/morwiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Breiten</id>
	<title>MOR Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://modelreduction.org/morwiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Breiten"/>
	<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/Special:Contributions/Breiten"/>
	<updated>2026-04-13T05:36:59Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.6</generator>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1523</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1523"/>
		<updated>2013-05-30T07:14:55Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad  A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\tilde{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct projection subspaces until interpolation at the reflected reduced system poles is ensured. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly. Moreover, the algorithm has been extended to, e.g., multiple-input-multiple output, discrete time and differential algebraic systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588, 1967.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638, 2008.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691, 2012.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1522</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1522"/>
		<updated>2013-05-30T07:12:32Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad  A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\tilde{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct projection subspaces until interpolation at the reflected reduced system poles is ensured. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly. Moreover, the algorithm has been extended to, e.g., multiple-input-multiple output, discrete time and differential algebraic systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1521</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1521"/>
		<updated>2013-05-30T07:12:07Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad  A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct projection subspaces until interpolation at the reflected reduced system poles is ensured. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly. Moreover, the algorithm has been extended to, e.g., multiple-input-multiple output, discrete time and differential algebraic systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1520</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1520"/>
		<updated>2013-05-30T07:11:38Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct projection subspaces until interpolation at the reflected reduced system poles is ensured. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly. Moreover, the algorithm has been extended to, e.g., multiple-input-multiple output, discrete time and differential algebraic systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1519</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1519"/>
		<updated>2013-05-30T07:10:21Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct projection subspaces until interpolation is ensured. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1518</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1518"/>
		<updated>2013-05-30T07:09:02Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the simple poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct the projection subspaces. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1516</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1516"/>
		<updated>2013-05-30T07:08:20Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the single poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct the projection subspaces. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1515</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1515"/>
		<updated>2013-05-30T07:08:10Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time invariant systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
E\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the single poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct the projection subspaces. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1514</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1514"/>
		<updated>2013-05-30T07:07:49Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The iterative rational Krylov algorithm (IRKA) is an interpolation-based model reduction method for single-input-single-output linear time systems&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;equation id=&amp;quot;gensys&amp;quot; shownumber&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
E\dot{x}(t)=A x(t)+b u(t), \quad&lt;br /&gt;
y(t)=c^Tx(t),\quad E,A\in\mathbb{R}^{n\times n},~b\in\mathbb{R}^{n},~c\in\mathbb{R}^{n}.\qquad (1)&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/equation&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a given system &amp;lt;math&amp;gt;G &amp;lt;/math&amp;gt; and a prescribed reduced system order &amp;lt;math&amp;gt;r&amp;lt;/math&amp;gt;, the goal of the algorithm is to find a local minimizer &amp;lt;math&amp;gt;\hat{G} &amp;lt;/math&amp;gt; for the &amp;lt;math&amp;gt; H_2 &amp;lt;/math&amp;gt; model reduction problem&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
||G-\hat{G} ||_{H_2} = \min_{\text{dim}(\tilde{G})=r} ||G-\hat{G}||_{H_2}. &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Initially investigated in &amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, first order necessary conditions for a local minimizer &amp;lt;math&amp;gt;\hat{G}&amp;lt;/math&amp;gt; imply that its rational transfer function &amp;lt;math&amp;gt;\hat{G}(s)=\hat{c}^T (sI-\hat{A})^{-1}b&amp;lt;/math&amp;gt; is a Hermite interpolant of the original transfer function at its reflected system poles, i.e., &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;&lt;br /&gt;
G(-\hat{\lambda}_i) = \hat{G}(-\hat{\lambda}_i), \quad G&#039;(-\hat{\lambda}_i) = \hat{G}&#039;(-\hat{\lambda}_i), \quad, i =1,\dots,r, &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
where &amp;lt;math&amp;gt;\{\hat{\lambda}_1,\dots,\hat{\lambda}_r\} &amp;lt;/math&amp;gt; are assumed to be the single poles of &amp;lt;math&amp;gt; \hat{G} &amp;lt;/math&amp;gt;. Based on the idea of rational interpolation by rational Krylov subspaces, in &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; the authors have picked up the optimality conditions and proposed to iteratively correct the projection subspaces. In pseudocode, the classical algorithm (IRKA) from &amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; looks like&lt;br /&gt;
&lt;br /&gt;
 1. Make an initial selection of &amp;lt;math&amp;gt;\sigma_i &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i=1,\dots,r &amp;lt;/math&amp;gt; that is closed under conjugation and fix a convergence tolerance &amp;lt;math&amp;gt;tol&amp;lt;/math&amp;gt;.&lt;br /&gt;
 2. Choose &amp;lt;math&amp;gt;V_r &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 3. while (relative change in &amp;lt;math&amp;gt;\{\sigma_i\} &amp;gt; tol&amp;lt;/math&amp;gt;)&lt;br /&gt;
  (a) &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (b) Assign &amp;lt;math&amp;gt;\sigma_i \leftarrow -\lambda_i(\hat{A}),&amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt; i=1,\dots,r&amp;lt;/math&amp;gt;&lt;br /&gt;
  (c) Update &amp;lt;math&amp;gt;V_r&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;W_r&amp;lt;/math&amp;gt; so that &amp;lt;math&amp;gt;\text{Ran}(V_r) =\{(\sigma_1 I -A)^{-1}b,\dots,(\sigma_rI-A)^{-1}b \} &amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\text{Ran}(W_r) =\{(\sigma_1 I -A^T)^{-1}c,\dots,   (\sigma_rI-A^T)^{-1}c \} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; W_r^TV_r=I&amp;lt;/math&amp;gt;.&lt;br /&gt;
 4. &amp;lt;math&amp;gt;\hat{A} = W_r^TAV_r, \hat{b}= W_r^Tb, \hat{c}^T = c^TV_r.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Although a rigorous convergence proof so far has only be given for symmetric state space systems &amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;, numerous experiments have shown that the algorithm often converges rapidly.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;MeiL67&amp;quot;&amp;gt; L. Meier, D.G. Luenberger, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1098680&amp;amp;tag=1 Approximation of linear constant systems]&amp;lt;/span&amp;gt;&amp;quot;, IEEE Transactions on Automatic Control, vol.12, no.5, pp.585-588 1967&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;GugAB08&amp;quot;&amp;gt; S. Gugercin, A.C. Antoulas, C. Beattie &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://epubs.siam.org/doi/abs/10.1137/060666123 H2 Model Reduction for Large-Scale Linear Dynamical Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM. J. Matrix Anal. &amp;amp; Appl., vol.30, no.2, pp.609-638 2008&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;ref name=&amp;quot;FlaBG12&amp;quot;&amp;gt; G. Flagg, C. Beattie, S. Gugercin &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.sciencedirect.com/science/article/pii/S0167691112000576 Convergence of the Iterative Rational Krylov Algorithm]&amp;lt;/span&amp;gt;&amp;quot;, Systems &amp;amp; Control Letters, vol.61, no.6, pp.688-691 2012&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ references&amp;gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1511</id>
		<title>Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Iterative_Rational_Krylov_Algorithm&amp;diff=1511"/>
		<updated>2013-05-30T06:05:13Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Talk:Iterative_Rational_Krylov_Algorithm&amp;diff=1509</id>
		<title>Talk:Iterative Rational Krylov Algorithm</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Talk:Iterative_Rational_Krylov_Algorithm&amp;diff=1509"/>
		<updated>2013-05-30T06:02:18Z</updated>

		<summary type="html">&lt;p&gt;Breiten: Created page with &amp;quot;Category:method Category:linear Category:time invariant Category:first differential order Category:linear algebra  ==Description==&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:linear]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first differential order]]&lt;br /&gt;
[[Category:linear algebra]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=1508</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=1508"/>
		<updated>2013-05-30T05:59:51Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:nonlinear]]&lt;br /&gt;
[[Category:parametric]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N_i \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following &amp;lt;ref&amp;gt;P. Benner and T. Breiten, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://dx.doi.org/10.1002/pamm.201110391 On H2-model reduction of linear parameter-varying systems]&amp;lt;/span&amp;gt;&amp;quot;, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience, 2011.&amp;lt;/ref&amp;gt;, we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear system and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. &amp;lt;ref&amp;gt;P. Benner and T. Damm, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://dx.doi.org/10.1137/09075041X Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems]&amp;lt;/span&amp;gt;&amp;quot;, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&amp;lt;/ref&amp;gt;. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In &amp;lt;ref&amp;gt;P. Benner and T. Breiten, &amp;quot;&amp;lt;span class=&amp;quot;plainlinks&amp;quot;&amp;gt;[http://www.mpi-magdeburg.mpg.de/preprints/2011/MPIMD11-02.pdf Interpolation-based H2-model reduction of bilinear control systems]&amp;lt;/span&amp;gt;&amp;quot;, 2011, Preprint MPIMD/11-02.&amp;lt;/ref&amp;gt;, the authors investigate a possible extension of the linear &amp;lt;math&amp;gt;H_2&amp;lt;/math&amp;gt;-norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm ([[IRKA|IRKA]]) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems (e.g., [[Microthruster_Unit|Microthruster Unit]] and [[Scanning_Electrochemical_Microscopy|Scanning Electrochemical Microscopy]]) and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Contact==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:breiten|Tobias Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=File:FitzHughNagumo.tar.gz&amp;diff=875</id>
		<title>File:FitzHughNagumo.tar.gz</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=File:FitzHughNagumo.tar.gz&amp;diff=875"/>
		<updated>2012-11-27T15:53:54Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=831</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=831"/>
		<updated>2012-11-26T08:21:45Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:non-linear method]]&lt;br /&gt;
[[Category:parametric method]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N_i \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear system and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investigate a possible extension of the linear &amp;lt;math&amp;gt;H_2&amp;lt;/math&amp;gt;-norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems (e.g., [[Microthruster_Unit|Microthruster Unit]] and [[Scanning_Electrochemical_Microscopy|Scanning Electrochemical Microscopy]]) and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, Interpolation-based H2-model reduction of bilinear control systems, 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:breiten|Tobias Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=File:FitzHughNagumo.tar.gz&amp;diff=830</id>
		<title>File:FitzHughNagumo.tar.gz</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=File:FitzHughNagumo.tar.gz&amp;diff=830"/>
		<updated>2012-11-26T08:17:31Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=829</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=829"/>
		<updated>2012-11-26T08:17:22Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Data */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. ([[:Wikipedia:FitzHugh–Nagumo_model|Wikipedia article]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FitzHughNagumo.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For the input function, we have &amp;lt;math&amp;gt;u(t)=[i_0(t),1]&amp;lt;/math&amp;gt;. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=828</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=828"/>
		<updated>2012-11-26T08:17:06Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Data */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. ([[:Wikipedia:FitzHugh–Nagumo_model|Wikipedia article]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For the input function, we have &amp;lt;math&amp;gt;u(t)=[i_0(t),1]&amp;lt;/math&amp;gt;. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=693</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=693"/>
		<updated>2012-11-21T10:54:43Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Data */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. ([[:Wikipedia:FitzHugh–Nagumo_model|Wikipedia article]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For the input function, we have &amp;lt;math&amp;gt;u(t)=[i_0(t),1]&amp;lt;/math&amp;gt;. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=661</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=661"/>
		<updated>2012-11-20T16:37:57Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. ([[:Wikipedia:FitzHugh–Nagumo_model|Wikipedia article]])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=660</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=660"/>
		<updated>2012-11-20T16:37:18Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. [[:Wikipedia:FitzHugh–Nagumo_model]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=658</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=658"/>
		<updated>2012-11-20T16:32:29Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=657</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=657"/>
		<updated>2012-11-20T16:31:06Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&amp;lt;ref&amp;gt;Test&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=656</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=656"/>
		<updated>2012-11-20T16:30:25Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&amp;lt;ref&amp;gt;Test&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=655</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=655"/>
		<updated>2012-11-20T16:29:54Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref&amp;gt;http://en.wikipedia.org/wiki/FitzHugh%E2%80%93Nagumo_model&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=654</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=654"/>
		<updated>2012-11-20T16:28:57Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref&amp;gt;http://en.wikipedia.org/wiki/FitzHugh%E2%80%93Nagumo_model&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=653</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=653"/>
		<updated>2012-11-20T16:26:21Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref name=&amp;quot;WikiFHN&amp;quot;&amp;gt; &amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=652</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=652"/>
		<updated>2012-11-20T16:24:44Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref name=&amp;quot;WikiFHN&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=651</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=651"/>
		<updated>2012-11-20T16:23:12Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref name=&amp;quot;WikiFHN&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&amp;lt;ref name=&amp;quot;WikiFHN&amp;quot;&amp;gt;http://en.wikipedia.org/wiki/FitzHugh%E2%80%93Nagumo_model&amp;lt;/ref&amp;gt;&lt;br /&gt;
&amp;lt;/references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=650</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=650"/>
		<updated>2012-11-20T16:22:33Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current. &amp;lt;ref name=&amp;quot;Wiki_FHN&amp;quot; /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references&amp;gt;&lt;br /&gt;
&amp;lt;ref name=&amp;quot;Wiki_FHN&amp;quot;&amp;gt;http://en.wikipedia.org/wiki/FitzHugh%E2%80%93Nagumo_model&amp;lt;/ref&amp;gt;&lt;br /&gt;
&amp;lt;/references&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=649</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=649"/>
		<updated>2012-11-20T16:15:46Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar.gz]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=File:FHN.tar.gz&amp;diff=648</id>
		<title>File:FHN.tar.gz</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=File:FHN.tar.gz&amp;diff=648"/>
		<updated>2012-11-20T16:15:03Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=647</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=647"/>
		<updated>2012-11-20T16:13:51Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;/math&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=646</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=646"/>
		<updated>2012-11-20T16:10:56Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt; The following picture shows the typical limit cycle behaviour described above.&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==Reformulation as a quadratic-bilinear system==&lt;br /&gt;
&lt;br /&gt;
Instead of the cubic system of ODEs, one can alternatively study a so-called quadratic-bilinear control system of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 E\dot{x}(t) = A x(t) + H x(t) \otimes x(t) + N x(t) u(t) + b u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;E,A,N \in \mathbb R^{n\times n},\ H \in \mathbb R^{n\times n^2} &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; b \in \mathbb R.&amp;lt;/math&amp;gt; The idea relies on artificially introducing a new state variable defined as &amp;lt;math&amp;gt;z(t)=v(t)^2&amp;lt;/math&amp;gt; and subsequently computing the dynamics of the new variable, i.e., specifying &amp;lt;math&amp;gt;\dot{z}(t).&amp;lt;/math&amp;gt; The technique goes back to [2], where it is successfully applied to to several smooth nonlinear control-affine systems. As it is discussed in [3], the previously mentioned introduction of &amp;lt;math&amp;gt;z&amp;lt;/math&amp;gt; yields a quadratic-bilinear control of dimension &amp;lt;math&amp;gt; N = 3\cdot k&amp;lt;/math&amp;gt; with state vector &amp;lt;math&amp;gt;x = [v,w,z]^T.&amp;lt;/math&amp;gt; The increase of the state dimension has the advantage of reducing the nonlinearity from cubic to quadratic. This however opens up the possibility to reduce the system by the generalized moment-matching approach from [2], see also [3] for more details on the implementation.&lt;br /&gt;
&lt;br /&gt;
==Data==&lt;br /&gt;
&lt;br /&gt;
[[File:FHN.tar]]&lt;br /&gt;
&lt;br /&gt;
All matrices of the quadratic-bilinear formulation discretized with &amp;lt;math&amp;gt;k=512&amp;lt;math/&amp;gt; are in the Matrix Market format (http://math.nist.gov/MatrixMarket/). The matrix name is used as an extension of the matrix file. For more information on the discretization details, see [1].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] S. Chaturantabut and D.C. Sorensen, Nonlinear Model Reduction via Discrete Empirical Interpolation, SIAM J. Sci. Comput., 32 (2010), pp. 2737-2764.&lt;br /&gt;
&lt;br /&gt;
[2] C. Gu, QLMOR: A Projection-Based Nonlinear Model Order Reduction Approach Using Quadratic-Linear Representation of Nonlinear Systems, IEEE T. Comput. Aid. D., 30 (2011), pp. 1307-1320.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Breiten, Two-sided moment matching methods for nonlinear model reduction, 2012, Preprint MPIMD/12-12.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=File:FHN.png&amp;diff=637</id>
		<title>File:FHN.png</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=File:FHN.png&amp;diff=637"/>
		<updated>2012-11-20T15:42:08Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=636</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=636"/>
		<updated>2012-11-20T15:41:58Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt;  &lt;br /&gt;
&lt;br /&gt;
[[File:FHN.png]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=635</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=635"/>
		<updated>2012-11-20T15:37:26Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;f(v)=v(v-0.1)(1-v)&amp;lt;/math&amp;gt; and initial and boundary conditions&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v(x,0)=0,\quad w(x,0)=0, \quad x\in [0,1], &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
  v_x(0,t)=-i_0(t), \quad v_x(1,t)\quad =0, \quad t \geq 0,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\epsilon=0.015,\;h=0.5,\;\gamma=2,\;g=0.05,\;i_0(t)=5\cdot&lt;br /&gt;
10^4t^3 \exp(-15t).&amp;lt;/math&amp;gt; In [1], the previous system of coupled nonlinear PDEs is spatially discretized by means of a finite difference scheme with &amp;lt;math&amp;gt;k=512 &amp;lt;/math&amp;gt; nodes for each PDE. Hence, one obtains a nonlinear (cubic) system of ODEs with state dimension &amp;lt;math&amp;gt;n=1024. &amp;lt;/math&amp;gt;  &lt;br /&gt;
&lt;br /&gt;
[[File:FHN.jpg]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=634</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=634"/>
		<updated>2012-11-20T15:21:13Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* Description */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
Here, we present the setting from [1], where the equations for the dynamical system read&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\epsilon v_t(x,t)=\epsilon^2v_{xx}(x,t)+f(v(x,t))-w(x,t)+g, \\&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
 w_t(x,t)=hv(x,t)-\gamma w(x,t)+g,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=633</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=633"/>
		<updated>2012-11-20T15:16:41Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
The FitzHugh-Nagumo system describes a prototype of an excitable system (e.g., a neuron). &lt;br /&gt;
If the external stimulus &amp;lt;math&amp;gt;i_0(t)&amp;lt;/math&amp;gt; exceeds a certain threshold value, the system will exhibit a characteristic excursion in phase space, before the variables &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;w&amp;lt;/math&amp;gt; relax back to their rest values. This behaviour is typical for spike generations (=short elevation of membrane voltage  &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt;) in a neuron after stimulation by an external input current.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=632</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=632"/>
		<updated>2012-11-20T15:03:31Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=631</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=631"/>
		<updated>2012-11-20T15:03:16Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:breiten|breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=630</id>
		<title>FitzHugh-Nagumo System</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=FitzHugh-Nagumo_System&amp;diff=630"/>
		<updated>2012-11-20T15:01:26Z</updated>

		<summary type="html">&lt;p&gt;Breiten: Created page with &amp;#039;Category:benchmark Category:non-linear system Category:time invariant Category:first order system  ==Description==    ==References==&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:non-linear system]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
&lt;br /&gt;
==Description==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=567</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=567"/>
		<updated>2012-11-19T08:08:20Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* References */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:non-linear method]]&lt;br /&gt;
[[Category:parametric method]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N_i \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear system and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investigate a possible extension of the linear &amp;lt;math&amp;gt;H_2&amp;lt;/math&amp;gt;-norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, Interpolation-based H2-model reduction of bilinear control systems, 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:breiten|Tobias Breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=566</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=566"/>
		<updated>2012-11-19T08:06:52Z</updated>

		<summary type="html">&lt;p&gt;Breiten: /* References */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:method]]&lt;br /&gt;
[[Category:non-linear method]]&lt;br /&gt;
[[Category:parametric method]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N_i \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear system and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investigate a possible extension of the linear &amp;lt;math&amp;gt;H_2&amp;lt;/math&amp;gt;-norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, Interpolation-based H2-model reduction of bilinear control systems, 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:breiten]]&#039;&#039;&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=User:Breiten&amp;diff=565</id>
		<title>User:Breiten</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=User:Breiten&amp;diff=565"/>
		<updated>2012-11-19T08:05:22Z</updated>

		<summary type="html">&lt;p&gt;Breiten: Created page with &amp;#039;Tobias Breiten&amp;lt;br/&amp;gt; Max Planck Institute for Dynamics of Complex Technical Systems&amp;lt;br/&amp;gt; Sandtorstr. 1&amp;lt;br/&amp;gt; 39106 Magdeburg&amp;lt;br/&amp;gt; Germany  phone: ++49 391 6110 806&amp;lt;br/&amp;gt; email: brei…&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Tobias Breiten&amp;lt;br/&amp;gt;&lt;br /&gt;
Max Planck Institute for&lt;br /&gt;
Dynamics of Complex Technical Systems&amp;lt;br/&amp;gt;&lt;br /&gt;
Sandtorstr. 1&amp;lt;br/&amp;gt;&lt;br /&gt;
39106 Magdeburg&amp;lt;br/&amp;gt;&lt;br /&gt;
Germany&lt;br /&gt;
&lt;br /&gt;
phone: ++49 391 6110 806&amp;lt;br/&amp;gt;&lt;br /&gt;
email: breiten@mpi-magdeburg.mpg.de&amp;lt;br/&amp;gt;&lt;br /&gt;
www: http://www.mpi-magdeburg.mpg.de/mpcsc/breiten/&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Silicon_Nitride_Membrane&amp;diff=564</id>
		<title>Silicon Nitride Membrane</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Silicon_Nitride_Membrane&amp;diff=564"/>
		<updated>2012-11-19T07:51:15Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Category:benchmark]]&lt;br /&gt;
[[Category:parametric system]]&lt;br /&gt;
[[Category:linear system]]&lt;br /&gt;
[[Category:first order system]]&lt;br /&gt;
[[Category:physical parameters]]&lt;br /&gt;
[[Category:four parameters]]&lt;br /&gt;
[[Category:time invariant]]&lt;br /&gt;
&lt;br /&gt;
==Description of the model==&lt;br /&gt;
&lt;br /&gt;
A silicon nitride membrane (SiN membrane) [1] can be a part of a gas sensor, but also a part of an infra-red sensor, a michrothruster, an optimical filter etc. This structure resembles&lt;br /&gt;
a microhotplate similar to other micro-fabricated devices&lt;br /&gt;
such as gas sensors [2] and infrared sources [3]. See Fig.1, the temperature profile for the silicon nitride membrane.&lt;br /&gt;
&lt;br /&gt;
The governing heat transfer equation in the membrane is:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt; \nabla \cdot (\kappa \nabla T)+Q - \rho c_p \cdot \frac{\partial T}{\partial t}=0 &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\kappa &amp;lt;/math&amp;gt; is the thermal conductivity in &amp;lt;math&amp;gt;W m^{-1} K^{-1}&amp;lt;/math&amp;gt;, cp is the specific heat capacity in &amp;lt;math&amp;gt; J kg^{-1} K^{-1}&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;\rho&amp;lt;/math&amp;gt; is the mass density in &amp;lt;math&amp;gt;kg m^{-3}&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; is the temperature distribution. We assume a homogeneous heat generation rate over a lumped resistor:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;Q = \frac{u^2(t)}{R(T)}&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt; the heat generation rate per unit volume in &amp;lt;math&amp;gt;W m^{-3}&amp;lt;/math&amp;gt;. &lt;br /&gt;
We use the initial condition &amp;lt;math&amp;gt; T_0 = 273K &amp;lt;/math&amp;gt;, and the&lt;br /&gt;
Dirichlet boundary condition &amp;lt;math&amp;gt; T = 273 K &amp;lt;/math&amp;gt; at the bottom of&lt;br /&gt;
the computational domain. &lt;br /&gt;
&lt;br /&gt;
The convection boundary condition at the top of the membrane is&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
q=h(T-T_{air}), &lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;h&amp;lt;/math&amp;gt; is the heat transfer coefficient between the membrane and the ambient air in &amp;lt;math&amp;gt;W m^{-2} K^{-1}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Discretization==&lt;br /&gt;
&lt;br /&gt;
Under the above convection boundary condition and assuming &amp;lt;math&amp;gt;T_{air}=0&amp;lt;/math&amp;gt;, spatial discretization of the heat transfer model leads to the parametrized system as below,&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
(E_0+\rho c_p \cdot E_1) \dot{T} +(A_0 +\kappa \cdot A_1 +h \cdot A_2)T = B \frac{u^2(t)}{R(T)}, \quad&lt;br /&gt;
y=C^T T,&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where the volumetric heat capacity &amp;lt;math&amp;gt;\rho c_p&amp;lt;/math&amp;gt;, thermal conductivity&lt;br /&gt;
&amp;lt;math&amp;gt;\kappa&amp;lt;/math&amp;gt; and the heat transfer coefficient &amp;lt;math&amp;gt;h&amp;lt;/math&amp;gt; between the membrane&lt;br /&gt;
and the ambient air &amp;lt;math&amp;gt;T_{air}&amp;lt;/math&amp;gt;, are kept as parameters. &lt;br /&gt;
&lt;br /&gt;
Here &amp;lt;math&amp;gt;R(T)&amp;lt;/math&amp;gt; is either a constant heat resistivity &amp;lt;math&amp;gt;R(T)=R_0&amp;lt;/math&amp;gt;, or &amp;lt;math&amp;gt;R(T)=R_0(1+\alpha T)&amp;lt;/math&amp;gt;, which depends linearly on the temperature. Here we use &amp;lt;math&amp;gt;R_0=274.94 \Omega&amp;lt;/math&amp;gt; and temperature coefficient &amp;lt;math&amp;gt;\alpha=2.293 \pm 0.006 \times 10^{-4}&amp;lt;/math&amp;gt;. The model was created and meshed in ANSYS. It contains a constant load vector &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt; corresponding to the constant input power of &amp;lt;math&amp;gt;2.49mW&amp;lt;/math&amp;gt;. The number of degrees of freedom is &amp;lt;math&amp;gt;n=60,020&amp;lt;/math&amp;gt;.  &lt;br /&gt;
&lt;br /&gt;
The input function &amp;lt;math&amp;gt;u(t)&amp;lt;/math&amp;gt; is a step function with the value &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt;, which disappears at the time &amp;lt;math&amp;gt;0.02s&amp;lt;/math&amp;gt;. This means between &amp;lt;math&amp;gt;0s&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;0.02s&amp;lt;/math&amp;gt; input is one and after that it is zero. However, be aware that &amp;lt;math&amp;gt;u(t)&amp;lt;/math&amp;gt; is just a factor with which the load vector B is multiplied and which corresponds to the heating power of &amp;lt;math&amp;gt;2.49mW&amp;lt;/math&amp;gt;. This means if one keeps &amp;lt;math&amp;gt;u(t)&amp;lt;/math&amp;gt; as suggested above, the device is heated with &amp;lt;math&amp;gt;2.49mW&amp;lt;/math&amp;gt; for the time length of 0.02s and after that the heating is turned off. If for whatever reason, one wants the heating power to be &amp;lt;math&amp;gt;5mW&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;u(t)&amp;lt;/math&amp;gt; has to be set equal to two, etc...&lt;br /&gt;
When &amp;lt;math&amp;gt;R(T)=R_0(1+\alpha T)&amp;lt;/math&amp;gt;, it is a function of the state vector &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; and hence, the system has non-linear input. (It is also called a weakly nonlinear system.)&lt;br /&gt;
&lt;br /&gt;
==Data information==&lt;br /&gt;
&lt;br /&gt;
The system matrices are in MatrixMarket format (http://math.nist.gov/MatrixMarket/) and can be downloaded here [[File: Matrices_gassensor.tgz]]. The files named by *.&amp;lt;math&amp;gt;A_i, \, i=0,1,2&amp;lt;/math&amp;gt; correspond to the system matrices &amp;lt;math&amp;gt;A_i, \, i=0,1,2&amp;lt;/math&amp;gt;, respectively. The files named by &amp;lt;math&amp;gt;*.E_i, \, i=0,1&amp;lt;/math&amp;gt; correspond to &amp;lt;math&amp;gt;E_i, \, i=0,1&amp;lt;/math&amp;gt;. The file named by &amp;lt;math&amp;gt;*.B&amp;lt;/math&amp;gt; corresponds to the load vector &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt; and the file named by &amp;lt;math&amp;gt;*.C&amp;lt;/math&amp;gt; corresponds to the output matrix &amp;lt;math&amp;gt;C&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
[1] T. Bechtold, D. Hohfeld, E. B. Rudnyi and M. Guenther, &amp;quot;Efficient extraction of thin-film thermal parameters from    numerical models via parametric model order reduction,&amp;quot; J. Micromech. Microeng. 20(2010) 045030 (13pp).&lt;br /&gt;
&lt;br /&gt;
[2] J. Spannhake, O. Schulz, A. Helwig, G. Müller and T. Doll,&amp;quot;Design, development and operational concept of an advanced MEMS IR source for miniaturized gas sensor systems ,&amp;quot;  Proc. Sensors, 762-765, 2005.&lt;br /&gt;
&lt;br /&gt;
[3] M. Graf, D. Barrettino, S. Taschini, C. Hagleitner, A. Hierlemann and H. Baltes, &amp;quot;Metal oxide-based monolithic complementary metal oxide semiconductor gas sensor microsystem,&amp;quot; Anal. Chem., 76:4437-4445, 2004.&lt;br /&gt;
&lt;br /&gt;
Fig.1 &lt;br /&gt;
[[File:Fig_1.png]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Contact information:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; [[User:Feng|Lihong Feng]] &#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Tamara Bechtold (tamara.bechtold@imtek.uni-freiburg.de)&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=329</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=329"/>
		<updated>2011-12-06T07:30:34Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear systems and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investiate a possible extension of the linear &amp;lt;math&amp;gt;H_2&amp;lt;/math&amp;gt;-norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, Interpolation-based H2-model reduction of bilinear control systems, 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=328</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=328"/>
		<updated>2011-12-06T07:29:09Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear systems and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investiate a possible extension of the linear &amp;lt;math&amp;gt;H_2-&amp;lt;/math&amp;gt;norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, Interpolation-based H2-model reduction of bilinear control systems, 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems, In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems, SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=327</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=327"/>
		<updated>2011-12-06T07:28:33Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, following [2], we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear systems and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to e.g. [3]. Another possibility is to aim at a model reduction method which is optimal with respect to a certain system norm. In [1], the authors investiate a possible extension of the linear &amp;lt;math&amp;gt;H_2-&amp;lt;/math&amp;gt;norm and propose an algorithm which extends the well-known iterative rational Krylov algorithm (IRKA) to the bilinear setting specified above. &lt;br /&gt;
&lt;br /&gt;
Both methods have been tested on several LPV control systems and seem to be a reasonable alternative to existing parametric model reduction methods.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[1] P. Benner and T. Breiten, ``Interpolation-based H2-model reduction of bilinear control systems,&amp;quot; 2011, Preprint MPIMD/11-02.&lt;br /&gt;
&lt;br /&gt;
[2] P. Benner and T. Breiten, ``On H2-model reduction of linear parameter-varying&lt;br /&gt;
systems,&amp;quot; In Proceedings in Applied Mathematics and Mechanics. Wiley InterScience,&lt;br /&gt;
2011.&lt;br /&gt;
&lt;br /&gt;
[3] P. Benner and T. Damm, ``Lyapunov Equations, Energy Functionals, and Model Order Reduction&lt;br /&gt;
of Bilinear and Stochastic Systems,&amp;quot; SIAM J. Cont. Optim., 49 (2011), pp. 686-711.&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=326</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=326"/>
		<updated>2011-12-06T07:18:07Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear systems and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \qquad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
	<entry>
		<id>https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=325</id>
		<title>Bilinear PMOR method</title>
		<link rel="alternate" type="text/html" href="https://modelreduction.org/morwiki/index.php?title=Bilinear_PMOR_method&amp;diff=325"/>
		<updated>2011-12-06T07:17:32Z</updated>

		<summary type="html">&lt;p&gt;Breiten: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The model reduction method we present here is applicable to linear parameter-varying (LPV) systems of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^d p_i(t)A_i x(t)+B_0u_0(t),\quad y(t)=Cx(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,A_i \in \mathbb R^{n\times n}, B_0 \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The main idea is that the structure of the above type of systems is quite similar to so-called bilinear control systems. Although belonging to the class of nonlinear control systems, the latter exhibit many features of linear time-invariant systems. In more detail, a bilinear control system is given as follows&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\dot{x}(t)=Ax(t) + \sum_{i=1}^m N_i x(t) u_i(t) + B u(t),&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&amp;lt;math&amp;gt; &lt;br /&gt;
A,N \in \mathbb R^{n\times n}, B \in \mathbb R^{n\times m}&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
and&lt;br /&gt;
&amp;lt;math&amp;gt;  C \in \mathbb R^{p\times n}.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one can see, there seems to be a close connection between LPV and bilinear systems which may be advantageous. To be more precise, we can interpret LPV systems as special bilinear system by simply setting &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
\tilde{A}=A,\;\; \tilde{N}_i=0,\;\;i=1,\dots,m,\;\; \tilde{N}_i=A_i,\;\; i=m+1,\dots,m+d, \;\; \tilde{B}=\begin{bmatrix} B_0 &amp;amp; 0\end{bmatrix},\;\; \tilde{C}=C, \;\; \tilde{u}=\begin{bmatrix} u_0 \\ p_1(t) \\ \vdots \\ p_d(t)\end{bmatrix} .&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It is important to note that in this way the parameter dependency has been hidden in the structure of a bilinear systems and if we use a bilinear model reduction method, we automatically end up with a structure-preserving model reduction method for LPV systems as well. Due to the above mentioned similarity of bilinear and linear control systems, one can generalize some useful and well-known linear concepts. For example, it is possible to extend the method of balanced truncation for bilinear systems. Here, we have to solve generalized Lyapunov equations of the form&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
AX+XA^T +\sum_{i=1}^m N_i X N_i^T + BB^T = 0, \quad A^TY+YA +\sum_{i=1}^m N_i^T Y N_i + C^TC = 0.&lt;br /&gt;
&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For a detailed analysis of this approach, we refer to&lt;/div&gt;</summary>
		<author><name>Breiten</name></author>
	</entry>
</feed>