vol8_pp110-114. 98KB Jun 04 2011 12:06:16 AM
Teks penuh
Dokumen terkait
This mostly expository note surveys and recovers a lower bound for the number of distinct eigenvalues of real symmetric matrices associated with a graph.. The relation is
whether a specied real, symmetric matrix is a member of any of several closely related classes: the MMA-matrices; the inverse MMA-matrices; the strictly positive, positive
In Section 3 it is shown that the same situation holds for the nonnegative P0-matrix completion problem, that is, a pattern for n × n matrices that includes all diagonal positions
The problem of determining the multiplicities of an eigenvalue of a product of companion matrices appears in the study of Random Walks in a Periodic Environment (RWPE), a type of
In this note, we generalize the explicit formulae in [5] for the polar factors of nonsingular real square matrices of order 2, and obtain explicit formulae for polar factors of n − by
result and known Perron-Frobenius theory of eventually nonnegative matrices are used to establish an algorithm to determine whether a matrix is strongly eventually nonnegative (i.e.,
The class of symmetric real matrices having exactly one pos- itive eigenvalue will be denoted by B.. The class of positive matrices belonging to B will be denoted by A ;
This is a variant on the symmetric minimum rank problem for a simple graph , which asks for a determination of the minimum rank among all real symmetric matrices whose
