Atnaujinkite slapukų nuostatas

Matrices and Matroids for Systems Analysis 1st ed. 2000. 2nd printing 2009 [Minkštas viršelis]

  • Formatas: Paperback / softback, 483 pages, aukštis x plotis: 235x155 mm, weight: 1520 g, XII, 483 p., 1 Paperback / softback
  • Serija: Algorithms and Combinatorics 20
  • Išleidimo metai: 18-Nov-2009
  • Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642039936
  • ISBN-13: 9783642039935
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 483 pages, aukštis x plotis: 235x155 mm, weight: 1520 g, XII, 483 p., 1 Paperback / softback
  • Serija: Algorithms and Combinatorics 20
  • Išleidimo metai: 18-Nov-2009
  • Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3642039936
  • ISBN-13: 9783642039935
Kitos knygos pagal šią temą:
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.



This book serves also as a comprehensive presentation of the theory and application of mixed matrices, developed primarily by the present author in the 1990's. A mixed matrix is a convenient mathematical tool for systems analysis, compatible with the physical observation that "fixed constants" and "system parameters" are to be distinguished in the description of engineering systems.



This book will be extremely useful to graduate students and researchers in engineering, mathematics and computer science.



From the reviews:



"The book has been prepared very carefully, contains a lot of interesting results and is highly recommended for graduate and postgraduate students."



