Spectrally Arbitrary Tree Sign Pattern Matrices
A sign pattern (matrix) is a matrix whose entries are from the set {+,–, 0}. A sign pattern matrix A is a spectrally arbitrary pattern if for every monic real polynomial p(x) of degree n there exists a real matrix B whose entries agree in sign with A such that the characteristic polynomial of B is p...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Archive @ GSU
2006
|
| Subjects: | |
| Online Access: | http://digitalarchive.gsu.edu/math_theses/17 http://digitalarchive.gsu.edu/cgi/viewcontent.cgi?article=1016&context=math_theses |