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.
General
| Imprint: |
Cambridge UniversityPress
|
| Country of origin: |
United Kingdom |
| Series: |
Cambridge Tracts in Mathematics |
| Release date: |
April 2009 |
| First published: |
April 2009 |
| Authors: |
Richard A. Brualdi
• Bryan L. Shader
|
| Dimensions: |
229 x 152 x 18mm (L x W x T) |
| Format: |
Paperback - Trade
|
| Pages: |
316 |
| ISBN-13: |
978-0-521-10582-8 |
| Categories: |
Books >
Science & Mathematics >
Mathematics >
Algebra >
General
|
| LSN: |
0-521-10582-X |
| Barcode: |
9780521105828 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
