## Abstract Exploitation of the NP hard, mixed µ problem structure provides a polynomial time algorithm that approximates µ with usually reasonable answers. When the problem is extended to the skew µ problem an extension of the existing method to the skew µ formulation is required. The focus of thi
Development of a skew μ upper bound
✍ Scribed by Rod Holland; Peter Young; Chuanjiang Zhu
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 182 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1049-8923
- DOI
- 10.1002/rnc.1028
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 com
A fast algorithm for the computation of the optimally frequency-dependent scaled H -norm of a "nite-dimensional LTI system is presented. It is well known that this quantity is an upper bound to the ` -norma; furthermore, it was recently shown to play a special role in the context of slowly time-vary
## Abstract Environmental contamination data frequently follow an extremely right skewed distribution, which is often approximated by a log‐normal distribution. For the purpose of risk assessment it is of interest to use the sample data to calculate an upper bound on the population arithmetic mean.