Complete stability assessment of LTI systems with multiple constant-coefficient distributed delays using the improved frequency sweeping framework

Gao, Qingbin; Cai, Jiazhi; Zhang, Zhenyu; Long, Zhili

doi:10.1080/00207721.2022.2128602

Cited by 4 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple calculation can be performed to verify that the exact stability crossing frequency set is given by Ω = [√0.8, √2.2] = [0.8944,1.8432], which coincides with the result given in [48]. However, if one follows the theorem given in [18], [42], [43], a conservative stability crossing frequency set would be obtained as [0, 1.8432].…”

Section: }mentioning

confidence: 65%

“…It follows from the above two equations that the 𝑇 2 -polynomials 𝑅 However, for an element 𝑣 ̃2,𝑘 of the difference set 𝒱 2 \𝒱 2∞ there exists a finite common solution (𝜈 ̃2,𝑘 , 𝑇 ̃2) for ( 47) and (48). For this solution, we have from (42) and (43) that…”

Section: B Classification Of Critical Crossing Frequenciesmentioning

confidence: 99%

“…It is also noteworthy that the resultant-based methods presented in the literature for determining the stability crossing frequency set still suffer from two major inadequacies. First, the existing methods provide only the lower and upper bounds [28,[ 44], [46] (or just the upper bound [18], [42], [43]) rather than the exact ranges of the stability crossing frequency set. This limitation can lead to an incorrect set of crossing frequencies, as demonstrated in Example 2.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Use of Resultant-Based Frequency-Sweeping Approaches to Construct Stability Charts for Systems With Two Delays

Hwang,

Cai,

et al. 2024

IEEE Access

View full text Add to dashboard Cite

The resultant-based frequency-sweeping approach is appealing for creating a stability map to study stability robustness against delay uncertainties. It relies on converting the system's transcendental characteristic function into a polynomial form such that the crossing frequency set and the corresponding stability switching curves in the delay parameter plane can be exactly and exhaustively determined using only algebraic computations. In the existing literature, the equation conversion has been achieved by using Rekasius substitution, bilinear substitution, or half-angle tangent substitution, and variable eliminations are carried out by using Sylvester resultant or Dixon resultant. In this paper, we first point out that since the computation of Dixon resultant involves a polynomial division, it could be beneficial in a symbolic programming environment. Then, we provide numerical evidence to compare the computational complexity of using different equation conversion methods and the subsequent resultant elimination to obtain the critical crossing frequencies from which the exact crossing frequency set can be determined. Next, based on the resultant theory, we reveal the roles of the critical crossing frequencies that play in the characterization of the delay map. Finally, we provide an efficient procedure for constructing stability charts in the delay parameter plane for linear time-invariant systems with two delays in states. To demonstrate our contributions, explanatory examples are provided along with a complete illustrative example.

show abstract