{'fraction_non_alphanumeric': 0.01445578231292517, 'fraction_numerical': 0.0, 'mean_word_length': 5.538888888888889, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Lyapunov-based semistability analysis for discrete-time switched network systems

In this paper, we address semistability analysis of a class of distributed iterative algorithms for discrete-time switched network systems. Semistability is the property whereby every solution that starts in a neighborhood of a Lyapunov stable equilibrium converges to a (possibly different) Lyapunov stable equilibrium. To this end, we use a Lyapunov-based approach to develop a series of sufficient conditions for semistability of discrete-time switched systems. This technique gives us a new perspective to design distributed numerical iterative algorithms for network systems from a dynamical systems viewpoint. Despite the fact that distributed iterative algorithms in general are not dynamical systems, the methods we used for proving convergence of dynamical systems are somehow valid for a large class of distributed iterative algorithms in network systems. The motivation of this paper exactly follows from this general observation. Part of the effort by this paper can be viewed as an attempt to analyze distributed numerical algorithms for network systems from a control perspective.