• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Spectrally Arbitrary and Inertially Arbitrary Sign Pattern Matrices

Demir, Nilay Sezin 03 May 2007 (has links)
A sign pattern(matrix) is a matrix whose entries are from the set {+,-,0}. An n x n sign pattern matrix is a spectrally arbitrary pattern(SAP) 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(x). An n x n pattern A is an inertialy arbitrary pattern(IAP) if (r,s,t) belongs to the inertia set of A for every nonnegative triple (r,s,t) with r+s+t=n. Some elementary results on these two classes of patterns are first exhibited. Tree sign patterns are then investigated, with a special emphasis on 4 x 4 tridiagonal sign patterns. Connections between the SAP(IAP) classes and the classes of potentially nilpotent and potentially stable patterns are explored. Some interesting open questions are also provided.

Page generated in 0.0797 seconds