In this article, the non-negative edge consensus problem is addressed for positive networked systems with undirected graphs using state-feedback protocols. In contrast to existing results, the major contributions of this work included: 1) significantly improved criteria of consequentiality and non-negativity, therefore leading to a linear programming approach and 2) necessary and sufficient criteria giving rise to a semidefinite programming approach. Specifically, an improved upper bound is given for the maximum eigenvalue of the Laplacian matrix and the (out-) in-degree of the degree matrix, and an improved consensuability and non-negativevity condition is obtained. The sufficient condition presented only requires the number of edges of a nodal network without the connection topology. Also, with the introduction of slack matrix variables, two equivalent conditions of consensuability and non-negativevity are obtained. In the conditions, the system matrices, controller gain, as well as Lyapunov matrices are separated, which is helpful for parameterization. Based on the results, a semidefinite programming algorithm for the controller is readily developed. Finally, a comprehensive analytical and numerical comparison of three illustrative examples is conducted to show that the proposed results are less conservative than the existing work.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1109/TCYB.2021.3052833 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Parameter Estimation Procedures for Exponential-family Random Graph Models on Count-valued Networks: A Comparative Simulation Study.
Soc Networks
January 2024
Departments of Sociology, Statistics, Computer Science, and EECS, University of California, Irvine, CA, United States.
The exponential-family random graph models (ERGMs) have emerged as an important framework for modeling social networks for a wide variety of relational types. ERGMs for valued networks are less well-developed than their unvalued counterparts, and pose particular computational challenges. Network data with edge values on the non-negative integers (count-valued networks) is an important such case, with examples ranging from the magnitude of migration and trade flows between places to the frequency of interactions and encounters between individuals.
View Article and Find Full Text PDFMagnetic particle imaging (MPI) uses nonlinear response signals to noninvasively detect magnetic nanoparticles in space, and its quantitative properties hold promise for future precise quantitative treatments. In reconstruction, the system matrix based method necessitates suitable regularization terms, such as Tikhonov or non-negative fused lasso (NFL) regularization, to stabilize the solution. While NFL regularization offers clearer edge information than Tikhonov regularization, it carries a biased estimate of the l penalty, leading to an underestimation of the reconstructed concentration and adversely affecting the quantitative properties.
View Article and Find Full Text PDFPersonalized functional network mapping for autism spectrum disorder and attention-deficit/hyperactivity disorder.
Transl Psychiatry
February 2024
State Key Laboratory of Primate Biomedical Research, Institute of Primate Translational Medicine, Kunming University of Science and Technology, Kunming, China.
Autism spectrum disorder (ASD) and Attention-deficit/hyperactivity disorder (ADHD) are two typical neurodevelopmental disorders that have a long-term impact on physical and mental health. ASD is usually comorbid with ADHD and thus shares highly overlapping clinical symptoms. Delineating the shared and distinct neurophysiological profiles is important to uncover the neurobiological mechanisms to guide better therapy.
View Article and Find Full Text PDFMatrix Factorization-Based Dimensionality Reduction Algorithms─A Comparative Study on Spectroscopic Profiling Data.
Anal Chem
October 2022
School of Management and E-Business, Zhejiang Gongshang University, Hangzhou 310018, China.
Spectroscopic profiling data used in analytical chemistry can be very high-dimensional. Dimensionality reduction (DR) is an effective way to handle the potential "curse of dimensionality" problem. Among the existing DR algorithms, many can be categorized as a matrix factorization (MF) problem, which decomposes the original data matrix X into the product of a low-dimensional matrix W and a dictionary matrix H.
View Article and Find Full Text PDFChemical and elemental mapping of spent nuclear fuel sections by soft X-ray spectromicroscopy.
J Synchrotron Radiat
January 2022
Chemical Sciences Division, Lawrence Berkeley National Laboratory, One Cyclotron Road, Berkeley, CA 94720, USA.
Soft X-ray spectromicroscopy at the O K-edge, U N-edges and Ce M-edges has been performed on focused ion beam sections of spent nuclear fuel for the first time, yielding chemical information on the sub-micrometer scale. To analyze these data, a modification to non-negative matrix factorization (NMF) was developed, in which the data are no longer required to be non-negative, but the non-negativity of the spectral components and fit coefficients is largely preserved. The modified NMF method was utilized at the O K-edge to distinguish between two components, one present in the bulk of the sample similar to UO and one present at the interface of the sample which is a hyperstoichiometric UO species.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!