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



MOR Wiki

Difference between revisions of "Inverse Lyapunov Procedure"

m
(corrections 1)
Line 7: Line 7:
 
The '''Inverse Lyapunov Procedure''' (ilp) is a synthetic random linear system generator.
 
The '''Inverse Lyapunov Procedure''' (ilp) is a synthetic random linear system generator.
 
It is based on reversing the [[Balanced_Truncation|Balanced Truncation]] procedure and was developed in <ref name="smith03">S.C. Smith, J. Fisher, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1243494 On generating random systems: a gramian approach]</span>", Proceedings of the American Control Conference, 2003.</ref>, where a description of the algorithm is given.
 
It is based on reversing the [[Balanced_Truncation|Balanced Truncation]] procedure and was developed in <ref name="smith03">S.C. Smith, J. Fisher, "<span class="plainlinks">[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1243494 On generating random systems: a gramian approach]</span>", Proceedings of the American Control Conference, 2003.</ref>, where a description of the algorithm is given.
  +
In aggregate form, for randomly generated controllability and observability gramians, a balancing transformation is computed.
 
  +
The balanced gramian is the basis for an associated state-space system, which is determined by solving a [[wikipedia:Lyapunov_equation|Lyapunov equation]] and then unbalanced.
 
A central point is the solution of the Lyapunov equations for the system matrix instead of the gramian matrix.
 
A central point is the solution of the Lyapunov equations for the system matrix instead of the gramian matrix.
This is feasable due to the symmetric (semi-)positive definiteness of the gramians and the requirement of a stable system.
+
This is feasable due to the symmetric (semi-)positive definiteness of the gramians and the requirement for a stable system, yet with a non-unique solution.
  +
The solution will not be unique and include a symmetric system matrix, yet can be solved efficiently using empirical gramians.
 
  +
==Implementation==
  +
  +
An efficient approach to solving the Lyapunov equation is provided by empirical gramians.
   
 
==Usage==
 
==Usage==
   
Use the following matlab code to generate a random system by [[Media:ilp.m|ilp]]:
+
Use the following matlab code to generate a random system as described above:
   
 
<source lang="matlab">
 
<source lang="matlab">
 
   
 
function [A B C] = ilp(J,N,O,s,r)
 
function [A B C] = ilp(J,N,O,s,r)
Line 65: Line 68:
 
B = T*B;
 
B = T*B;
 
C = C*T';
 
C = C*T';
 
 
 
   
 
</source>
 
</source>

Revision as of 12:08, 23 May 2013


Description

The Inverse Lyapunov Procedure (ilp) is a synthetic random linear system generator. It is based on reversing the Balanced Truncation procedure and was developed in [1], where a description of the algorithm is given. In aggregate form, for randomly generated controllability and observability gramians, a balancing transformation is computed. The balanced gramian is the basis for an associated state-space system, which is determined by solving a Lyapunov equation and then unbalanced. A central point is the solution of the Lyapunov equations for the system matrix instead of the gramian matrix. This is feasable due to the symmetric (semi-)positive definiteness of the gramians and the requirement for a stable system, yet with a non-unique solution.

Implementation

An efficient approach to solving the Lyapunov equation is provided by empirical gramians.

Usage

Use the following matlab code to generate a random system as described above:

function [A B C] = ilp(J,N,O,s,r)
% ilp (inverse lyapunov procedure)
% by Christian Himpe, 2013 ( http://gramian.de )
% released under BSD 2-Clause License ( http://gramian.de/#license )
%*

if(exist('emgr')~=2) disp('emgr framework is required. Download at http://gramian.de/emgr.m'); return; end

if(nargin==5) rand('seed',r); randn('seed',r); end;

%% Gramian Eigenvalues
 WC = exp(-N + N*rand(N,1));
 WO = exp(-N + N*rand(N,1));

%% Gramian Eigenvectors
 X = randn(N,N);
 [U E V] = svd(X);

%% Balancing Trafo
 [P D Q] = svd(diag(WC.*WO));
 W = -D;

%% Input and Output
 B = randn(N,J);

 if(nargin<4 || s==0)
        C = randn(O,N);
 else
        C = B';
 end

%% Scale Output Matrix
 BB = sum(B.*B,2);  % = diag(B*B')
 CC = sum(C.*C,1)'; % = diag(C'*C)
 C = bsxfun(@times,C,sqrt(BB./CC)');

%% Solve System Matrix
 f = @(x,u,p) W*x+B*u;
 g = @(x,u,p) C*x;
 A = -emgr(f,g,[J N O],0,[0 0.01 1],'c');

%% Unbalance System
 T = U'*P';
 A = T*A*T';
 B = T*B;
 C = C*T';

The function call requires three parameters; the number of inputs J, of states N and outputs O. Optionally, a symmetric system can be enforced with the parameter s=1. For reproducibility, the random number generator seed can be controlled by the parameter r \in \mathbb{N}. The return value consists of three matrices; the system matrix A, the input matrix B and the output matrix C.

[A,B,C] = ilp(J,N,O,s,r);

ilp is compatible with MATLAB and OCTAVE. The matlab code can be downloaded: ilp.m. The required Empirical Gramian Framework can be obtained from http://gramian.de.

References

  1. S.C. Smith, J. Fisher, "On generating random systems: a gramian approach", Proceedings of the American Control Conference, 2003.


Contact

Christian Himpe