Nested \(\epsilon\)-decompositions and clustering of complex systems (Q1077351)

The paper is devoted to a graph-theoretic variant of the known idea of \(\epsilon\)-decomposition [see e.g. \textit{A. A. Pervozvanskij} and \textit{V. G. Gajtsgori}, Decomposition, aggregation and approximate optimization (1979; Zbl 0508.90057)]. The authors discuss a regular case of the perturbed linear system where the generating system \((\epsilon =0)\) is decomposed into a set of independent subsystems. Subsystems' analysis and control design can be used for an approximate solution of the correspondent problems for the perturbed complex system. All results are simple consequences of the LVF-technique [see also explicit estimates by \textit{F. N. Bailey} and \textit{H. K. Ramapriyan}, IEEE Trans. Autom. Control AC-18, 532-534 (1973; Zbl 0266.49032)]. However, an algorithm presented by the authors for the computation of \(\epsilon\) on a digraph can be useful in applications.