Matrices of Sign-Solvable Linear Systems (Paperback)

Richard A. Brualdi

ISBN 10: 052110582X / ISBN 13: 9780521105828

Editore: Cambridge University Press, Cambridge, 2009

Riguardo questo articolo

Paperback. The sign-solvability of a linear system implies that the signs of the entries of the solution are determined solely on the basis of the signs of the coefficients of the system. That it might be worthwhile and possible to investigate such linear systems was recognised by Samuelson in his classic book Foundations of Economic Analysis. Sign-solvability is part of a larger study which seeks to understand the special circumstances under which an algebraic, analytic or geometric property of a matrix can be determined from the combinatorial arrangement of the positive, negative and zero elements of the matrix. The large and diffuse body of literature connected with sign-solvability is presented as a coherent whole for the first time in this book, displaying it as a beautiful interplay between combinatorics and linear algebra. One of the features of this book is that algorithms that are implicit in many of the proofs have been explicitly described and their complexity has been commented on. The large and diffuse body of literature connected with sign-solvability is presented as a coherent whole for the first time in this book, displaying it as a beautiful interplay between combinatorics and linear algebra. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780521105828

Dati bibliografici

Titolo: Matrices of Sign-Solvable Linear Systems (...

Casa editrice: Cambridge University Press, Cambridge

Data di pubblicazione: 2009

Legatura: Paperback

Condizione: new

Descrizione articolo

Riassunto:

The large and diffuse body of literature connected with sign-solvability is presented as a coherent whole for the first time in this book.

Recensione:

"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