In 1912, G. Frobenius [6] provided the following upper bound for the spectral radius of nonnegative matrices.

Similar documents
Some bounds for the spectral radius of the Hadamard product of matrices

arxiv: v1 [math.ra] 11 Aug 2014

Two Characterizations of Matrices with the Perron-Frobenius Property

A note on estimates for the spectral radius of a nonnegative matrix

H-matrix theory vs. eigenvalue localization

Abed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld. Report August 2009

First, we review some important facts on the location of eigenvalues of matrices.

Gershgorin type sets for eigenvalues of matrix polynomials

Z-Pencils. November 20, Abstract

Bounds for Levinger s function of nonnegative almost skew-symmetric matrices

Three Bounds on the Minimal Singular Value: A Comparison

ELA

Improved Upper Bounds for the Laplacian Spectral Radius of a Graph

An estimation of the spectral radius of a product of block matrices

R, 1 i 1,i 2,...,i m n.

SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY. February 16, 2010

Generalized Numerical Radius Inequalities for Operator Matrices

Applications of The Perron-Frobenius Theorem

Jordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

The spectrum of a square matrix A, denoted σ(a), is the multiset of the eigenvalues

A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES

BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION

POLYNOMIALS WITH A SHARP CAUCHY BOUND AND THEIR ZEROS OF MAXIMAL MODULUS

Matrix functions that preserve the strong Perron- Frobenius property

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices

Properties for the Perron complement of three known subclasses of H-matrices

Spectral Properties of Matrix Polynomials in the Max Algebra

Note on the Jordan form of an irreducible eventually nonnegative matrix

On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc

Permutation transformations of tensors with an application

Wavelets and Linear Algebra

Generalized Schur complements of matrices and compound matrices

Geometric Mapping Properties of Semipositive Matrices

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60

Block companion matrices, discrete-time block diagonal stability and polynomial matrices

Interpolating the arithmetic geometric mean inequality and its operator version

Generalized M-Matrices and Applications

Detailed Proof of The PerronFrobenius Theorem

On the Hermitian solutions of the

OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY

Sign patterns that allow eventual positivity

Vladimir Kirichenko and Makar Plakhotnyk

On the distance signless Laplacian spectral radius of graphs and digraphs

arxiv: v1 [math.co] 20 Sep 2014

Another algorithm for nonnegative matrices

Perron Frobenius Theory

ELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

ELA MATRIX FUNCTIONS PRESERVING SETS OF GENERALIZED NONNEGATIVE MATRICES

Integral Similarity and Commutators of Integral Matrices Thomas J. Laffey and Robert Reams (University College Dublin, Ireland) Abstract

Newcriteria for H-tensors and an application

642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.

Characterization of half-radial matrices

ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS

The eigenvalues of an n x n complex matrix A are the roots of the n th degree polynomial det(a-λi) = 0. Further the positive square roots of the

A NOTE ON CHECKING REGULARITY OF INTERVAL MATRICES

On the Least Eigenvalue of Graphs with Cut Vertices

Generalizations of M-matrices which may not have a nonnegative inverse

MATRIX SPLITTING PRINCIPLES

Given an n n matrix A, the spectrum of A is denoted by σ(a) and its spectral radius by

The upper Jacobi and upper Gauss Seidel type iterative methods for preconditioned linear systems

Maximizing the numerical radii of matrices by permuting their entries

On nonnegative realization of partitioned spectra

Trace Inequalities for a Block Hadamard Product

On cardinality of Pareto spectra

Computers and Mathematics with Applications. Convergence analysis of the preconditioned Gauss Seidel method for H-matrices

Section 3.9. Matrix Norm

On the spectral radius of graphs with cut edges

NOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES

Sparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University

The minimum rank of matrices and the equivalence class graph

Ann. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:

On families of anticommuting matrices

A note on polar decomposition based Geršgorin-type sets

arxiv: v3 [math.ra] 10 Jun 2016

