Optimal Factorization of Operators by Operators That Are Consistent with the Graph’s Structure
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.
This research is supported by the Ministry of Education and Science of Ukraine (project 0116U004777). Vladimir Semenov thanks the State Fund for Fundamental Researches of Ukraine for support.
- 1.V. Yu. Goncharenko, Factorization of inverse matrices by sparse matrices. J. Comput. Appl. Math. 1(111), 94–100 (2013)Google Scholar
- 2.V. Yu. Goncharenko, The factorization of mapping and parallelization of algorithms. Rep. Natl. Acad. Sci. Ukr., no. 2, 38–40 (1995)Google Scholar
- 3.V. Yu. Goncharenko, Some properties of operators that are consistent with the graph structure, in Operations Research and ACS, vol. 23, (KSU, Kiev, 1984), pp. 73–81Google Scholar
- 4.V. Yu. Goncharenko, B.B. Nesterenko, Asynchronous principles in parallel computing, part II. WP of Institute of Mathematics of the NASU, no. 82–38. Kiev, 1982Google Scholar