Abstract
In this paper we introduce the notion of an operator that is consistent with the structure of a graph and the computational system that is universal in the class of operators. The model fully corresponds to the processes occurring in distributed computing systems. The problem of the factorization of operators by operators consistent with the structure of a graph is formulated. We prove the criterion for the factorization of a linear invertible operator acting in a finite-dimensional linear space. We obtain upper estimations of the factorization depth of the class of linear invertible operators by linear operators compatible with the structure of the graph.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call