J. Korean Math. Soc. 30 (1993), No. 2, pp. 267{274 INDICES OF IRREDUCIBLE BOOLEAN MATRICES Han Hyuk Cho 1.Introduction Let = f0 1g be the Boolean alge

Minimizing the Laplacian eigenvalues for trees with given domination number

The Solvability Conditions for the Inverse Eigenvalue Problem of Hermitian and Generalized Skew-Hamiltonian Matrices and Its Approximation

Linear Algebra and its Applications

Notes on Linear Algebra and Matrix Theory

On the simultaneous diagonal stability of a pair of positive linear systems

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.

ELA

Sufficiency of Signed Principal Minors for Semidefiniteness: A Relatively Easy Proof

v iv j E(G) x u, for each v V(G).

CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX

Applicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES

Sang Gu Lee and Jeong Mo Yang

Eventual Cone Invariance

BOUNDS FOR THE MAXIMAL CHARACTERISTIC ROOT OF A NON-NEGATIVE IRREDUCmLE MATRIX. R = max. r.,

Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices

ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES

The Perron eigenspace of nonnegative almost skew-symmetric matrices and Levinger s transformation

Linear Operators Preserving the Numerical Range (Radius) on Triangular Matrices

arxiv: v1 [math.na] 1 Sep 2018

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

MATH36001 Perron Frobenius Theory 2015

Transcription:

SIMPLIFICATIONS OF THE OSTROWSKI UPPER BOUNDS FOR THE SPECTRAL RADIUS OF NONNEGATIVE MATRICES CHAOQIAN LI, BAOHUA HU, AND YAOTANG LI Abstract AM Ostrowski in 1951 gave two well-known upper bounds for the spectral radius of nonnegative matrices However, the bounds are not of much practical use because they all involve a parameter α in the interval [0,1], and it is not easy to decide the optimum value of α In this paper, their equivalent forms which can be computed with the entries of matrix and without having to minimize the expressions of the bounds over all possible values of α [0,1], are given Key words Spectral radius, Ostrowski, Nonnegative matrices AMS subject classifications 15A18, 15A42, 15A48 1 Introduction AmatrixA = a ij ) R n n iscallednonnegativeifa ij 0for any i,j N = 1,2,,n The well-known Perron-Frobenius theorem [1, 6, 7, 15] states that the spectral radius ρa) of a nonnegative matrix A is the eigenvalue of A with a corresponding nonnegative eigenvector One important problem in nonnegative matrices is to estimate the spectral radius of a nonnegative matrix [2, 6, 8, 9, 10, 11, 12, 19] In 1912, G Frobenius [6] provided the following upper bound for the spectral radius of nonnegative matrices Theorem 11 [6, 18] Let A = a ij ) R n n be nonnegative Then 11) where R i A) = a ij j N ρa) max i N R ia), Since a matrix A and its transpose A T have the same eigenvalue [1], we have ρa) = ρa T ) Hence, for the nonnegative matrix A, we get from Theorem 11 that 12) ρa) max i N C ia), Received by the editors on September 3, 2013 Accepted for publication on March 10, 2014 Handling Editor: Daniel B Szyld School ofmathematics and Statistics, Yunnan University, Kunming, Yunnan, 650091, PRChina lichaoqian@ynueducn, 940395362@qqcom, liyaotang@ynueducn) Supported by National Natural Science Foundations of China 11361074 and 11326242) and the Natural Science Foundations of Yunnan Province of China 2013FD002) 237

