重复复数全块不确定性的结构奇异值
Structured Singular Value of a Repeated Complex Full-Block Uncertainty
AI总结:
本文提出计算重复复数全块不确定性SSV上下界的算法,通过幂迭代法求下界、半定规划求上界,并在流体流动模型上验证了其保守性更小。
摘要:
结构奇异值(SSV),或称mu,用于评估不确定线性时不变系统的鲁棒稳定性和性能。现有算法可计算包含重复(实数或复数)标量和/或非重复复数全块的结构不确定性的SSV上下界。本文提出了计算重复复数全块情况下SSV上下界的算法。这类特定的不确定性与许多对流系统(如流体流动)的输入输出分析相关。具体而言,我们提出了一种幂迭代法来计算重复复数全块情况下SSV的下界。这推广了现有的针对重复复数标量和非重复复数全块的幂迭代法。上界可表述为半定规划(SDP),我们使用标准内点法求解以计算与重复全块相关的最优缩放矩阵。我们的方法实现仅需梯度信息,从而提高了计算效率。最后,我们在不可压缩流体流动的示例模型上测试了所提算法。与忽略重复全块结构的先前结果相比,所提方法提供了保守性更小的边界。
英文摘要:
The structured singular value (SSV), or mu, is used to assess the robust stability and performance of an uncertain linear time-invariant system. Existing algorithms compute upper and lower bounds on the SSV for structured uncertainties that contain repeated (real or complex) scalars and/or non-repeated complex full blocks. This paper presents algorithms to compute bounds on the SSV for the case of repeated complex full blocks. This specific class of uncertainty is relevant for the input output analysis of many convective systems, such as fluid flows. Specifically, we present a power iteration to compute a lower bound on SSV for the case of repeated complex full blocks. This generalizes existing power iterations for repeated complex scalar and non-repeated complex full blocks. The upper bound can be formulated as a semi-definite program (SDP), which we solve using a standard interior-point method to compute optimal scaling matrices associated with the repeated full blocks. Our implementation of the method only requires gradient information, which improves the computational efficiency of the method. Finally, we test our proposed algorithms on an example model of incompressible fluid flow. The proposed methods provide less conservative bounds as compared to prior results, which ignore the repeated full block structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。