Matrices of sign-solvable linear systems / Richard A. Brualdi, Bryan L. Shader.

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...

Full description

Bibliographic Details
Uniform Title:Cambridge tracts in mathematics ; 116.
Main Authors: Brualdi, Richard A. (Author)
Shader, Bryan L. (Author)
Language:English
Published: Cambridge : Cambridge University Press, 1995.
Series:Cambridge tracts in mathematics ; 116.
Subjects:
Online Access:
Physical Description:1 online resource (xii, 298 pages) : digital, PDF file(s).
Format: Electronic eBook

MARC

LEADER 00000nam a22000008i 4500
001 in00005575075
003 OCoLC
005 20220616145027.0
006 m|||||o||d||||||||
007 cr |||||||||||
008 090522s1995||||enk o ||1 0|eng|d
020 |a 9780511574733 (ebook) 
020 |z 9780521482967 (hardback) 
020 |z 9780521105828 (paperback) 
035 |a CR9780511574733 
040 |a UkCbUP  |b eng  |e rda  |c UkCbUP  |d UtOrBLW 
049 |a QEMP 
050 0 0 |a QA188  |b .B79 1995 
082 0 0 |a 512.9/434  |2 20 
100 1 |a Brualdi, Richard A.,  |e author.  |0 http://id.loc.gov/authorities/names/n85218473 
245 1 0 |a Matrices of sign-solvable linear systems /  |c Richard A. Brualdi, Bryan L. Shader. 
264 1 |a Cambridge :  |b Cambridge University Press,  |c 1995. 
300 |a 1 online resource (xii, 298 pages) :  |b digital, PDF file(s). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Cambridge tracts in mathematics ;  |v 116 
500 |a Title from publisher's bibliographic system (viewed on 05 Oct 2015). 
505 0 |a Sign-solvability -- L-matrices -- Sign-solvability and digraphs -- S-matrices -- Beyond S*-matrices -- SNS-matrices -- S2NS-matrices -- External properties of L-Matrices -- The inverse sign pattern graph -- Sign stability -- Related topics. 
520 |a 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. 
650 0 |a Matrices.  |0 http://id.loc.gov/authorities/subjects/sh85082210 
700 1 |a Shader, Bryan L.,  |e author.  |0 http://id.loc.gov/authorities/names/n94104240 
776 0 8 |i Print version:  |a Brualdi, Richard A.  |t Matrices of sign-solvable linear systems  |z 9780521482967. 
830 0 |a Cambridge tracts in mathematics ;  |v 116.  |0 http://id.loc.gov/authorities/names/n42005726 
856 4 0 |u http://ezproxy.msu.edu/login?url=http://dx.doi.org/10.1017/CBO9780511574733  |z Connect to online resource - MSU authorized users  |t 0 
907 |y .b119434167  |b 211128  |c 160728 
998 |a wb  |b 160728  |c m  |d a   |e -  |f eng  |g enk  |h 0  |i 3 
999 f f |i 3e413241-c467-5edb-9d5c-fdf9746fae6b  |s 944291de-8255-59d6-aa57-764c33f23247  |t 0 
952 f f |p Non-Circulating  |a Michigan State University-Library of Michigan  |b Michigan State University  |c MSU Online Resource  |d MSU Online Resource  |t 0  |e QA188 .B79 1995  |h Library of Congress classification  |i Electronic Resource  |j Online  |n 1 
856 4 0 |t 0  |u http://ezproxy.msu.edu/login?url=http://dx.doi.org/10.1017/CBO9780511574733  |y Connect to online resource - MSU authorized users