Registered users receive a variety of benefits including the ability to customize email alerts, create favorite journals list, and save searches.
Please note that a Project Euclid web account does not automatically grant access to full-text content. An institutional or society member subscription is required to view non-Open Access content.
Contact email@example.com with any questions.
Circulant and block circulant type matrices are important tools in solving networked systems. In this paper, based on the style spectral decomposition of the basic circulant matrix and the basic skew circulant matrix, the block style spectral decomposition of the BCSCB matrix is obtained. And then, the structure perturbation is analysed, which includes the condition number and relative error of the BCSCB linear system. Then the optimal backward perturbation bound of the BCSCB linear system is discussed. Simultaneously, the algorithm for the optimal backward perturbation bound is given. Finally, a numerical example is provided to verify the effectiveness of the algorithm.
Circulant, block circulant-type matrices and operator norms have become effective tools in solving networked systems. In this paper, the block imaginary circulant operator matrices are discussed. By utilizing the special structure of such matrices, several norm equalities and inequalities are presented. The norm in consideration is the weakly unitarily invariant norm, which satisfies . The usual operator norm and Schatten -norm are included. Furthermore, some special cases and examples are given.
The fuzzy logic theory has been proven to be effective in dealing with various nonlinear systems and has a great success in industry applications. Among different kinds of models for fuzzy systems, the so-called Takagi-Sugeno (T-S) fuzzy model has been quite popular due to its convenient and simple dynamic structure as well as its capability of approximating any smooth nonlinear function to any specified accuracy within any compact set. In terms of such a model, the performance analysis and the design of controllers and filters play important roles in the research of fuzzy systems. In this paper, we aim to survey some recent advances on the T-S fuzzy control and filtering problems with various network-induced phenomena. The network-induced phenomena under consideration mainly include communication delays, packet dropouts, signal quantization, and randomly occurring uncertainties (ROUs). With such network-induced phenomena, the developments on T-S fuzzy control and filtering issues are reviewed in detail. In addition, some latest results on this topic are highlighted. In the end, conclusions are drawn and some possible future research directions are pointed out.
The well known circulant matrices are applied to solve networked systems. In this paper, circulant and left circulant matrices with the Fermat and Mersenne numbers are considered. The nonsingularity of these special matrices is discussed. Meanwhile, the exact determinants and inverse matrices of these special matrices are presented.
The backbone is the natural abstraction of a complex network, which can help people understand a networked system in a more simplified form. Traditional backbone extraction methods tend to include many outliers into the backbone. What is more, they often suffer from the computational inefficiency—the exhaustive search of all nodes or edges is often prohibitively expensive. In this paper, we propose a backbone extraction heuristic with incomplete information (BEHwII) to find the backbone in a complex weighted network. First, a strict filtering rule is carefully designed to determine edges to be preserved or discarded. Second, we present a local search model to examine part of edges in an iterative way, which only relies on the local/incomplete knowledge rather than the global view of the network. Experimental results on four real-life networks demonstrate the advantage of BEHwII over the classic disparity filter method by either effectiveness or efficiency validity.
It is a hot topic that circulant type matrices are applied to networks engineering. The determinants and inverses of Tribonacci circulant type matrices are discussed in the paper. Firstly, Tribonacci circulant type matrices are defined. In addition, we show the invertibility of Tribonacci circulant matrix and present the determinant and the inverse matrix based on constructing the transformation matrices. By utilizing the relation between left circulant, -circulant matrices and circulant matrix, the invertibility of Tribonacci left circulant and Tribonacci -circulant matrices is also discussed. Finally, the determinants and inverse matrices of these matrices are given, respectively.
Circulant type matrices have played an important role in networks engineering. In this paper, firstly, some bounds for the norms and spread of Fibonacci row skew first-minus-last right (RSFMLR) circulant matrices and Lucas row skew first-minus-last right (RSFMLR) circulant matrices are given. Furthermore, the spectral norm of Hadamard product of a Fibonacci RSFMLR circulant matrix and a Lucas RSFMLR circulant matrix is obtained. Finally, the Frobenius norm of Kronecker product of a Fibonacci RSFMLR circulant matrix and a Lucas RSFMLR circulant matrix is presented.