Detecting Nearly Uncontrollable Pairs

Given a controllable pair of matrices (A; B), the distance to the set of uncontrollable pairs is obtained as the minimum singular value of the set of augmented matrices A ? I; B] as varies over the complex plane. This study develops one dimensional and two dimensional algorithms to calculate or estimate the distance. The algorithms give guaranteed upper and lower bounds.

[1]  Daniel Boley,et al.  Measuring how far a controllable system is from an uncontrollable one , 1986, IEEE Transactions on Automatic Control.

[2]  I. Preliminaries.  The Generalized Eigenstructure Problem in Linear System Theory , 1981 .

[3]  Nicholas J. Highham.  A survey of condition number estimation for triangular matrices , 1987 .

[4]  W. Wonham.  Linear Multivariable Control: A Geometric Approach , 1974 .

[5]  P. Van Dooren,et al.  A class of fast staircase algorithms for generalized state-space systems , 1986, 1986 American Control Conference.

[6]  James Demmel,et al.  Accurate solutions of ill-posed problems in control theory , 1988 .

[7]  James Demmel,et al.  Accurate solutions of ill-posed problems in control theory , 1986, 1986 25th IEEE Conference on Decision and Control.

[8]  Wilson J. Rugh,et al.  Mathematical Description of Linear Systems , 1976 .

[9]  S. Boyd,et al.  A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L ∞ -norm , 1990 .

[10]  Tosio Kato.  Perturbation theory for linear operators , 1966 .

[11]  Daniel Boley.  A Perturbation Result for Linear Control Problems , 1985 .

[12]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[13]  M.L.J. Hautus,et al.  Controllability and observability conditions of linear autonomous systems , 1969 .

[14]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[15]  Tosio Kato.  A Short Introduction to Perturbation Theory for Linear Operators , 1982 .

[16]  F Rikus Eising,et al.  The distance between a system and the set of uncontrollable systems , 1984 .

[17]  J. H. Wilkinson,et al.  AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .

[18]  B. Moore,et al.  Singular value analysis of linear systems , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[19]  P. Dooren,et al.  An improved algorithm for the computation of Kronecker's canonical form of a singular pencil , 1988 .

[20]  R. Byers.  A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices , 1988 .

[21]  Alan J. Laub,et al.  Controllability and stability radii for companion form systems , 1988, Math. Control. Signals Syst..

[22]  L. Silverman,et al.  Stable extraction of Kronecker structure of pencils , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[23]  D. O’Leary.  Estimating Matrix Condition Numbers , 1980 .

[24]  A. Laub,et al.  Numerical linear algebra aspects of control design computations , 1985, IEEE Transactions on Automatic Control.

[25]  J. Demmel.  On condition numbers and the distance to the nearest ill-posed problem , 2015 .

[26]  D. Hinrichsen,et al.  Optimization problems in the robustness analysis of linear state space systems , 1989 .