Scaled relative graphs for pairs of operators beyond classical monotonicity
Jan Quan, Alexander Bodard, Konstantinos Oikonomidis, Panagiotis Patrinos
TL;DR
This work generalizes the scaled relative graph (SRG) to pairs of operators, yielding a geometric tool to visualize and reason about paired monotonicity and incremental properties in nonlinear resolvents. By defining the SRG for operator pairs and establishing calculus rules and SRG-fullness, the authors connect paired monotonicity to convergence properties of warped and transformed resolvents, showing tight SRG-based bounds that imply firm nonexpansiveness or contraction. The framework is then applied to circuit theory, demonstrating that linear mappings composed with monotone mappings (including NPN transistor models) fit the framework and yield convergent, preconditioned iterations for solving circuit inclusions, even in highly nonmonotone settings. Overall, the paper provides a practical, visual approach to stability and convergence analysis for nonlinear, nonsmooth operator systems and offers a path to analyze or design stable feedback circuits using paired monotonicity concepts.
Abstract
We introduce a generalization of the scaled relative graph (SRG) to pairs of operators, enabling the visualization of their relative incremental properties. This novel SRG framework provides the geometric counterpart for the study of nonlinear resolvents based on paired monotonicity conditions. We demonstrate that these conditions apply to linear operators composed with monotone mappings, a class that notably includes NPN transistors, allowing us to compute the response of multivalued, nonsmooth and highly nonmonotone electrical circuits.
