The iterative scheme, called y-iteration, in the standard two-block H ~ design is generalized to allow the development of a super-optimal algorithm in which not only the maximum singular value but all singular values are minimized in a lexicographic order.
✦ LIBER ✦
Improved formulae for the 2-block H∞ super-optimal solution
✍ Scribed by D.-W. Gu; M.C. Tsai; I. Postlethwaite
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 268 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
✦ Synopsis
Improved formulae are presented for the algorithm given in Gu et al. (Automatica 25, 215-221 (1989) for finding 2-block H ~* super-optimal solutions.
📜 SIMILAR VOLUMES
An algorithm for super-optimal H∞ design
✍
D.-W. Gu; M.C. Tsai; I. Postlethwaite
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 535 KB
Characterization of the sub-layers for 2
✍
Jieh-Shian Young; Chin E. Lin; Fang-Bo Yeh
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 299 KB
An explicit formula and an optimal weigh
✍
Carl N. Nett; James A. Uthgenannt
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 529 KB
Abstract~An explicit formula for the 2-block structured singular value interaction measure is derived. This formula is utilized to establish the existence of optimal weights for this measure, and an explicit formula for an optimal weight is given. A general, sequential algorithm for the design of st