Andrįs Recski, Mathematical Reviews Clippings 2000m:93006
Preface v
Introduction to Structural Approach --- Overview of the Book
1(30)
Structural Approach to Index of DAE
1(9)
Index of Differential-algebraic Equations
1(2)
Graph-theoretic Structural Approach
3(4)
An Embarrassing Phenomenon
7(3)
What Is Combinatorial Structure?
10(10)
Two Kinds of Numbers
11(4)
Descriptor Form Rather than Standard Form
15(2)
Dimensional Analysis
17(3)
Mathematics on Mixed Polynomial Matrices
20(11)
Formal Definitions
20(1)
Resolution of the Index Problem
21(5)
Block-triangular Decomposition
26(5)
Matrix, Graph, and Matroid
31(76)
Matrix
31(12)
Polynomial and Algebraic Independence
31(2)
Determinant
33(3)
Rank, Term-rank and Generic-rank
36(4)
Block-triangular Forms
40(3)
Graph
43(28)
Directed Graph and Bipartite Graph
43(5)
Jordan-Holder-type Theorem for Submodular Functions
48(7)
Dulmage-Mendelsohn Decomposition
55(10)
Maximum Flow and Menger-type Linking
65(2)
Minimum Cost Flow and Weighted Matching
67(4)
Matroid
71(36)
From Matrix to Matroid
71(2)
Basic Concepts
73(4)
Examples
77(1)
Basis Exchange Properties
78(6)
Independent Matching Problem
84(9)
Union
93(4)
Bimatroid (Linking System)
97(10)
Physical Observations for Mixed Matrix Formulation
107(24)
Mixed Matrix for Modeling Two Kinds of Numbers
107(13)
Two Kinds of Numbers
107(9)
Mixed Matrix and Mixed Polynomial Matrix
116(4)
Algebraic Implication of Dimensional Consistency
120(6)
Introductory Comments
120(1)
Dimensioned Matrix
121(2)
Total Unimodularity of a Dimensioned Matrix
123(3)
Physical Matrix
126(5)
Physical Matrix
126(2)
Physical Matrices in a Dynamical System
128(3)
Theory and Application of Mixed Matrices
131(140)
Mixed Matrix and Layered Mixed Matrix
131(3)
Rank of Mixed Matrices
134(19)
Rank Identities for LM-matrices
135(4)
Rank Identities for Mixed Matrices
139(3)
Reduction to Independent Matching Problems
142(3)
Algorithms for the Rank
145(8)
Structural Solvability of Systems of Equations
153(14)
Formulation of Structural Solvability
153(3)
Graphical Conditions for Structural Solvability
156(4)
Matroidal Conditions for Structural Solvability
160(7)
Combinatorial Canonical Form of LM-matrices
167(35)
LM-equivalence
167(5)
Theorem of CCF
172(3)
Construction of CCF
175(6)
Algorithm for CCF
181(6)
Decomposition of Systems of Equations by CCF
187(4)
Application of CCF
191(8)
CCF over Rings
199(3)
Irreducibility of LM-matrices
202(9)
Theorems on LM-irreducibility
202(3)
Proof of the Irreducibility of Determinant
205(6)
Decomposition of Mixed Matrices
211(10)
LU-decomposition of Invertible Mixed Matrices
212(3)
Block-triangularization of General Mixed Matrices
215(6)
Related Decompositions
221(9)
Decomposition as Matroid Union
221(4)
Multilayered Matrix
225(3)
Electrical Network with Admittance Expression
228(2)
Partitioned Matrix
230(20)
Definitions
231(4)
Existence of Proper Block-triangularization
235(3)
Partial Order Among Blocks
238(2)
Generic Partitioned Matrix
240(10)
Principal Structures of LM-matrices
250(21)
Motivations
250(2)
Principal Structure of Submodular Systems
252(2)
Principal Structure of Generic Matrices
254(3)
Vertical Principal Structure of LM-matrices
257(4)
Horizontal Principal Structure of LM-matrices
261(10)
Polynomial Matrix and Valuated Matroid
271(60)
Polynomial/Rational Matrix
271(9)
Polynomial Matrix and Smith Form
271(1)
Rational Matrix and Smith-McMillan Form at Infinity
272(3)
Matrix Pencil and Kronecker Form
275(5)
Valuated Matroid
280(51)
Introduction
280(1)
Examples
281(1)
Basic Operations
282(3)
Greedy Algorithms
285(2)
Valuated Bimatroid
287(3)
Induction Through Bipartite Graphs
290(5)
Characterizations
295(5)
Further Exchange Properties
300(6)
Valuated Independent Assignment Problem
306(2)
Optimality Criteria
308(8)
Application to Triple Matrix Product
316(1)
Cycle-canceling Algorithms
317(8)
Augmenting Algorithms
325(6)
Theory and Application of Mixed Polynomial Matrices
331(72)
Descriptions of Dynamical Systems
331(4)
Mixed Polynomial Matrix Descriptions
331(1)
Relationship to Other Descriptions
332(3)
Degree of Determinant of Mixed Polynomial Matrices
335(20)
Introduction
335(1)
Graph-theoretic Method
336(1)
Basic Identities
337(3)
Reduction to Valuated Independent Assignment
340(3)
Duality Theorems
343(5)
Algorithm
348(7)
Smith Form of Mixed Polynomial Matrices
355(9)
Expression of Invariant Factors
355(8)
Proofs
363(1)
Controllability of Dynamical Systems
364(20)
Controllability
364(1)
Structural Controllability
365(7)
Mixed Polynomial Matrix Formulation
372(3)
Algorithm
375(4)
Examples
379(5)
Fixed Modes of Decentralized Systems
384(19)
Fixed Modes
384(3)
Structurally Fixed Modes
387(3)
Mixed Polynomial Matrix Formulation
390(5)
Algorithm
395(3)
Examples
398(5)
Further Topics
403(50)
Combinatorial Relaxation Algorithm
403(15)
Outline of the Algorithm
403(4)
Test for Upper-tightness
407(6)
Transformation Towards Upper-tightness
413(4)
Algorithm Description
417(1)
Combinatorial System Theory
418(13)
Definition of Combinatorial Dynamical Systems
419(1)
Power Products
420(2)
Eigensets and Recurrent Sets
422(4)
Controllability of Combinatorial Dynamical Systems
426(5)
Mixed Skew-symmetric Matrix
431(22)
Introduction
431(2)
Skew-symmetric Matrix
433(5)
Delta-matroid
438(6)
Rank of Mixed Skew-symmetric Matrices
444(2)
Electrical Network Containing Gyrators
446(7)
References 453(16)
Notation Table 469(10)
Index 479