Fast Parallel Frequency Sweeping Algorithms for Robust ${\cal D}$-Stability Margin

Simple item page
dc.creatorChen, Xinjia
dc.creatorZhou, Kemin
dc.date2008-05-12
dc.date.accessioned2026-07-07T09:38:23Z
dc.date.available2026-07-07T09:38:23Z
dc.descriptionThis paper considers the robust ${\cal 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.
dc.description27 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/0805.1664
dc.identifierhttp://arxiv.org/abs/0805.1664
dc.identifierpublished in IEEE Transactions on Circuits and Systems, vol. 50, pp. 418-428, March 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160789
dc.subjectOptimization and Control
dc.subjectDynamical Systems
dc.titleFast Parallel Frequency Sweeping Algorithms for Robust ${\cal D}$-Stability Margin
dc.typetext

Files

Collections

arXiv