A state-space method for computing upper bounds for the peak of the structured singular value over frequency for both real and complex uncertainties is presented. These bounds are based on the positivity and Popov criteria for one-sided, sector-bounded and for norm-bounded, block-structured linear u
A new upper bound for the skewed structured singular value
โ Scribed by Gilles Ferreres; Vincent Fromion
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 155 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1049-8923
No coin nor oath required. For personal study only.
โฆ Synopsis
The structured singular value (s.s.v) enables the study of robust stability and performance of a controller in the presence of real parametric uncertainties and complex uncertainties corresponding to neglected dynamics. In spite of the NP-hard characteristic of the problem, it is now possible to compute an interval for the s.s.v. using polynomial-time algorithms. The skewed s.s.v. was introduced by Fan and Tits in the context of robust performance analysis. The primary aim of this paper is to propose a new mixed upper bound, which is applicable to problems with a special, but practically important, structure. We then illustrate through a realistic missile example that certain problems naturally require the tool rather than the tool.
๐ SIMILAR VOLUMES
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general