Investigating solvability and complexity of linear active networks by means of matroids

Bjørn Petersen

    Research output: Contribution to journalJournal articleResearchpeer-review

    421 Downloads (Pure)


    The solvability and complexity problems of finear active network are approached from a purely combinatorial point of view, using the concepts of matroid theory. Since the method is purely combinatorial, we take into account the network topology alone. Under this assumption necessary and sufficient conditions are given for the unique solvablity of linear active networks. The complexity and the number of dc-eigenfrequencies are also given. The method to decide if degeneracies are due to the topology alone, or if they are caused by special relations among network parameter values. If the network parameter values are taken into account, the complexity and number of dc-eigenfrequencies given by the method, are only upper and lower bounds, respectively. The above conditions are fairly easily checked, and the complexity and number of dc-elgenfrequencies are found, using polynomially bounded algorithms (matroid partition and intersection algorithms).
    Original languageEnglish
    JournalIEEE Transactions on Circuits and Systems
    Issue number5
    Pages (from-to)330-342
    Publication statusPublished - 1979

    Bibliographical note

    Copyright 1979 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Fingerprint Dive into the research topics of 'Investigating solvability and complexity of linear active networks by means of matroids'. Together they form a unique fingerprint.

    Cite this