Optimal Factorization of Operators by Operators That Are Consistent with the Graph’s Structure

Victoria Goncharenko, Yuri Goncharenko (), Sergey Lyashko and Vladimir Semenov
Additional contact information
Victoria Goncharenko: Taras Shevchenko Kiev National University
Yuri Goncharenko: Taras Shevchenko Kiev National University
Sergey Lyashko: Taras Shevchenko Kiev National University
Vladimir Semenov: Taras Shevchenko Kiev National University

A chapter in Optimization Problems in Graph Theory, 2018, pp 85-91 from Springer

Abstract: 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.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-94830-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319948300

DOI: 10.1007/978-3-319-94830-0_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().