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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    19 Downloads (Pure)

    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.
    Original languageEnglish
    Title of host publicationProgress in Industrial Mathematics at ECMI 2016
    EditorsPeregrina Quintela, Patricia Barral, Dolores Gómez, Francisco J. Pena, Jerónimo Rodríguez, Pilar Salgado, Miguel E. Vázquez-Mendéz
    PublisherSpringer International Publishing
    ISBN (Electronic)978-3-319-63082-3
    ISBN (Print)978-3-319-63081-6
    DOIs
    Publication statusPublished - 2017
    Publication typeA4 Article in conference proceedings
    EventEUROPEAN CONFERENCE ON MATHEMATICS FOR INDUSTRY -
    Duration: 1 Jan 1900 → …

    Publication series

    NameMathematics in industry
    PublisherSpringer
    Volume26
    ISSN (Print)1612-3956
    ISSN (Electronic)2198-3283

    Conference

    ConferenceEUROPEAN CONFERENCE ON MATHEMATICS FOR INDUSTRY
    Period1/01/00 → …

    Keywords

    • pipeflow analysis
    • independent loops

    Publication forum classification

    • Publication forum level 1

    ASJC Scopus subject areas

    • Applied Mathematics
    • Modelling and Simulation

    Fingerprint

    Dive into the research topics of 'Independent Loops Search in Flow Networks Aiming for Well-Conditioned System of Equations'. Together they form a unique fingerprint.

    Cite this