Refined Schur Method for Robust Pole Assignment with Repeated Poles

DOI10.1109/TAC.2015.2491558MaRDI QIDQ2980385zbMATH OpenOpenAlexFDO

Authors Zhen-Chen Guo, Jiang Qian, Yun-Feng Cai, Shu-Fang Xu

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.08588

Mathematics Subject Classification ID

Pole and zero placement problems (93B55)

Abstract: Schur-type methods in cite{Chu2} and cite{GCQX} solve the robust pole assignment problem by employing the departure from normality of the closed-loop system matrix as the measure of robustness. They work well generally when all poles to be assigned are simple. However, when some poles are close or even repeated, the eigenvalues of the computed closed-loop system matrix might be inaccurate. In this paper, we present a refined Schur method, which is able to deal with the case when some or all of the poles to be assigned are repeated. More importantly, the refined Schur method can still be applied when verb|place| cite{KNV} and verb|robpole| cite{Tits} fail to output a solution when the multiplicity of some repeated poles is greater than the input freedom.

Cited in

(1)

• Schur method for robust partial quadratic eigenvalue assignment problem

This page was built for publication: Refined Schur Method for Robust Pole Assignment with Repeated Poles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980385)