Published December 1992
| Published
Book Section - Chapter
Open
Mixed µ upper bound computation
- Creators
- Beck, Carolyn
-
Doyle, John
Abstract
Computation of the mixed real and complex µ upper bound expressed in terms of linear matrix inequalities (LMIs) is considered. Two existing methods are used, the Osborne (1960) method for balancing matrices, and the method of centers as proposed by Boyd and El Ghaoui (1991). These methods are compared, and a hybrid algorithm that combines the best features of each is proposed. Numerical experiments suggest that this hybrid algorithm provides an efficient method to compute the upper bound for mixed µ.
Additional Information
© 1991 IEEE. We would like to thank Micheal Fan and Stephen Boyd for preprints of their papers and/or copies of software, as well as valuable discussions about the material in this paper. We would also like to thank Peter Young and Matt Newlin for lending their Matlab and µ expertise to this project. This work was supported by AFOSR, NSF, and Rockwell.Attached Files
Published - 00371241.pdf
Files
00371241.pdf
Files
(688.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:fc299eb73bb2651e621004af778536ad
|
688.3 kB | Preview Download |
Additional details
- Eprint ID
- 93955
- Resolver ID
- CaltechAUTHORS:20190319-085951997
- Air Force Office of Scientific Research (AFOSR)
- NSF
- Rockwell International
- Created
-
2019-03-19Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field