Polynomial control on stability, inversion and powers of matrices on simple graphs

From MaRDI portal
Publication:1626421

DOI10.1016/J.JFA.2018.09.014zbMATH Open1416.46051arXiv1705.07385OpenAlexW2963292013WikidataQ129159598 ScholiaQ129159598MaRDI QIDQ1626421FDOQ1626421


Authors: Chang Eon Shin, Qiyu Sun Edit this on Wikidata


Publication date: 27 November 2018

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Abstract: Spatially distributed networks of large size arise in a variety of science and engineering problems, such as wireless sensor networks and smart power grids. Most of their features can be described by properties of their state-space matrices whose entries have indices in the vertex set of a graph. In this paper, we introduce novel % Banach algebras of Beurling type that contain matrices on a connected simple graph having polynomial off-diagonal decay, and we show that they are Banach subalgebras of mathcalB(ellp),1lepleinfty, the space of all bounded operators on the space ellp of all p-summable sequences. The ellp-stability of state-space matrices is an essential hypothesis for the robustness of spatially distributed networks. In this paper, we establish the equivalence among ellp-stabilities of matrices in Beurling algebras for different exponents 1lepleinfty, with quantitative analysis for the lower stability bounds. Admission of norm-control inversion plays a crucial role in some engineering practice. In this paper, we prove that matrices in Beurling subalgebras of mathcalB(ell2) have norm-controlled inversion and we find a norm-controlled polynomial with close to optimal degree. Polynomial estimate to powers of matrices is important for numerical implementation of spatially distributed networks. In this paper, we apply our results on norm-controlled inversion to obtain a polynomial estimate to powers of matrices in Beurling algebras. The polynomial estimate is a noncommutative extension about convolution powers of a complex function and is applicable to estimate the probability of hopping from one agent to another agent in a stationary Markov chain on a spatially distributed network.


Full work available at URL: https://arxiv.org/abs/1705.07385




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Polynomial control on stability, inversion and powers of matrices on simple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626421)