Skip to main content

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

  • Chapter
  • First Online:
Book cover Optimization Problems in Graph Theory

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 139))

  • 1421 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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–81

    Google 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, 1982

    Google Scholar 

Download references

Acknowledgements

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.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Goncharenko, V., Goncharenko, Y., Lyashko, S., Semenov, V. (2018). Optimal Factorization of Operators by Operators That Are Consistent with the Graph’s Structure. In: Goldengorin, B. (eds) Optimization Problems in Graph Theory. Springer Optimization and Its Applications, vol 139. Springer, Cham. https://doi.org/10.1007/978-3-319-94830-0_4

Download citation

Publish with us

Policies and ethics