An Algorithm for Computing the Distance to Instability

An algorithm is developed for computing the distance to instability of an n × n matrix. It is aimed primarily at sparse matrices and can be used for any value of n provided that an eigenvalue problem for a (2n) × (2n) Hamiltonian matrix can be solved on the computer being used. The algorithm gives both a lower bound and an upper bound for the distance in guaranteed accuracy. The method is faster than other currently available methods.

[1]  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 .

[2]  D. Hinrichsen,et al.  Stability radii of linear systems , 1986 .

[3]  G. A. Watson,et al.  An algorithm for computing the numerical radius , 1997 .

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

[5]  Gene H. Golub,et al.  Matrix computations , 1983 .

[6]  C. Loan How Near is a Stable Matrix to an Unstable Matrix , 1984 .

[7]  Miloud Sadkane,et al.  On the stability of large matrices , 1999 .

[8]  G. Hewer,et al.  The sensitivity of the algebraic and differential riccati equations , 1990 .

[9]  M. Steinbuch,et al.  A fast algorithm to computer the H ∞ -norm of a transfer function matrix , 1990 .

[10]  Edward J. Davison,et al.  A formula for computation of the real stability radius , 1995, Autom..

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

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

[13]  Thomas Kailath,et al.  Linear Systems , 1980 .

[14]  C. He On the distance to uncontrollability and the distance to instability and their relation to some condition numbers in control , 1997 .

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

[16]  G. Watson Computing the numerical radius , 1996 .

[17]  W. Kerner Large-scale complex eigenvalue problems , 1989 .