Fast Parallel Frequency Sweeping Algorithms for Robust {cal D}-Stability Margin
classification
🧮 math.OC
math.DS
keywords
frequencymarginparallelrobuststabilitysweepingalgorithmscomplexity
read the original abstract
This 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.