Independent Loops Search in Flow Networks Aiming for Well-Conditioned System of Equations

  • Jukka-Pekka Humaloja
  • Simo Ali-Löytty
  • Timo Hämäläinen
  • Seppo Pohjolainen
Conference paper
Part of the Mathematics in Industry book series (MATHINDUSTRY, volume 26)

Abstract

We approach the problem of choosing linearly independent loops in a pipeflow network as choosing the best-conditioned submatrix of a given larger matrix. We present some existing results of graph theory and submatrix selection problems, based on which we construct three heuristic algorithms for choosing the loops. The heuristics are tested on two pipeflow networks that differ significantly on the distribution of pipes and nodes in the network.

Notes

Acknowledgements

This work was carried out in the research program Flexible Energy Systems (FLEXe) in collaboration with Valmet, and it was supported by Tekes—the Finnish Funding Agency for Innovation.

References

  1. 1.
    Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore (2013)Google Scholar
  2. 2.
    Santamu, S.R.: Graph Theory with Algorithms and Its Applications: In Applied Science and Technology. Springer, New Delhi (2013)Google Scholar
  3. 3.
    \(\check {\mathrm {S}}\)r\(\acute {\mathrm {a}}\)mek, R., Fisher, B., Vicari, E., Widmayer, P.: Optimal transitions for targeted protein quantification: best conditioned submatrix selection. In: Nqo, H.Q. (Ed.) COCOON 2009, LNCS 5609, pp. 287–296. Springer, Berlin/Heidelberg (2009)Google Scholar
  4. 4.
    Stephenson, D.: Pipeflow Analysis, 1st ed. Elsevier Science, New York (1984)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2017

Authors and Affiliations

  • Jukka-Pekka Humaloja
    • 1
  • Simo Ali-Löytty
    • 1
  • Timo Hämäläinen
    • 1
  • Seppo Pohjolainen
    • 1
  1. 1.Department of MathematicsTampere University of TechnologyTampereFinland

Personalised recommendations