東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Matrices of sign-solvable linear systems

Brualdi, Richard A.

Linked to FindBook

Google Book

Amazon

博客來

Matrices of sign-solvable linear systems

Record Type:	Electronic resources : Monograph/item
Title/Author:	Matrices of sign-solvable linear systems/ Richard A. Brualdi, Bryan L. Shader.
Author:	Brualdi, Richard A.
other author:	Shader, Bryan L.
Published:	Cambridge :Cambridge University Press, : 1995.,
Description:	xii, 298 p. :ill., digital ;24 cm.
Notes:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
[NT 15003449]:	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.
Subject:	Matrices. -
Online resource:	https://doi.org/10.1017/CBO9780511574733
ISBN:	9780511574733

Matrices of sign-solvable linear systems
Brualdi, Richard A.

Matrices of sign-solvable linear systems[electronic resource] /Richard A. Brualdi, Bryan L. Shader. - Cambridge :Cambridge University Press,1995. - xii, 298 p. :ill., digital ;24 cm. - Cambridge tracts in mathematics ;116. - Cambridge tracts in mathematics ;116..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

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.

ISBN: 9780511574733Subjects--Topical Terms:

516894
Matrices.

LC Class. No.: QA188 / .B79 1995

Dewey Class. No.: 512.9434

Matrices of sign-solvable linear systems
LDR:02184nmm a2200289 a 4500 001 2227158
003 UkCbUP
005 20151005020621.0
006 m d
007 cr nn 008maaau
008 210414s1995 enk o 1 0 eng d
020 $a 9780511574733 $q (electronic bk.)
020 $a 9780521482967 $q (hardback)
020 $a 9780521105828 $q (paperback)
035 $a CR9780511574733
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA188 $b .B79 1995
082 0 4 $a 512.9434 $2 20
090 $a QA188 $b .B886 1995
100 1 $a Brualdi, Richard A. $3 540188
245 1 0 $a Matrices of sign-solvable linear systems $h [electronic resource] / $c Richard A. Brualdi, Bryan L. Shader.
260 $a Cambridge : $b Cambridge University Press, $c 1995.
300 $a xii, 298 p. : $b ill., digital ; $c 24 cm.
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. $3 516894
700 1 $a Shader, Bryan L. $3 753027
830 0 $a Cambridge tracts in mathematics ; $v 116. $3 3470421
856 4 0 $u https://doi.org/10.1017/CBO9780511574733