Calculation of the structured singular value with a reduced number of optimization variables

For the case of an n*n uncertainty matrix with n/sup 2/ nonzero 1*1 blocks, the structured singular value technique with similarity scaling suffers from the disadvantage of having to expand an n*n matrix problem to an n/sup 2/*n/sup 2/ matrix optimization problem with n/sup 2/-1 free variables. It i...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 37; no. 10; pp. 1612 - 1616
Main Authors Latchman, H.A., Norris, R.J.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.10.1992
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:For the case of an n*n uncertainty matrix with n/sup 2/ nonzero 1*1 blocks, the structured singular value technique with similarity scaling suffers from the disadvantage of having to expand an n*n matrix problem to an n/sup 2/*n/sup 2/ matrix optimization problem with n/sup 2/-1 free variables. It is shown that for elementwise, magnitude-bounded uncertainties, the structure of the problem may be exploited to yield a similarity scaling method which uses no more than 2(n-1) rather than n/sup 2/-1 independent optimization parameters. A simple extension of this result shows that a reduction in the number of independent optimization variables is also possible for more general block-structured uncertainties. A more efficient implementation of the vector optimization method developed by M.K.H. Fan and A.L. Tits (1986) is also proposed. Several examples are included to illustrate the results.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/9.256396