Fast parallel-frequency-sweeping algorithms for robust D-stability margin

DOI10.1109/TCSI.2003.808843MaRDI QIDQ5349640zbMATH OpenOpenAlexFDO

Authors Kemin Zhou, Xin-Jia Chen

Publication date 25 August 2017

Published in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.1664

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Robust stability (93D09)

Abstract: This paper considers the robust $calD$-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.

Recommendations

• A new fast algorithm for robust stability analysis of control systems with linearly dependent parametric uncertainties
• scientific article; zbMATH DE number 1059359
• Parallel partial stabilizing algorithms for large linear control systems
• scientific article; zbMATH DE number 2123748
• Robust Stabilization of Linear Control Systems Using a Frequency Domain Approach
• Robust stabilization for multivariable systems with constrained control: Frequency domain approach
• Solving Large-Scale Robust Stability Problems by Exploiting the Parallel Structure of Polya's Theorem
• Robust stability analysis for nonlinear sampled-data control systems in a frequency domain
• Algorithm of fast linear nonstationary stabilization and the Brockett problem
• Fast computation of the multivariable stability margin for real interrelated uncertain parameters

Cited in

(1)

• Design of controller for Lur'e systems guaranteeing dichotomy

This page was built for publication: Fast parallel-frequency-sweeping algorithms for robust D-stability margin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5349640)