DocumentCode :
1176793
Title :
Fast parallel-frequency-sweeping algorithms for robust D-stability margin
Author :
Chen, Xinjia ; Zhou, Kemin
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
Volume :
50
Issue :
3
fYear :
2003
fDate :
3/1/2003 12:00:00 AM
Firstpage :
418
Lastpage :
428
Abstract :
This paper considers the robust D-stability margin problem under polynomic structured real parametric uncertainty. Based on the work of de Gaston and Safonov (1988), we have developed techniques such as, a parallel-frequency-sweeping strategy, different domain-splitting schemes, which significantly reduce the computational complexity and guarantee the convergence.
Keywords :
computational complexity; parameter estimation; robust control; stability; computational complexity; domain-splitting schemes; parallel-frequency-sweeping algorithms; polynomic structured real parametric uncertainty; robust D-stability margin; robust control; Computational complexity; Control systems; Convergence; Frequency; Polynomials; Robust control; Robust stability; Robustness; US Department of Defense; Uncertainty;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7122
Type :
jour
DOI :
10.1109/TCSI.2003.808843
Filename :
1193022
Link To Document :
بازگشت