Matrices of Sign-Solvable Linear Systems (Cambridge Tracts in Mathematics, Series Number 116) - Hardcover

Brualdi, Richard A.; Shader, Bryan L.

Hardcover

ISBN 10: 0521482968 ISBN 13: 9780521482967

Publisher: Cambridge University Press, 1995

Synopsis

In a sign-solvable linear system, the signs of the coefficients determine the signs of some entries in the solution. This type of system is part of a larger study that helps researchers understand if properties of a matrix can be determined from combinatorial arrangements of its elements. In this book, the authors present the diffuse body of literature on sign-solvability as a coherent whole for the first time, giving many new results and proofs and establishing many new connections. Brualdi and Shader describe and comment on algorithms implicit in many of the proofs and their complexity. The book is self-contained, assuming familiarity only with elementary linear algebra and graph theory. Intended primarily for researchers in combinatorics and linear algebra, it should also be of interest to computer scientists, economists, physicists, chemists, and engineers.

About this title

Book Description:

In a sign-solvable linear system, some qualities of the solution are determined solely by the signs of the coefficients. Paul Samuelson extolled the use of such investigations in economics; applications have also been found in chemistry and physics. This book presents the diffuse field of sign-solvability as a coherent whole for the first time, giving many new results and establishing many new connections. Algorithms implicit in many of the proofs are explicitly described. Intended primarily for researchers in combinatorics and linear algebra, this self-contained account will also interest computer scientists, economists, physicists, chemists, and engineers.

Review:

"The book is well written and quite readable. It should become an indispensable reference for anyone intersted in questions related to sign solvability of linear systems." Peter M. Gibson, SIAM Review

"...primarily for researchers in combinatorics and linear algebra, it should also be of interest to theoretical computer scientists, economists, physicists, chemists and engineers." Gerard Sierksma, Mathematical Review

About this edition

• Publisher: Cambridge University Press
• Publication date: 1995
• ISBN 10: 0521482968
• ISBN 13: 9780521482967
• Binding: Hardcover
• Edition number: 1
• Number of pages: 316