Eventually nonnegative matrices are similar to seminonnegative matrices
نویسندگان
چکیده
منابع مشابه
Eventually Nonnegative Matrices and their Sign Patterns
A matrix A ∈ Rn×n is eventually nonnegative (respectively, eventually positive) if there exists a positive integer k0 such that for all k ≥ k0, A ≥ 0 (respectively, A > 0). Here inequalities are entrywise and all matrices are real and square. An eigenvalue of A is dominant if its magnitude is equal to the spectral radius of A. A matrix A has the strong Perron-Frobenius property if A has a uniqu...
متن کاملSpectral Properties of Reducible Nonnegative and Eventually Nonnegative Matrices
Let η = (η1, η2, . . . , ηt) and ν = (ν1, ν2, . . . , νt) be two sequences of nonnegative integers. (Append zeros if necessary to the end of the shorter sequence so that they are the same length.) We say that ν is majorized by η if ∑j l=1 νl ≤ ∑j l=1 ηl for all 1 ≤ j ≤ t and tl=1 νl = ∑t l=1 ηl. We write ν 1 η. Let Γ = (V,E) be a graph where V is a finite vertex set and E ⊆ V ×V is an edge set....
متن کاملEla M ∨ - Matrices : a Generalization of M - Matrices Based on Eventually Nonnegative Matrices
An M ∨-matrix has the form A = sI − B, where s ≥ ρ(B) ≥ 0 and B is eventually nonnegative; i.e., B k is entrywise nonnegative for all sufficiently large integers k. A theory of M ∨-matrices is developed here that parallels the theory of M-matrices, in particular as it regards exponential nonnegativity, spectral properties, semipositivity, monotonicity, inverse nonnegativity and diagonal dominance.
متن کاملMv-matrices: a generalization of M-matrices based on eventually nonnegative matrices
An M∨ matrix has the form A = sI − B, where s ≥ ρ(B) ≥ 0 and B is eventually nonnegative; i.e., Bk is entrywise nonnegative for all sufficiently large integers k. A theory of M∨ matrices is developed here that parallels the theory of M-matrices, in particular as it regards exponential nonnegativity, spectral properties, semipositivity, monotonicity, inverse nonnegativity and diagonal dominance.
متن کاملWhich Nonnegative Matrices Are Slack Matrices?
In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2004
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.11.021