vol10_pp31-45. 200KB Jun 04 2011 12:05:50 AM
Teks penuh
Garis besar
Dokumen terkait
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.,
For a Hermitian matrix with its main block diagonal given, this paper shows how to choose the off-diagonal blocks such that the resulting matrix has the maximal and minimal
In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative matrix, the graph of whose specified entries is G , has a totally
In [10], the Laguerre and Hermite matrix polynomials are introduced as examples of right orthogonal ma- trix polynomial sequences for appropriate right matrix moment functionals
We then use the basic fact that all totally positive nonsingular square matrices are products of matrices with strictly positive diagonal entries, and all other entries zero aside
It is proved that a nonnegative matrix generated by a Soules matrix is a completely positive matrix with cp-rank equal to the rank..
The minimum rank problem is the problem of finding the smallest rank of a matrix in the set of symmetric matrices having the zero-nonzero pattern of off-diagonal entries described by
It is a classical result of Wigner that for an hermitian matrix with independent entries on and above the diagonal, the mean empirical eigenvalue distribution converges weakly to