238 CQ Li, BH Hu, and YT Li where = R i A T ) Combining inequality 11) with inequality 12) gives 13) ρa) minmax i N R ia),max i N C ia) Here, we call the bound in 13) the Frobenius upper bound for ρa) To estimate ρa) more precisely, many researchers gave some upper bounds [8, 9, 10, 11, 12], which are smaller than the Frobenius upper bound Particularly, in 1951 AM Ostrowski [13] gave the following well-known upper bound; also see [11] Theorem 12 [11, 13] Let A = a ij ) R n n be nonnegative Then for any α [0,1], that is, ρa) max i N R ia)) α ) 1 α, 14) ρa) min α [0,1] max i N R ia)) α ) 1 α Moreover, from the generalized arithmetic-geometric mean inequality [4]: αa+1 α)b a α b 1 α, where a,b 0 and 0 α 1, another upper bound is obtained easily Theorem 13 [13] Let A = a ij ) R n n be nonnegative Then for any α [0,1], that is, ρa) max i N αr ia)+1 α), 15) ρa) min α [0,1] max i N αr ia)+1 α) Although Ostrowski gave many well-known results, such as the bounds in [14], we here call the bounds in 14) and 15) the Ostrowski upper bounds for ρa) Note that when α = 0, and α = 1, max R ia)) α ) 1 α = max αr ia)+1 α) = max C ia), i N i N i N max R ia)) α ) 1 α = max αr ia)+1 α) = max R ia) i N i N i N

Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 239 Therefore, min maxr ia)) α ) 1 α min maxαr ia)+1 α) minmax i N R ia),max i N C ia), which implies that the Ostrowski upper bounds are smaller than the Frobenius upper bound However, they are not of much practical use because they all involve a parameter α and it is not easy to decide the optimum value of α Therefore, one often take some special α in practical, such as α = 1 2, 1 4, 3 4 and so on, but this leads to that the estimating is not good enough In this paper, we focus on the simplification problem of the Ostrowski upper bounds, and give their equivalent forms which do not include a minimization over all parameters α in the interval [0,1] Numerical examples are also given to verify the corresponding results 2 Main results In this section, we give equivalent forms of the Ostrowski upper bounds which do not include a minimization over all parameters α [0,1] First, we consider the Ostrowski upper bound min maxαr ia) + 1 α), and give a lemma as follows Lemma 21 Let A = a ij ) R n n be nonnegative Then there exists α [0,1] such that for all i N, 21) ρa) > αr i A)+1 α), if and only if the following two conditions hold: i) for any i N, 22) ρa) > minr i A),, ii) for any i Λ and any j, 23) ρa) R i A) > C ja) ρa) C j A) R j A), where Λ = i N : R i A) > and = j N : C j A) > R j A) Proof Let Ξ = i N : R i A) = Then N = Ξ Λ First, suppose that there exists α [0,1] such that inequality 21) holds for all i N, then for any i Λ, ρa) R i A) > α,

240 CQ Li, BH Hu, and YT Li and for any j, α > C ja) ρa) C j A) R j A) Therefore, for any i Λ and any j, inequality 23) holds Furthermore, from α [0,1] it is easy to get that inequality 22) holds for any i N Conversely, suppose that the conditions i) and ii) hold Obviously, inequality 21) always holds for each i Ξ Thus, it remains to prove that inequality 21) holds for all i Λ and all j 24) For each i Λ, we have R i A) > 0 and ρa) > 0 Therefore, ρa) R i A) > 0 And for each j, we have C j A) R j A) > 0, ρa) R j A) > 0, and which implies 25) C j A) R j A) > C j A) ρa), C j A) ρa) C j A) R j A) < 1 Combining inequality 23), inequality 24) with inequality 25) gives that there exists α [0,1] such that for all i Λ and all j, C j A) ρa) ρa) Ci A) 26) max 0, < α < min C j A) R j A) R i A),1 By inequality 26), we have that for any i Λ, α < ρa) C ia) R i A), that is, ρa) > αr i A)+1 α), and that for any j, C j A) ρa) C j A) R j A) < α, that is, ρa) > αr j A) +1 α)c j A) Therefore, there exists α [0,1] such that inequality 21) holds for all i N The proof is completed According to Lemma 21, we can obtain the equivalent form of the Ostrowski upper bound min maxαr ia)+1 α) Theorem 22 Let A = a ij ) R n n be nonnegative Then ρa) max i N minr ia),,

or That is, 27) ρa) max Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 241 ρa) max i Λ, j R i A)C j A) R j A) R i A) +C j A) R j A) max minria),cia),max R ia)c ja) C ia)r ja) i N i Λ, R j ia) C ia)+c ja) R ja) Proof Suppose on the contrary that ρa) > max or equivalently, and max minr ia),,max i N i Λ, j ρa) > max i Λ, j ρa) > max i N minr ia), This implies respectively that for any i N, and that for any i Λ and any j, ρa) > R i A)C j A) R j A), R i A) +C j A) R j A) R i A)C j A) R j A) R i A) +C j A) R j A) ρa) > minr i A),, R i A)C j A) R j A) R i A) +C j A) R j A) Furthermore, by Lemma 21, there exists α [0,1] such that for all i N, that is, ρa) > αr i A)+1 α), ρa) > max i N αr ia)+1 α) which contradicts to Theorem 13 The conclusions follows Next, we prove that the bound in inequality 27) is equivalent to the Ostrowski upper bound min maxαr ia)+1 α) Theorem 23 Let A = a ij ) R n n be nonnegative Then =max min maxαr ia)+1 α) max minr R i A)C j A) R j A) ia),,max i N i Λ, R j i A) +C j A) R j A)

