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

TL;DR

This paper introduces fast parallel frequency sweeping algorithms to efficiently compute the robust ${ m D}$-stability margin in systems with structured real parametric uncertainty, improving computational speed and guaranteeing convergence.

Contribution

It develops novel parallel frequency sweeping techniques and domain splitting schemes that significantly reduce computational complexity for robust ${ m D}$-stability margin analysis.

Findings

Reduced computational complexity compared to previous methods

Guaranteed convergence of the proposed algorithms

Effective handling of structured real parametric uncertainty

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.