Matrices of Sign-Solvable Linear Systems: (Cambridge Tracts in Mathematics)
By
Richard A. Brualdi (Author) Bryan L. Shader (Author)
Hardback
Available / dispatched within 1 - 2 weeks
Quantity
Description
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. 7 Line drawings, unspecified
More Details
- Contributor: Richard A. Brualdi
- Imprint: Cambridge University Press
- ISBN13: 9780521482967
- Number of Pages: 316
- Packaged Dimensions: 159x234x24mm
- Packaged Weight: 552
- Format: Hardback
- Publisher: Cambridge University Press
- Release Date: 1995-09-29
- Series: Cambridge Tracts in Mathematics
- Binding: Hardback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.