Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 1990 | Published
Book Section - Chapter Open

Computation of µ with real and complex uncertainties

Abstract

The robustness analysis of system performance is one of the key issues in control theory, and one approach is to reduce this problem to that of computing the structured singular value, mu . When real parametric uncertainty is included, then mu must be computed with respect to a block structure containing both real and complex uncertainties. It is shown that mu is equivalent to a real eigenvalue maximization problem, and a power algorithm is developed to solve this problem. The algorithm has the property that mu is (almost) always an equilibrium point of the algorithm, and that whenever the algorithm converges a lower bound for mu results. This scheme has been found to have fairly good convergence properties. Each iteration of the scheme is very cheap, requiring only such operations as matrix-vector multiplications and vector inner products, and the method is sufficiently general to handle arbitrary numbers of repeated real scalars, repeated complex scalars, and full complex blocks.

Additional Information

© 1990 IEEE. We would like to thank Andy Packard for helpful discussions, Michael Fan for the use of some preliminary upper bound software, and NSF, ONR, NASA, and Rockwell for financial support.

Attached Files

Published - 00203804.pdf

Files

00203804.pdf
Files (660.5 kB)
Name Size Download all
md5:0f5636fa12f939675eaeaec59d679332
660.5 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023