Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Algorithms and Combinatorics, Study and Research Texts : 3
1987

Details

Autor(en) / Beteiligte
Titel
Systems Analysis by Graphs and Matroids : Structural Solvability and Controllability [Elektronische Ressource]
Ist Teil von
  • Algorithms and Combinatorics, Study and Research Texts : 3
Ort / Verlag
Berlin, Heidelberg : Springer Berlin Heidelberg
Erscheinungsjahr
1987
Link zum Volltext
Link zu anderen Inhalten
Beschreibungen/Notizen
  • Recent technology involves large-scale physical or engineering systems consisting of thousands of interconnected elementary units. This monograph illustrates how engineering problems can be solved using the recent results of combinatorial mathematics through appropriate mathematical modeling. The structural solvability of a system of linear or nonlinear equations as well as the structural controllability of a linear time-invariant dynamical system are treated by means of graphs and matroids. Special emphasis is laid on the importance of relevant physical observations to successful mathematical modelings. The reader will become acquainted with the concepts of matroid theory and its corresponding matroid theoretical approach. This book is of interest to graduate students and researchers
Sprache
Englisch
Identifikatoren
ISBN: 9783642615863, 9783540176596
DOI: 10.1007/978-3-642-61586-3
OCLC-Nummer: 863758693, 863758693
Titel-ID: 990018265370106463
Format
X, 284 p
Schlagworte
Mathematics, Combinatorics