Title of article
Using permuted graph bases in control
Author/Authors
Mehrmann، نويسنده , , Volker and Poloni، نويسنده , , Federico، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
8
From page
1790
To page
1797
Abstract
We present a new numerical method (based on the computation of deflating subspaces) for the γ -iteration in H ∞ control in the extended matrix pencil formulation. We introduce a permuted graph representation of these subspaces, which avoids the known difficulties that arise when the iteration is based on the solution of algebraic Riccati equations but at the same time makes use of the special symmetry structures that are present in the problems. We use this representation to perform both the deflation of spurious ∞ eigenvalues of the even pencils and the implementation of the inverse-free sign iteration. We show that the new method returns accurate results and is applicable in many situations where conventional methods fail.
Keywords
Algebraic Riccati equations , Robust control , Inverse-free algorithms , Matrix sign iteration , Numerical algorithms
Journal title
Automatica
Serial Year
2013
Journal title
Automatica
Record number
1449212
Link To Document