971choose the initial condition of the original system to ensure the boundedness of the trajectory x(t). Taking the initial condition and observer gain as x(0) = (00:4; 1; 00:7; 00:5) T ,x(0) = 0, L = (l 1 ; l 2 ) with l1 = (4; 4; 0; 0) T , l2 = (0; 0; 4; 4) T , we have the simulation result in Fig. 1. Simulation demonstrates local error dynamics stability and the ease of implementation of the observer using multiple time scales. Control, vol. 2, no. 3, pp. 176-192, 1996.
Time Complexity of Decentralized Fixed-Mode Verification
Javad Lavaei and Somayeh SojoudiAbstract-Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM). It is shown that checking the decentralized fixedness of any distinct mode is tantamount to testing the strong connectivity of a digraph formed based on the system. It is subsequently proved that the time complexity of this decision problem using the proposed approach is the same as the complexity of matrix multiplication. This work concludes that the identification of distinct DFMs (by means of a deterministic algorithm, rather than a randomized one) is computationally very easy, although the existing algorithms for solving this problem would wrongly imply that it is cumbersome. This note provides not only a complexity analysis, but also an efficient algorithm for tackling the underlying problem.