242 CQ Li, BH Hu, and YT Li Proof First we prove that if inequality 15) holds, then inequality 27) holds This implies that 28) max In fact, if ρa) > max min maxαr ia)+1 α) max minr R i A)C j A) R j A) ia),,max i N i Λ, R j i A) +C j A) R j A) max minr R i A)C j A) R j A) ia),,max, i N i Λ, R j i A) +C j A) R j A) then by the proof of Theorem 22, there exists α [0,1] such that for all i N, This gives ρa) > max i N αr ia)+1 α) ρa) > min α [0,1] max i N αr ia)+1 α) This is a contradiction to inequality 15) Hence, inequality 28) holds We now prove that if inequality 27) holds, then inequality 15) holds, which implies that max max minr R i A)C j A) R j A) 29) ia),,max i N i Λ, R j i A) +C j A) R j A) min maxαr ia)+1 α) In fact, if ρa) > min α [0,1] max i N αr ia)+1 α), that is, there exists α [0,1] such that for all i N, ρa) > max i N αr ia)+1 α) αr i A)+1 α), then by Lemma 21 and the proof of Theorem 22, we have ρa) > max max minr ia),,max i N i Λ, j R i A)C j A) R j A) R i A) +C j A) R j A)

Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 243 This is a contradiction to inequality 27) Hence, inequality 29) holds The conclusion follows from inequality 28) and inequality 29) Remark 24 From Theorem 23, we know that Theorem 22 provides an equivalent form of the Ostrowski upper bound min maxαr ia) +1 α) Obviously, this form only relates to the entries of A and has nothing to do with α, and hence, it is much easier to estimate the spectral radius of nonnegative matrices Similarly, we can obtain easily the equivalent form of the Ostrowski upper bound min maxr ia)) α ) 1 α Lemma 25 Let A = a ij ) R n n be nonnegative Then there exists α [0,1] such that for all i N, ρa) > R i A)) α ) 1 α, if and only if the following two conditions hold: i) for any i N, ρa) > minr i A),, ii) for any i Λ, 0 and any j, R j A) 0, 210) log R i A) ρa) > log C j A) C j A) R j A) ρa) Proof Similar to the proof of Lemma 21, the conclusion follows easily Lemma 26 Let A = a ij ) R n n be nonnegative Then for any i Λ, 0 and any j, R j A) 0, inequality 210) holds if and only if ρa) > C j A) Cj A) R j A) ) logri A) ) 1 C C ia) j A) 1+log Ri A) R j A) that is, Proof Inequality 210) is equivalent to log R i A) ρa) log R i A) > log C j A) R j A) C j A) log C j A) ρa), R j A) 211) log R i A) ρa)+log C j A) R j A) ρa) > log R i A) +log C j A) C j A) R j A)

