Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Matrices of Sign-Solvable Linear Systems

Matrices of Sign-Solvable Linear Systems

Matrices of Sign-Solvable Linear Systems

Richard A. Brualdi , University of Wisconsin, Madison
Bryan L. Shader , University of Wyoming
April 2009
Available
Paperback
9780521105828

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

    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.

    Reviews & endorsements

    "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

    See more reviews

    Product details

    April 2009
    Paperback
    9780521105828
    316 pages
    229 × 152 × 18 mm
    0.47kg
    7 b/w illus.
    Available

    Table of Contents

    • Preface
    • 1. Sign-solvability
    • Bibliography
    • 2. L-matrices
    • Bibliography
    • 3. Sign-solvability and digraphs
    • Bibliography
    • 4. S*-matrices
    • Bibliography
    • 5. Beyond S*-matrices
    • Bibliography
    • 6. SNS-matrices
    • Bibliography
    • 7. S2NS-matrices
    • Bibliography
    • 8. Extremal properties of L-matrices
    • Bibliography
    • 9. The inverse sign pattern graph
    • Bibliography
    • 10. Sign stability
    • Bibliography
    • 11. Related Topics
    • Bibliography
    • Master Bibliography
    • Index.
      Authors
    • Richard A. Brualdi , University of Wisconsin, Madison
    • Bryan L. Shader , University of Wyoming