direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Computation of the L∞-Norm for Descriptor Systems

This algorithm is an extension of the well-known Boyd/Balakrishan algorithm to descriptor systems. The occuring structured eigenvalue problems are robustly and efficiently solved using structure-preserving methods. Continuous-time, as well as discrete-time problems can be treated. A MEX file for calling the routine from Matlab has also been developed.


  • Vasima Sima (National Institute for Research & Development in Informatics, Bucharest, Romania)
  • Matthias Voigt (Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg)


License and Usage

This software is published under the GNU General Public License, version 3. It is research code and there is no warranty for correctness of numerical results. If you use this code for your own work, then please cite the publications stated below.

Related Software


Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.