244 CQ Li, BH Hu, and YT Li Note that i Λ and j, then RiA) C > 1, C ja) ia) R > 1 and log C ja) ja) R i A) R > 0 ja) Therefore, inequality 211) holds if and only if or equivalently, log R i A) ρa) that is, log R i A) ρa)+ 1+log R i A) log R i A) log R i A) ρa) > 212) = log R i A) log R i A) ρa) C log ja) R i A) R ja) ) C j A) R j A) > log R i A) + log R i A) C j A), C log ja) R i A) R ja) C j A) > log R i A) log R i A) Cj A) = log R i A) = log R i A) C j A) 1+log R i A) C j A) CjA) R ja) R j A) C j A) ) log Ri A) C ) ia) C ja) R ja) Cj A) R j A) Since RiA) C ia) > 1, Then inequality 212) is equivalent to ρa) > The proof is completed C j A) Cj A) R j A) ) ) log Ri A) C ia) R j A) +log R i A) C j A) +log R i A) C j A) ) ) logri A) C Cj A) ia), R j A) ) logri A) C ) 1+log ia) Ri A) C i A) ) logri A) C ) 1+log ia) Ri A) C i A) ) 1 C j A) R j A) ) 1 C j A) R j A) Similar to the proof of Theorems 22 and 23, we can obtain easily the following theorems from Lemmas 25 and 26 or Theorem 27 Let A = a ij ) R n n be nonnegative Then ρa) ρ 1 = max i Λ, 0, j,r j A) 0 ρa) max i N minr ia),, C j A) Cj A) R j A) ) logri A) C ) 1+log ia) Ri A) C i A) ) 1 C j A) R j A)

Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 245 That is, 213) ρa) max max minr ia),,ρ 1 i N Theorem 28 Let A = a ij ) R n n be nonnegative Then min maxr ia)) α ) 1 α = max max minr ia),,ρ 1, i N where ρ 1 is defined as in Theorem 27 Remark 29 Theorem 27 provides an equivalent form of the Ostrowski upper bound min maxr ia)) α ) 1 α However, it is determined with more diffi- cultly than that in Theorem 22 because of computing log R i A) or log R i A) C ja) R ja) difficultly So in general we estimate the spectral radius of nonnegative matrices by Theorem 22 3 Numerical comparisons Besides the Frobenius bound and the Ostrowski bounds, there are another results on upper bounds for the spectral radius of nonnegative matrices [2, 3, 5, 8, 11, 12, 16, 17] We now list some of the well-known bounds, and compare with the bound in Theorem 22 In 1964, Derzko and Pfeffer [5] provided an upper bound for the spectral radius of complex matrices, which is also used to estimate the spectral radius of a nonnegative matrix A = a ij ) R n n 31) ρa) ǫa) 2 )1 ) 2 2 max R i A), i N where ǫa) = 32) a 2 ij i,j N ρa) 1 2 max j i )1 ) )1 2 2, Ri A) = a 2 ij a 2 ii j N In 1974, Brauer and Gentry [2] derived the following bound: a ii +a jj + a ii a jj ) 2 +4R ia)r ja) where R i A) = R ia) a ii and = R i A T ) ) 1) 2 In 1994, Rojo and Jiménez [16] obtained the following decreasing sequence of upper bounds:, 33) ρa) v k A) v 2 A) v 1 A),

246 CQ Li, BH Hu, and YT Li where v p A) = tracea) n γ p A) = and MA) = A+AT 2 +γ p A), n 1) 2p 1 n 1) 2p 1 +1 trace MA) tracea) ) ) 1 2p 2p I n In 1998, Taşçi and Kirkland [17] obtained another sequence of upper bounds based on an arithmetic symmetrization of powers of A: 34) where σ k = )) 2 k ρ MA 2k ) ρa) σ k σ 2 σ 1, In 2006, Kolotilina [11] provided the following bound: 35) Ri ρa) max A) α R j A) 1 α) β Ci A) α C j A) 1 α) 1 β, i,j:a ij 0 where 0 α,β 1 In 2012, Melman [12] derived an upper bound for the spectral radius, that is, ρa) 1 2 maxmin a ii +a jj +R ija)+a ii a jj +R ija)) 2 +4a ij R ja)) 1 2, i N j i 36) where R ij A) = R i A) a ij = R i A) a ii a ij Very recently, Butler and Siegel [3] obtained the following upper bound for the spectral radius of nonnegative matrices with nonzero row sums 37) ρa) max i,j N Ri A K+P )R j A K+Q ) R i A K )R j A K ) ) 1 P+Q : a P) ij > 0, where a P) ij is the i,j) entry of A P, P > 0, Q 0 and K 0 We now give some numerical examples to compare the Ostrowski upper bound min maxαr ia)+1 α), or equivalently, the bound in Theorem 22 with the listed bounds Example 31 Let A = a ij ) R n n with n 2, where a ij = i+j n i+j

Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 247 Obviously, A is nonnegative We compute by Matlab 70 the Frobenius upper bound, the bounds in 31), 32), 33), 34), 35), 36), 37), and the Ostrowski upper bound min maxαr ia)+1 α), ie, the bound in 27), which are showed in Table 1 n 20 50 100 200 the Frobenius upper bound 591503 1839587 4291125 9873623 the bound in 31) 353673 968358 2075647 4433573 the bound in 32) 507089 1604870 3800033 8866063 the bound in 33) 350224 922129 1923634 4010254 the bound in 34) 273319 670738 1333430 2659199 the bound in 35) 306872 821932 1740878 3682669 the bound in 36) 475346 1510051 3583530 8379700 the bound in 37) 349409 886291 1782934 3577011 the Ostrowski upper bound 434386 1281360 2888136 6452955 ρa) 254223 621346 1233112 2456604 Table 1 Comparison of the bounds for the nonnegative matrix in Example 31 Example 32 Let A = 1 1 0 0 2 1 4 1 3 The bounds are showed in Table 2 the Frobenius upper bound 5 the bound in 31) 48214 the bound in 32) 43723 the bound in 33) 48868 the bound in 34) 44001 the bound in 35) 44267 the bound in 36) 42361 the bound in 37) 46104 the Ostrowski upper bound 45714 ρa) 40946 Table 2 Comparison of the bounds for the nonnegative matrix in Example 32 Example 33 Let A = 1 1 0 0 2 2 4 2 3

