menu
{ "item_title" : "Matrices of Sign-Solvable Linear Systems", "item_author" : [" Richard A. Brualdi", "Bryan L. Shader "], "item_description" : "In a sign-solvable linear system, the signs of the coefficients determine the signs of some entries in the solution. This type of system is part of a larger study that helps researchers understand if properties of a matrix can be determined from combinatorial arrangements of its elements. In this book, the authors present the diffuse body of literature on sign-solvability as a coherent whole for the first time, giving many new results and proofs and establishing many new connections. Brualdi and Shader describe and comment on algorithms implicit in many of the proofs and their complexity. The book is self-contained, assuming familiarity only with elementary linear algebra and graph theory. Intended primarily for researchers in combinatorics and linear algebra, it should also be of interest to computer scientists, economists, physicists, chemists, and engineers.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/110/582/052110582X_b.jpg", "price_data" : { "retail_price" : "50.00", "online_price" : "50.00", "our_price" : "50.00", "club_price" : "50.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Matrices of Sign-Solvable Linear Systems|Richard A. Brualdi

Matrices of Sign-Solvable Linear Systems

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

In a sign-solvable linear system, the signs of the coefficients determine the signs of some entries in the solution. This type of system is part of a larger study that helps researchers understand if properties of a matrix can be determined from combinatorial arrangements of its elements. In this book, the authors present the diffuse body of literature on sign-solvability as a coherent whole for the first time, giving many new results and proofs and establishing many new connections. Brualdi and Shader describe and comment on algorithms implicit in many of the proofs and their complexity. The book is self-contained, assuming familiarity only with elementary linear algebra and graph theory. Intended primarily for researchers in combinatorics and linear algebra, it should also be of interest to computer scientists, economists, physicists, chemists, and engineers.

This item is Non-Returnable

Details

  • ISBN-13: 9780521105828
  • ISBN-10: 052110582X
  • Publisher: Cambridge University Press
  • Publish Date: April 2009
  • Dimensions: 9 x 6 x 0.71 inches
  • Shipping Weight: 1.02 pounds
  • Page Count: 316

Related Categories

You May Also Like...

    1

BAM Customer Reviews