Investigating solvability and complexity of linear active networks by means of matroids
- 1 May 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 26 (5) , 330-342
- https://doi.org/10.1109/tcs.1979.1084645
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Topological conditions for the solvability of linear active networksInternational Journal of Circuit Theory and Applications, 1976
- Generalized networks: Networks embedded on a matroid, part INetworks, 1976
- The generalized tree for state variables in linear active networksInternational Journal of Circuit Theory and Applications, 1976
- Matroid intersection algorithmsMathematical Programming, 1975
- Some considerations on state equations of linear active networksInternational Journal of Circuit Theory and Applications, 1974
- On the unique solvability of linear active networksIEEE Transactions on Circuits and Systems, 1974
- State equations and initial values in active RLC networksIEEE Transactions on Circuit Theory, 1971
- Solvability and analysis of linear active networks by use of the state equationsIEEE Transactions on Circuit Theory, 1970
- The state-variable approach to network analysisProceedings of the IEEE, 1965
- The Explicit Form of Bashkow's A MatrixIRE Transactions on Circuit Theory, 1962