248 CQ Li, BH Hu, and YT Li By computation, the Ostrowski upper bound is 5, and the bounds in 34) and 35) are 51938 and 54772, respectively In fact, ρa) = 5 Remark 34 I) In Examples 31, 32 and 33, the bounds in 33), 34) are givenbyv 1 A) andσ 1 A), respectively And the bound in 35) is givenforα = β = 1 For the bound in 37), we compute its value for K = P = Q = 1 in Example 31, and for P = 2, K = Q = 1 in Example 32 II) From Examples 31 and 32, we have that the Ostrowski upper bound is smaller than the Frobenius upper bound, smaller than the bounds in 31), 32), 33), 36), and 37) in some cases III) Example 33 shows that the Ostrowski upper bound is smaller than the bounds in 34) and 35), and that the Ostrowski upper bound is sharp Acknowledgment The authors are grateful to the referees for their useful and constructive suggestions REFERENCES [1] A Berman and RJ Plemmons Nonnegative Matrices in the Mathematical Sciences Academic Press, New York, 1979 [2] A Brauer and IC Gentry Bounds for the greatest characteristic root of an irreducible nonnegative matrix Linear Algebra Appl, 8:105 107, 1974 [3] BK Butler and PH Siegel Sharp bounds on the spectral radius of nonnegative matrices and digraphs, Linear Algebra Appl, 439:1468 1478, 2013 [4] LC Cvetković, V Kostić, R Bru, and F Pedroche A simple generalization of Geršgorin s theorem Adv Comput Math, 35:271 280, 2011 [5] NA Derzko and AM Pfeffer Bounds for the spectral radius of a matrix Math Comp, 19:62 67, 1965 [6] G Frobenius über Matrizen aus nicht negativen Elementen Sitz ber Preuss AkadWiss Berl, 456 477, 1912 [7] RA Horn and CR Johnson Matrix Analysis Cambridge University Press, Cambridge, 1985 [8] LY Kolotilina Bounds and inequalities for the Perron root of a nonnegative matrix Zap Nauchn Semin POMI), 284:77 122, 2002 [9] LY Kolotilina Bounds and inequalities for the Perron root of a nonnegative matrix II Circuit bounds and inequalities Zap Nauchn Semin POMI), 296:60 88, 2003 [10] LY Kolotilina Bounds and inequalities for the Perron root of a nonnegative matrix III Bounds dependent on simple paths and circuits Zap Nauchn Semin POMI), 323:69 93, 2005 [11] LY Kolotilina Bounds for the Perron root, singularity/nonsingularity conditions, and eigenvalue inclusion sets Numer Algor, 42:247 280, 2006 [12] A Melman Upper and lower bounds for the Perron root of a nonnegative matrix Linear Multilinear Algebra, 61:171 181, 2013 [13] AM Ostrowski Über das nichtverschwinden einer klasse von determinanten und die lokalisierung der characterisrichen wurzeln von matrizen Compos Math, 9:209 226, 1951

Simplifications of the Ostrowski Upper Bounds for the Spectral Radius 249 [14] AM Ostrowski Bounds for the greatest latent roots of a positive matrix J London Math Soc, 27:254 256, 1952 [15] O Perron Zur theorie der matrizen Math Ann, 64:248 263, 1907 [16] O Rojo and R Jiménez A decreasing sequence of upper bounds for the perron root Comput Math Appl, 28:9 15, 1994 [17] D Taşçi and S Kirkland A sequence of upper bounds for the perron root of a nonnegative matrix Linear Algebra Appl, 273:23 28, 1998 [18] RS Varga Geršgorin and His Circles Springer Series in Computational Mathematics, Springer, Berlin, 2004 [19] RJ Wood and MJ O Neill Finding the spectral radius of a large sparse non-negative matrix ANZIAM J, 48:330 345, 2007