论文信息 - A fast algorithm to compute the real structured stability radius

A fast algorithm to compute the real structured stability radius

We describe a fast algorithm to compute the real structured stability radius with respect to the open left-half plane or the open unit disk. It is based on a recent formula proved by Qiu et al. (Automatica, vol. 31, pp. 879-890, 1995) and the well-known correspondence between the singular values of a transfer function matrix and the imaginary eigenvalues of a related Hamiltonian matrix. Numerical tests suggest that its local convergence is quadratic.

[1] Stephen P. Boyd,et al. A bisection method for computing the H∞ norm of a transfer matrix and related problems , 1989, Math. Control. Signals Syst..

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

[3] D. Hinrichsen,et al. The complex stability radius of discrete-time systems and symplectic pencils , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[4] Paul Van Dooren,et al. A Fast Algorithm for the Computation of an Upper Bound on the μ-Norm , 1996 .

[5] D. Hinrichsen,et al. Stability radius for structured perturbations and the algebraic Riccati equation , 1986 .

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

[7] Diederich Hinrichsen,et al. An algorithm for the computation of the structured complex stability radius , 1989, Autom..

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

[9] Li Qiu,et al. On the computation of the real Hurwitz-stability radius , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

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