DocumentCode :
2464717
Title :
A Gain-Based Lower Bound Algorithm for Real and Mixed μ Problems
Author :
Seiler, Pete ; Balas, Gary ; Packard, Andrew
fYear :
2006
fDate :
13-15 Dec. 2006
Firstpage :
3548
Lastpage :
3553
Abstract :
In this paper we present a new lower bound algorithm for real and mixed μ problems. The basic idea of this algorithm is to use a related worst-case gain problem to compute the real blocks and, if the block structure is mixed, the standard power iteration to compute the complex blocks. Initial numerical tests indicate that the algorithm is fast and provides good bounds for both real and mixed μ problems of small to moderate size
Keywords :
linear systems; perturbation techniques; polynomials; block structure; complex blocks; gain-based lower bound algorithm; mixed mu problems; real μ problems; worst-case gain problem; Algorithm design and analysis; Convergence; Linear systems; Power engineering and energy; Power engineering computing; Robustness; System testing; USA Councils; Uncertainty; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2006 45th IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
1-4244-0171-2
Type :
conf
DOI :
10.1109/CDC.2006.377123
Filename :
4177075
Link To Document :
بازگشت