On phase in scaled graphs
The scaled graph has been introduced recently as a nonlinear extension of the classical Nyquist plot for linear time-invariant systems. In this paper, we introduce a modified definition for the scaled graph, termed the signed scaled graph (SSG), in which the phase component is characterized by making use of the Hilbert transform. Whereas the original definition of the scaled graph uses unsigned phase angles, the new definition has signed phase angles which ensures the possibility to differentiate between phase-lead and phase-lag properties in a system. Making such distinction is important from both an analysis and a synthesis perspective, and helps in providing tighter stability estimates of feedback interconnections. We show how the proposed SSG leads to intuitive characterizations of positive real and negative imaginary nonlinear systems, and present various interconnection results. We showcase the effectiveness of our results through several motivating examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Graphical Dominance Analysis for Linear Systems: A Frequency-Domain Approach
We propose a frequency-domain approach to dominance analysis for multi-input multi-output (MIMO) linear time-invariant systems. The dominance of a MIMO system is defined to be the number of its poles in the open right ha…
Sampling Enclosing Subgraphs for Link Prediction
Link prediction is a fundamental problem for graph-structured data (e.g., social networks, drug side-effect networks, etc.). Graph neural networks have offered robust solutions for this problem, specifically by learning …
Link PredictionPredictionRepresentation LearningTime-Varying and Nonlinearly Scaled Consensus of Multiagent Systems: A Generic Attracting Law Approach
This paper presents the design and analysis of the finite/fixed-time scaled consensus for multiagent systems. A study on a generic attracting law, the certain classes of nonlinear systems that admit attractors with finit…
Scaled relative graphs for system analysis
Scaled relative graphs were recently introduced to analyze the convergence of optimization algorithms using two dimensional Euclidean geometry. In this paper, we connect scaled relative graphs to the classical theory of …
Exploiting Structure in MIMO Scaled Graph Analysis
Scaled graphs offer a graphical tool for analysis of nonlinear feedback systems. Although recently substantial progress has been made in scaled graph analysis, at present their use in multivariable feedback systems is li…