All listings for this product
About this product
- DescriptionThe 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 Ecomic 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.
- Author(s)Bryan L. Shader,Richard A. Brualdi
- PublisherCambridge University Press
- Date of Publication29/09/1995
- Series TitleCambridge Tracts in Mathematics
- Series Part/Volume NumberNo.116
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note7 b/w illus.
- Weight640 g
- Width152 mm
- Height228 mm
- Spine22 mm
- Series Edited byB. Bollobas,W. Fulton,A. Katok,F. Kirwan,P. Sarnak,B. Simon
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $38.44Trending at AU $48.97
- AU $35.06Trending at AU $36.68
- AU $27.64Trending at AU $34.95
- AU $22.22Trending at AU $31.05
- AU $29.06Trending at AU $39.11
- AU $20.74Trending at AU $24.30
- AU $18.13Trending at AU $24.26
This item doesn't belong on this page.
Thanks, we'll look into this.