Matrices of sign-solvable linear systems:
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...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1995
|
| Schriftenreihe: | Cambridge tracts in mathematics
116 |
| Links: | https://doi.org/10.1017/CBO9780511574733 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xii, 298 Seiten) |
| ISBN: | 9780511574733 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511574733 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020621.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090522s1995||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511574733 | ||
| 100 | 1 | |a Brualdi, Richard A. | |
| 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-Ressource (xii, 298 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge tracts in mathematics |v 116 | |
| 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. | ||
| 700 | 1 | |a Shader, Bryan L. | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521105828 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521482967 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511574733 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511574733 |
|---|---|
| _version_ | 1827038448548052993 |
| adam_text | |
| any_adam_object | |
| author | Brualdi, Richard A. |
| author2 | Shader, Bryan L. |
| author2_role | |
| author2_variant | b l s bl bls |
| author_facet | Brualdi, Richard A. Shader, Bryan L. |
| author_role | |
| author_sort | Brualdi, Richard A. |
| author_variant | r a b ra rab |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01858nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511574733</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020621.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090522s1995||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511574733</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brualdi, Richard A.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matrices of sign-solvable linear systems</subfield><subfield code="c">Richard A. Brualdi, Bryan L. Shader</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 298 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in mathematics</subfield><subfield code="v">116</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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. </subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shader, Bryan L.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521105828</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521482967</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511574733</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511574733 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-19T15:54:03Z |
| institution | BVB |
| isbn | 9780511574733 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xii, 298 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in mathematics |
| spelling | Brualdi, Richard A. Matrices of sign-solvable linear systems Richard A. Brualdi, Bryan L. Shader Cambridge Cambridge University Press 1995 1 Online-Ressource (xii, 298 Seiten) txt c cr Cambridge tracts in mathematics 116 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. Shader, Bryan L. Erscheint auch als Druck-Ausgabe 9780521105828 Erscheint auch als Druck-Ausgabe 9780521482967 |
| spellingShingle | Brualdi, Richard A. Matrices of sign-solvable linear systems |
| title | Matrices of sign-solvable linear systems |
| title_auth | Matrices of sign-solvable linear systems |
| title_exact_search | Matrices of sign-solvable linear systems |
| title_full | Matrices of sign-solvable linear systems Richard A. Brualdi, Bryan L. Shader |
| title_fullStr | Matrices of sign-solvable linear systems Richard A. Brualdi, Bryan L. Shader |
| title_full_unstemmed | Matrices of sign-solvable linear systems Richard A. Brualdi, Bryan L. Shader |
| title_short | Matrices of sign-solvable linear systems |
| title_sort | matrices of sign solvable linear systems |
| work_keys_str_mv | AT brualdiricharda matricesofsignsolvablelinearsystems AT shaderbryanl matricesofsignsolvablelinearsystems |