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 January 1996 | Published
Journal Article Open

Properties of the mixed μ problem and its bounds

Abstract

Upper and lower bounds for the mixed μ problem have recently been developed, and here we examine the relationship of these bounds to each other and to μ. A number of interesting properties are developed and the implications of these properties for the robustness analysis of linear systems and the development of practical computation schemes are discussed. In particular we find that current techniques can only guarantee easy computation for large problems when μ equals its upper bound, and computational complexity results prohibit this possibility for general problems. In this context we present some special cases where computation is easy and make some direct comparisons between mixed μ and "Kharitonov-type" analysis methods.

Additional Information

© 1996 IEEE. Reprinted with permission. Manuscript received January 14, 1994; revised January 10, 1995.

Attached Files

Published - YOUieeetac96.pdf

Files

YOUieeetac96.pdf
Files (676.4 kB)
Name Size Download all
md5:47ae29318ee1626185c05a97d1dd7f7c
676.4 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023