DLR-Logo -> http://www.dlr.de
DLR Portal Home | Imprint | Contact | Deutsch
Fontsize: [-] Text [+]

Robust pole assignment for descriptor systems

Varga, Andras (2000) Robust pole assignment for descriptor systems. In: CD-ROM. Proc. Mathematical Theory of Networks and Systems MTNS 2000, 2000-06-19 - 2000-06-23, Perpignan (France).

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


By using a generalized Sylvester equation based parametrization, three minimum norm robust pole assignment problems for descriptor systems are formulated as unconstrained minimization problems for suitably chosen cost functions. The derived explicit expressions of the gradients of the cost functions allow the efficient solution of the minimization problems by using powerful gradient search based minimization techniques. We also discuss how requirements for a particular Jordan structure of the closed-loop state matrix or for partial pole assignment can be accomodated with proposed approach.

Document Type:Conference or Workshop Item (Paper)
Additional Information:LIDO-Berichtsjahr=2000,
Title:Robust pole assignment for descriptor systems
AuthorsInstitution or Email of Authors
Date:June 2000
Journal or Publication Title:CD-ROM
Keywords:descriptor systems, pole assignment, numerical methods
Event Title:Proc. Mathematical Theory of Networks and Systems MTNS 2000
Event Location:Perpignan (France)
Event Type:international Conference
Event Dates:2000-06-19 - 2000-06-23
HGF - Research field:Aeronautics, Space and Transport
HGF - Program:other
HGF - Program Themes:other
DLR - Research area:Aeronautics
DLR - Program:L - no assignement
DLR - Research theme (Project):L -- no assignement
Location: Oberpfaffenhofen
Institutes and Institutions:Institute of Robotics and Mechatronics
Deposited By: elib DLR-Beauftragter
Deposited On:15 Mar 2006
Last Modified:12 Dec 2013 20:01

Repository Staff Only: item control page

Help & Contact
electronic library is running on EPrints 3.3.12
Copyright © 2008-2012 German Aerospace Center (DLR). All rights reserved.