vol17_pp389-413. 273KB Jun 04 2011 12:06:00 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.,
Zhang (2010) proved inequalities between the spectral radius of Hadamard products of finite nonnegative matrices and the spectral radius of their ordinary matrix product.. We will
The Soules approach to the inverse eigenvalue problem for nonnegative symmetric matrices with n ≤ 5. A note on the eigenvalues of
Inverse eigenvalue problem, Symmetric stochastic matrix, Symmetric nonnegative matrix, Distance matrix.. AMS
In- deed, denoting the directed graph of T by D (see [2]), Perron-Frobenius theory (see [8]) gives more information on the spectrum of T , namely that the number of eigen- values
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has
For normal matrices in WPFn and those in WPFn for which the spectral radius is simple, we present approximating matrices that satisfy the strong P-F property and are polynomials
In this short note, we give a necessary and sufficient condition for a connected graph to be bipartite in terms of an eigenvector corresponding to its largest eigenvalue..
