Matrices and Matroids for Systems Analysis

Author: Kazuo Murota

Publisher: Springer Science & Business Media

ISBN: 3642039944

Category: Mathematics

Page: 483

View: 2602

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

Systems Analysis by Graphs and Matroids

Structural Solvability and Controllability

Author: Kazuo Murota

Publisher: Springer Science & Business Media

ISBN: 3642615864

Category: Mathematics

Page: 284

View: 3606

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.

Topics in Matroid Theory

Author: Leonidas S. Pitsoulis

Publisher: Springer Science & Business Media

ISBN: 1461489571

Category: Mathematics

Page: 127

View: 1729

Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds, Tutte, Cunningham and Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraic framework, thereby providing the analytical tools to solve related difficult algorithmic problems. The monograph contains a rigorous axiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability as demonstrated in matrices, graphs and transversals. The author also presents a deep decomposition result in matroid theory that provides a structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as the immediate algorithmic consequences.

Introduction to Matrix Analysis

Second Edition

Author: Richard Bellman

Publisher: SIAM

ISBN: 9781611971170

Category: Mathematical analysis

Page: 403

View: 2543

Long considered to be a classic in its field, this was the first book in English to include three basic fields of the analysis of matrices -- symmetric matrices and quadratic forms, matrices and differential equations, and positive matrices and their use in probability theory and mathematical economics. Written in lucid, concise terms, this volume covers all the key aspects of matrix analysis and presents a variety of fundamental methods. Originally published in 1970, this book replaces the first edition previously published by SIAM in the Classics series. Here you will find a basic guide to operations with matrices and the theory of symmetric matrices, plus an understanding of general square matrices, origins of Markov matrices and non-negative matrices in general, minimum- maximum characterization of characteristic roots, Krnoecker products, functions of matrices, and much more. These ideas and methods will serve as powerful analytical tools. In addition, this volume includes exercises of all levels of difficulty and many references to original papers containing further results. The problem sections contain many useful and interesting results that are not easily found elsewhere. A discussion of the theoretical treatment of matrices in the computational solution of ordinary and partial differential equations, as well as important chapters on dynamic programming and stochastic matrices are also included.

Matroid Decomposition

Author: K. Truemper

Publisher: Leibniz Company

ISBN: 1483276627

Category: Mathematics

Page: 408

View: 724

Matroid Decomposition deals with decomposition and composition of matroids. The emphasis is on binary matroids, which are produced by the matrices over the binary field GF(2). Different classes of matroids are described (graphic, regular, almost regular, max-flow min-cut), along with polynomial testing algorithms. Representative applications and, except for the almost-regular case, characterizations in terms of excluded minors are given. In addition, excluded minor characterizations of both binary and ternary matroids are presented. Comprised of 13 chapters, this book begins with an introduction to basic definitions concerning graphs and matrices, followed by a discussion on binary matroids. Subsequent chapters focus on some elementary constructions of graphs and binary matroids; a simple yet effective method called the path shortening technique for establishing basic connectivity relationships and certain results about the intersection and partitioning of matroids; an algorithm for identifying certain matroid separations; and the so-called splitter theorem. Fundamental notions and theorems about matroid decomposition and composition are described, along with a very important property of real matrices called total unimodularity. The book concludes with an analysis of flows in matroids based on ideas from flows in graphs. This monograph will be of interest to students and practitioners in diverse fields such as civil, electrical, and mechanical engineering, as well as computer science and mathematics.

Combinatorial and Graph-Theoretical Problems in Linear Algebra

Author: Richard A. Brualdi,Shmuel Friedland,Victor Klee

Publisher: Springer Science & Business Media

ISBN: 1461383544

Category: Mathematics

Page: 260

View: 2922

This IMA Volume in Mathematics and its Applications COMBINATORIAL AND GRAPH-THEORETICAL PROBLEMS IN LINEAR ALGEBRA is based on the proceedings of a workshop that was an integral part of the 1991-92 IMA program on "Applied Linear Algebra." We are grateful to Richard Brualdi, George Cybenko, Alan George, Gene Golub, Mitchell Luskin, and Paul Van Dooren for planning and implementing the year-long program. We especially thank Richard Brualdi, Shmuel Friedland, and Victor Klee for organizing this workshop and editing the proceedings. The financial support of the National Science Foundation made the workshop possible. A vner Friedman Willard Miller, Jr. PREFACE The 1991-1992 program of the Institute for Mathematics and its Applications (IMA) was Applied Linear Algebra. As part of this program, a workshop on Com binatorial and Graph-theoretical Problems in Linear Algebra was held on November 11-15, 1991. The purpose of the workshop was to bring together in an informal setting the diverse group of people who work on problems in linear algebra and matrix theory in which combinatorial or graph~theoretic analysis is a major com ponent. Many of the participants of the workshop enjoyed the hospitality of the IMA for the entire fall quarter, in which the emphasis was discrete matrix analysis.

