A Fast Algorithm to Compute the Real Structured Stability Radius

  • J. Sreedhar
  • Paul Van Dooren
  • André L. Tits
Conference paper
Part of the ISNM International Series of Numerical Mathematics book series (ISNM, volume 121)


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.


Fast Algorithm Open Unit Disk Imaginary Eigenvalue Stability Radius Transfer Function Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Hinrichsen and A. J. Pritchard, “Stability radius for structured perturbations and the algebraic Riccati equation,” Systems and Control Letters, vol. 8, pp. 105–113, 1985.MathSciNetCrossRefGoogle Scholar
  2. [2]
    L. Qiu, B. Bernhardsson, A. Rantzer, E. Davison, P. Young, and J. Doyle, “A formula for computation of the real stability radius,” Automatica, vol. 31, pp. 879–890, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    L. Qiu, A. L. Tits, and Y. Yang, “On the computation of the real Hurwitz-stability radius,” IEEE Transactions on Automatic Control, vol. 40, No. 8, pp. 1475–1476, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    C. T. Lawrence, A. L. Tits, and P. Van Dooren, “A fast algorithm for the computation of an upper bound on the μ-norm”, Proceedings of the 13th IFAC World Congress, San Francisco, California, 30 June–5 July 1996, Pergamon Press, 1996.Google Scholar
  5. [5]
    D. Hinrichsen, B. Kelb, and A. Linnemann, “An algorithm for the computation of the complex stability radius,” Automatica, vol. 25, pp. 771–775, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    S. Boyd, V. Balakrishnan, and P. Kabamba, “A bisection method for computing the Hoc norm of a transfer matrix and related problems,” Mathematics of Control, Signals, and Systems, vol. 2, pp. 207–219, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    N. A. Bruinsma and M. Steinbuch, “A fast algorithm to compute the H∞ norm of a transfer function matrix,” Systems and Control Letters, vol. 14, pp. 287–293, 1990.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    R. Byers, “A bisection method for measuring the distance of a stable matrix to the unstable matrices,” SIAM J. Sci. Stat. Comput., vol. 9, pp. 875–881, Sept 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    T. Kato, Perturbation Theory of Linear Operators. New York, NY: Springer-Verlag, 1966.Google Scholar
  10. [10]
    D. Hinrichsen and N. K. Son, “The complex stability radius of discrete-time systems and symplectic pencils,” in Proc. IEEE 28th Conference on Decision and Control, (Tampa, FL), pp. 2265–2270, 1989.Google Scholar

Copyright information

© Birkhäuser Verlag Basel 1996

Authors and Affiliations

  • J. Sreedhar
    • 1
  • Paul Van Dooren
    • 2
  • André L. Tits
    • 3
  1. 1.Department of Electrical & Computer Engineering and the Coordinated Science LaboratoryUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  2. 2.Université Catholique de LouvainLouvain-la-NeuveBelgium
  3. 3.Department of Electrical Engineering and Institute for Systems ResearchUniversity of Maryland at College ParkCollege ParkUSA

Personalised recommendations