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

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

2008-05-12

arxiv.org/abs/0805.1664v1

published in IEEE Transactions on Circuits and Systems, vol. 50, pp. 418-428, March 2003

Mathematics

Optimization and Control

27 pages, 14 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast Parallel Frequency Sweeping Algorithms for Robust ${\cal D}$-Stability Margin does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Parallel Frequency Sweeping Algorithms for Robust ${\cal D}$-Stability Margin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Parallel Frequency Sweeping Algorithms for Robust ${\cal D}$-Stability Margin will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-325739