Discrete Convex Analysis

Author: Kazuo Murota

Publisher: SIAM

ISBN: 9780898718508

Category: Convex functions

Page: 389

View: 9403

Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis.

Optimal Structural Analysis

Author: Ali Kaveh

Publisher: John Wiley & Sons

ISBN: 0470033290

Category: Mathematics

Page: 532

View: 9158

This second edition of the highly acclaimed and successful first edition, deals primarily with the analysis of structural engineering systems, with applicable methods to other types of structures. The concepts presented in the book are not only relevant to skeletal structures but can equally be used for the analysis of other systems such as hydraulic and electrical networks. The book has been substantially revised to include recent developments and applications of the algebraic graph theory and matroids.

Submodular Functions and Electrical Networks

Author: H. Narayanan

Publisher: Elsevier

ISBN: 0444825231

Category: Technology & Engineering

Page: 650

View: 5556

There is a strong case for electrical network topologists and submodular function theorists being aware of each other's fields. Presenting a topological approach to electrical network theory, this book demonstrates the strong links that exist between submodular functions and electrical networks. The book contains: • a detailed discussion of graphs, matroids, vector spaces and the algebra of generalized minors, relevant to network analysis (particularly to the construction of efficient circuit simulators) • a detailed discussion of submodular function theory in its own right; topics covered include, various operations, dualization, convolution and Dilworth truncation as well as the related notions of prinicpal partition and principal lattice of partitions. In order to make the book useful to a wide audience, the material on electrical networks and that on submodular functions is presented independently of each other. The hybrid rank problem, the bridge between (topological) electrical network theory and submodular functions, is covered in the final chapter. The emphasis in the book is on low complexity algorithms, particularly based on bipartite graphs. The book is intended for self-study and is recommended to designers of VLSI algorithms. More than 300 problems, almost all of them with solutions, are included at the end of each chapter.

Linear Representations of Partially Ordered Sets and Vector Space Categories

Author: Daniel Simson

Publisher: CRC Press

ISBN: 9782881248283

Category: Mathematics

Page: 499

View: 5635

This volume provides an elementary yet comprehensive introduction to representations of partially ordered sets and bimodule matrix problems, and their use in representation theory of algebras. It includes a discussion of representation types of algebras and partially ordered sets. Various characterizations of representation-finite and representation-tame partially ordered sets are offered and a description of their indecomposable representations is given. Auslander-Reiten theory is demonstrated together with a computer accessible algorithm for determining in decomposable representations and the Auslander-Reiten quiver of any representation-finite partially ordered set.

Matroid Theory

AMS-IMS-SIAM Joint Summer Research Conference on Matroid Theory, July 2-6, 1995, University of Washington, Seattle

Author: Joseph Edmond Bonin

Publisher: American Mathematical Soc.

ISBN: 0821805088

Category: Mathematics

Page: 418

View: 7011

This volume contains the proceedings of the 1995 AMS-IMS-SIAM Joint Summer Research Conference on Matroid Theory held at the University of Washington, Seattle. The book features three comprehensive surveys that bring the reader to the forefront of research in matroid theory. Joseph Kung's encyclopedic treatment of the critical problem traces the development of this problem from its origins through its numerous links with other branches of mathematics to the current status of its many aspects. James Oxley's survey of the role of connectivity and structure theorems in matroid theory stresses the influence of the Wheels and Whirls Theorem of Tutte and the Splitter Theorem of Seymour. Walter Whiteley's article unifies applications of matroid theory to constrained geometrical systems, including the rigidity of bar-and-joint frameworks, parallel drawings, and splines. These widely accessible articles contain many new results and directions for further research and applications. The surveys are complemented by selected short research papers. The volume concludes with a chapter of open problems. Features self-contained, accessible surveys of three active research areas in matroid theory; many new results; pointers to new research topics; a chapter of open problems; mathematical applications; and applications and connections to other disciplines, such as computer-aided design and electrical and structural engineering.

Linear Integral Equations

Author: Rainer Kress

Publisher: Springer Science & Business Media

ISBN: 1461495938

Category: Mathematics

Page: 412

View: 9418

