Julius P. J. Krebbekx

2papers

2 Papers

35.7SYApr 17
Analysis of Non-Square Nonlinear MIMO Systems using Scaled Relative Graphs

Julius P. J. Krebbekx, Roland Tóth, Amritam Das

Scaled Relative Graphs (SRGs) provide a novel graphical frequency-domain method for the analysis of nonlinear systems. There have been recent efforts to generalize SRG analysis to Multiple-Input Multiple-Output (MIMO) systems. However, these attempts yielded only results for square systems, due to the inherent Hilbert space structure of the SRG. In this paper, we develop an SRG analysis method that accommodates non-square operators. The key element is the embedding of operators to a space of operators acting on a common Hilbert space, while restricting the input space to the original input dimension, to avoid conservatism. We generalize SRG interconnection rules to restricted input spaces and develop stability theorems to guarantee causality, well-posedness and (incremental) $L_2$-gain bounds for the overall interconnection. We show utilization of the proposed theoretical concepts on the analysis of nonlinear systems in a Linear Fractional Representation (LFR) form, which is a rather general class of systems, and the LFR is directly utilizable for control. Moreover, we provide formulas for the computation of MIMO SRGs of stable LTI operators and diagonal and non-square static nonlinear operators. Finally, we demonstrate the advantages of our embedding approach on several examples.

46.6OCApr 7
Scaled Graph Containment for Feedback Stability: Soft-Hard Equivalence and Conic Regions

Eder Baron-Prada, Julius P. J. Krebbekx, Adolfo Anta et al.

Scaled graphs (SGs) offer a geometric framework for feedback stability analysis. This paper develops containment conditions for SGs within multiplier-defined regions, addressing both circular and conic geometries. For circular regions, we show that soft and hard SG containment are equivalent whenever the associated multiplier is positive-negative. This enables hard stability certification from soft computations alone, bypassing both the positive semidefinite storage constraint and the homotopy condition of existing methods. Numerical experiments on systems with up to 300 states demonstrate computational savings of 15-44 % for the circular containment framework. We further characterize which conic regions are hyperbolically convex, a condition our frequency-domain certificate requires, and demonstrate that such regions provide tighter SG bounds than circles whenever the operator SG is nonsymmetric.