Bounds for the Perron Root of Irreducible Nonnegative Matrices
نویسندگان
چکیده
منابع مشابه
AN ALGORITHM FOR COMPUTING THE PERRON ROOT OF A NONNEGATIVE IRREDUCIBLE MATRIX by PRAKASH CHANCHANA
CHANCHAN, PRAKASH. An Algorithm for Computing the Perron Root of a Nonnegative Irreducible Matrix. (Under the direction of Carl D. Meyer.) We present a new algorithm for computing the Perron root of a nonnegative irreducible matrix. The algorithm is formulated by combining a reciprocal of the well known Collatz’s formula with a special inverse iteration algorithm discussed in [10, Linear Algebr...
متن کاملSome Lower Bounds for the Perron Root of a Nonnegative Matrix
In this paper, we present some lower bounds for the Perron root of a symmetric nonnegative matrix, which are then applied to give the lower bounds of the Perron root of a general nonnegative matrix. These bounds improve the corresponding ones in [3] and [5]. Numerical examples are supplemented to illustrate the effectiveness of the presented bounds. Mathematics subject classification (2010): 15...
متن کاملPerron Vectors of an Irreducible Nonnegative Interval Matrix
As is well known, an irreducible nonnegative matrix possesses a uniquely determined Perron vector. As the main result of this paper we give a description of the set of Perron vectors of all the matrices contained in an irreducible nonnegative interval matrix A. This result is then applied to show that there exists a subset A∗ of A parameterized by n parameters (instead of n2 ones in the descrip...
متن کاملNotes on the Perron-frobenius Theory of Nonnegative Matrices
By a nonnegative matrix we mean a matrix whose entries are nonnegative real numbers. By positive matrix we mean a matrix all of whose entries are strictly positive real numbers. These notes give the core elements of the Perron-Frobenius theory of nonnegative matrices. This splits into three parts: (1) the primitive case (due to Perron) (2) the irreducible case (due to Frobenius) (3) the general...
متن کاملHoffman Polynomials of Nonnegative Irreducible Matrices and Strongly Connected Digraphs
For a nonnegative n× n matrix A, we find that there is a polynomial f(x) ∈ R[x] such that f(A) is a positive matrix of rank one if and only if A is irreducible. Furthermore, we show that the lowest degree such polynomial f(x) with tr f(A) = n is unique. Thus, generalizing the well-known definition of the Hoffman polynomial of a strongly connected regular digraph, for any irreducible nonnegative...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2015
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v1n1p97