This book combines theory, applications, and numerical methods, and covers each of these fields with the same weight. In order to make the book accessible to mathematicians, physicists, and engineers alike, the author has made it as self-contained as possible, requiring only a solid foundation in differential and integral calculus. The functional analysis which is necessary for an adequate treatment of the theory and the numerical solution of integral equations is developed within the book itself. Problems are included at the end of each chapter. For this third edition in order to make the introduction to the basic functional analytic tools more complete the Hahn–Banach extension theorem and the Banach open mapping theorem are now included in the text. The treatment of boundary value problems in potential theory has been extended by a more complete discussion of integral equations of the first kind in the classical Holder space setting and of both integral equations of the first and second kind in the contemporary Sobolev space setting. In the numerical solution part of the book, the author included a new collocation method for two-dimensional hypersingular boundary integral equations and a collocation method for the three-dimensional Lippmann-Schwinger equation. The final chapter of the book on inverse boundary value problems for the Laplace equation has been largely rewritten with special attention to the trilogy of decomposition, iterative and sampling methods Reviews of earlier editions: "This book is an excellent introductory text for students, scientists, and engineers who want to learn the basic theory of linear integral equations and their numerical solution." (Math. Reviews, 2000) "This is a good introductory text book on linear integral equations. It contains almost all the topics necessary for a student. The presentation of the subject matter is lucid, clear and in the proper modern framework without being too abstract." (ZbMath, 1999)

Computational Oriented Matroids

Equivalence Classes of Matrices Within a Natural Framework

Author: Jürgen Bokowski

Publisher: Cambridge University Press

ISBN: 0521849306

Category: Computers

Page: 323

View: 5582

Oriented matroids play the role of matrices in discrete geometry, when metrical properties, such as angles or distances, are neither required nor available. Thus they are of great use in such areas as graph theory, combinatorial optimization and convex geometry. The variety of applications corresponds to the variety of ways they can be defined. Each of these definitions corresponds to a differing data structure for an oriented matroid, and handling them requires computational support, best realised through a functional language. Haskell is used here, and, for the benefit of readers, the book includes a primer on it. The combination of concrete applications and computation, the profusion of illustrations, many in colour, and the large number of examples and exercises make this an ideal introductory text on the subject. It will also be valuable for self-study for mathematicians and computer scientists working in discrete and computational geometry.

Applications of Fuzzy Sets to Systems Analysis


Publisher: Birkhäuser

ISBN: 303485921X

Category: Juvenile Nonfiction

Page: 191

View: 737

Ten years ago, Zadeh has brought into vogue the use of a name. Scientists no is an increasing less than poets strike off words that fit a situation. Today there recognition that for understanding vagueness, a fuzzy approach is required. We are just going through ~ transient period. From discussions of general philosophy to practical methods for system analysis. Unfortunately, much of the existing research is scattered. The practitioner interested in these methods face the challenge of sorting through a vast amount of literature to find a core on which to build. One of the objects of this book was to facilitate communication by bringing toge ther different viewpoints and coloring them from a common viewpoint. Since the romanian version appeared, at the very beginning of 1974, there has been a rapid growth in the literature of fuzzy modelling. A minor revision would have left the book quite out-of-date. The opportunity has been taken to correct, clarify, and update. Inexactness is implicit in human behaviour and erare humanum est. It is a pleasure to acknowledge the help we have received in preparing this version. The opportunity to see an english edition was a powerful stimulus, and we are grateful to Salomon Klaczko for making this possible. Another debt is to all fuzzy authors we have quoted. Their fascinating papers kindled our interest in the subject.

Iterative Methods in Combinatorial Optimization

Author: Lap Chi Lau,R. Ravi,Mohit Singh

Publisher: Cambridge University Press

ISBN: 1139499394

Category: Computers

Page: N.A

View: 2302

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Finite Difference Methods for Ordinary and Partial Differential Equations

Steady-State and Time-Dependent Problems

Author: Randall J. LeVeque

Publisher: SIAM

ISBN: 9780898717839

Category: Differential equations

Page: 339

View: 6625

This book introduces finite difference methods for both ordinary differential equations (ODEs) and partial differential equations (PDEs) and discusses the similarities and differences between algorithm design and stability analysis for different types of equations. A unified view of stability theory for ODEs and PDEs is presented, and the interplay between ODE and PDE analysis is stressed. The text emphasizes standard classical methods, but several newer approaches also are introduced and are described in the context of simple motivating examples.

Linear, Time-varying Approximations to Nonlinear Dynamical Systems

with Applications in Control and Optimization

Author: Maria Tomas-Rodriguez,Stephen P. Banks

Publisher: Springer Science & Business Media

ISBN: 184996100X

Category: Mathematics

Page: 300

View: 5878

Linear, Time-varying Approximations to Nonlinear Dynamical Systems introduces a new technique for analysing and controlling nonlinear systems. This method is general and requires only very mild conditions on the system nonlinearities, setting it apart from other techniques such as those – well-known – based on differential geometry. The authors cover many aspects of nonlinear systems including stability theory, control design and extensions to distributed parameter systems. Many of the classical and modern control design methods which can be applied to linear, time-varying systems can be extended to nonlinear systems by this technique. The implementation of the control is therefore simple and can be done with well-established classical methods. Many aspects of nonlinear systems, such as spectral theory which is important for the generalisation of frequency domain methods, can be approached by this method.