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

Size: px
Start display at page:

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

Transcription

1 Linear Algebra and its Applications 360 (003) The Perron eigenspace of nonnegative almost skew-symmetric matrices and Levinger s transformation Panayiotis J. Psarrakos a, Michael J. Tsatsomeros b, a Department of Mathematics, National Technical University, Zografou Campus, Athens 15780, Greece b Mathematics Department, 107 Neill Hall, Washington State University, Pullman, WA , USA Received 18 March 00; accepted 4 April 00 Submitted by C.-K. Li Abstract Let A be a nonnegative square matrix whose symmetric part has rank one. Tournament matrices are of this type up to a positive shift by 1/I. When the symmetric part of A is irreducible, the Perron value and the left and right Perron vectors of L(A, α) = (1 α)a + αa t are studied and compared as functions of α [0, 1/]. In particular, upper bounds are obtained for both the Perron value and its derivative as functions of the parameter α via the notion of the q-numerical range. 00 Elsevier Science Inc. All rights reserved. AMS classification: 15A18; 15A4; 15A60; 05C0 Keywords: Almost skew-symmetric matrix; Perron value; Perron vector; Levinger s transformation; q-numerical range; Tournament 1. Introduction An almost skew-symmetric matrix is a square matrix whose symmetric part has rank one. The initial interest in almost skew-symmetric matrices can be largely attributed to their association with tournament matrices; indeed, if T is a (0,1)-tournament matrix, i.e., T + T t = J I, wherej is the all ones matrix, then T + 1/I is a nonnegative almost skew-symmetric matrix. The discovery that the eigenvalues of Corresponding author. addresses: tsat@math.wsu.edu (M.J. Tsatsomeros), ppsarr@math.ntua.gr (P.J. Psarrakos) /03/$ - see front matter 00 Elsevier Science Inc. All rights reserved. PII: S (0)

2 44 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) almost skew-symmetric matrices satisfy interesting inequalities forced upon by their structure [4,5,11] is sustaining the interest in these matrices and their properties. In this paper, we consider an entrywise nonnegative almost skew-symmetric matrix A and study the spectral radius of L(A, α) = (1 α)a + αa t as a function of α [0, 1/]. The affine transformation (1 α)a + αa t and, in particular, its spectral radius when A is nonnegative were initially considered by Levinger [7], who showed that the spectral radius is non-decreasing in [0, 1/]. We thus refer to L(A, α) as Levinger s transformation. This result, re-proved and extended by Fiedler [,3], is regarded as one of the few results on the behavior of the spectral radius as a function of matrix elements and has proven useful in many instances. More recently, use of Levinger s transformation is made in [11] in order to study the spectrum of general almost skew-symmetric matrices. In addition, L(A, α) is used to study the shape of the numerical range of nonnegative matrices [10]. It appears that Levinger s transformation is a piece of many puzzles and so we are motivated to continue studying its role. Here, we do it in the context of nonnegative almost skew-symmetric matrices with irreducible symmetric parts. Specifically, we study the rate of change of the spectral radius of L(A, α) as a function of α,aswell as the behavior of the corresponding left and right (Perron) eigenvectors.. Preliminaries Let x,y R n. We call x a unit vector if its Euclidean norm x = 1. The angle between two nonzero vectors x and y is defined to be ( x,y) = cos 1 x t y x y and is measured in [0, π]. Consider an n n real matrix A (denoted by A M n (R)). The spectrum of A is denoted by σ and its spectral radius by ρ = max{ λ : λ σ }. Recall that A can be written as A = S + K, where S = A + At and K = A At are the (real) symmetric part and the (real) skew-symmetric part of A, respectively. We define Levinger s transformation of A by L(A, α) = (1 α)a + αa t, α [0, 1/] and Levinger s function by φ(a,α) = ρ(l(a, α)) = ρ((1 α)a + αa t ), α [0, 1/]. (.1) Notice that the analysis of Levinger s function in [0, 1/] extends naturally to [1/, 1] as L(A, α) t = L(A, 1 α). One can also see that

3 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) L(A, 0) = A, L(A, 1/) = S and that for every α (0, 1/), L(A, α) = S + (1 α)k. Suppose now that A is entrywise nonnegative (denoted by A 0). Then S 0. Moreover, suppose S is of rank one. This means that σ (S) consists of the eigenvalue 0 with multiplicity n 1 and a simple eigenvalue δ. By the Perron Frobenius theorem (see e.g. [1]), δ = ρ(s) > 0. It follows that there is a nonzero nonnegative vector w R n such that S = ww t and δ = w t w. We refer to a matrix A having the above features as a nonnegative almost skewsymmetric matrix and assume the reader recalls the above associated notation. The variance of a nonnegative almost skew-symmetric matrix A is var = Kw w = wt (K t K)w w t. w Note that the variance of L(A, α) is given by var(l(a, α)) = (1 α) var. It is also clear that φ(a,0) = ρ and φ(a,1/) = ρ(s) = δ. Some more terminology is in order for a nonnegative matrix X (for details and general background see [1]). We refer to ρ(x) σ(x) as the Perron root of X. Recall that X is irreducible if its directed graph is strongly connected or, equivalently, if it cannot be symmetrically permuted to a block upper triangular matrix having non-vacuous, square diagonal blocks. When X is irreducible, the Perron Frobenius theorem states that ρ(x) is a simple eigenvalue. In this case, we denote the corresponding unit right and left eigenvectors of X by x r (X) and x l (X), and refer to them as the unit right Perron vector and the unit left Perron vector, respectively. Let us now assume that A is nonnegative almost skew-symmetric and that S = ww t is irreducible. As S 0, we have that w must be a strictly positive vector and thus S is a strictly positive matrix. It follows that all L(A, α) (α (0, 1)) are also strictly positive (and thus irreducible) almost skew-symmetric matrices. As a consequence, φ(a,α) is a simple eigenvalue and thus the rightand left unitperron vectors of L(A, α) are well defined; in particular notice that x r (L(A, 1/)) = x l (L(A, 1/)) = x r (S) = x l (S) = w/ w. In addition, when S is irreducible, φ(a,α) is a differentiable function of α (0, 1). These facts underlie most of our statements in Sections 3 and 4. Example.1. This example illustrates the above definitions and that S being irreducible is indeed an assumption weaker than A being irreducible, even for nonnegative almost skew-symmetric matrices. The matrix

4 46 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) A = is a reducible nonnegative almost skew-symmetric matrix with K = and S = ww t, where w = It satisfies δ = 3andvar = 8/3. As S is irreducible, the main results herein apply to this matrix A. We proceed with a brief mention of some results from [11] that are relevant to our discussion. Notice that they apply to skew-symmetric matrices that are not necessarily nonnegative; in [11] an almost skew-symmetric matrix is by definition a matrix A whose symmetric part has rank one and δ > 0. Theorem.. Let A M n (R) be an almost skew-symmetric matrix and λ an eigenvalue of A. Then (Im λ) Re λ (δ Re λ) [var + Re λ(re λ δ)]. (.) Prompted by the above theorem, the shell of an almost skew-symmetric matrix A is defined in [11] as the curve in the complex plane given by { Γ = x + iy C : x,y R and ( )} var y = (δ x) + x δ. x By Theorem., Γ yields a localization of the spectrum of A, as specified by (.). The various possible configurations of the shell of an almost skew-symmetric matrix and how to achieve them via Levinger s transformation are illustrated in the next example. Example.3. We have taken a 5 5 almost skew-symmetric matrix A with δ =.6636 and variance var =.419, and found the almost skew-symmetric matrices B = L(A, 0.07) and C = L(A, 0.1) having variances var(b) = and var(c) = Of course, δ(b) = δ(c) = Their shells are shown in Fig. 1, where the eigenvalues of each matrix are marked with s. The shell Γ is connected and all the eigenvalues of A are located in the region between Γ and the imaginary axis. The shell Γ(C) consists of one bounded and one unbounded branch. The bounded branch surrounds a real eigenvalue of C and the unbounded branch isolates the rest of the spectrum. The shell of B is the transition in a continuous transformation from the connected shell to the shell with two branches.

5 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Fig. 1. The shells Γ, Γ(B) and Γ(C). When A is almost skew-symmetric, applying Theorem. to L(A, α), whichis also almost skew-symmetric, the following can be shown [11]. Proposition.4. Let A M n (R) be an almost skew-symmetric matrix. Then for every α [0, 1/] such that δ > 4(1 α) var, the matrix L(A, α) has a real eigenvalue λ(a, α) δ + δ 4(1 α) var and n 1 complex eigenvalues whose real parts are not greater than δ δ 4(1 α) var. We conclude with an outline of our results to follow. In Section 3, we obtain bounds for the angles between the vectors w, x r (L(A, α)) and x l (L(A, α)) for appropriate values of α [0, 1/]. In Section 4, using the notion of q-numerical range and a result in [3], we construct an upper bound for the derivative of Levinger s function in (.1), which, in turn, yields an upper bound for φ(a,α). Finally, an illustrative example is presented in Section Right and left Perron vectors of L(A, α) Let A M n (R) be an irreducible nonnegative almost skew-symmetric matrix with symmetric part S = ww t. Then there exists an orthonormal basis of C n, {v 1,v,...,v n 1,w/ w }, where v 1,v,...,v n 1 Ker S and w/ w is the unit eigenvector of S corresponding to the eigenvalue δ = w t w. For any α [0, 1/], consider the unit right and left Perron vectors of L(A, α) and decompose them as x r (α) = y r (α) + z r (α) (3.1) and x l (α) = y l (α) + z l (α), (3.) where y r (α), y l (α) span {v 1,v,...,v n 1 } and z r (α), z l (α) span{w}.

6 48 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Proposition 3.1. Let A M n (R) be an irreducible nonnegative almost skew-symmetric matrix. Then for every α [0, 1/], Levinger s function satisfies φ(a,α) = δ z r (α) = δ z l(α), where z r (α) and z l (α) are defined in (3.1) and (3.), respectively. Proof. It is enough to obtain that φ(a,α) = δ z r (α). The proof of the equality φ(a,α) = δ z l (α) is similar. Since the eigenvector x r(α) of L(A, α) in (3.1) is unit, it follows that Hence, φ(a,α) = x r (α) t L(A, α)x r (α). φ(a,α)= x r (α) t (S + (1 α)k)x r (α) = (y r (α) t + z r (α) t )S(y r (α) + z r (α)) + (1 α)x r (α) t Kx r (α) = z r (α) t Sz r (α) + (1 α)x r (α) t Kx r (α) = δ z r (α) + (1 α)x r(α) t Kx r (α). Note that φ(a,α) R and the matrix K is skew-symmetric. Thus, x r (α) t Kx r (α) = 0 and consequently, φ(a,α) = δ z r (α). Corollary 3.. Let A M n (R) be an irreducible nonnegative almost skew-symmetric matrix. Then for every α [0, 1/], the right and left Perron vectors of L(A, α) have the same orthogonal projection onto w, i.e., z r (α) = z l (α). Moreover, Levinger s function satisfies ( w t ) x r (α) ( w t ) x l (α) φ(a,α) = δ = δ. w w Proof. From Proposition 3.1, it follows that for every α [0, 1/], the vectors z r (α) and z l (α) have the same modulus. Also, since the Perron vectors x r (α) and x l (α) are nonnegative, and since z r (α) (resp., z l (α)) is the orthogonal projection of x r (α) (resp., x l (α)) onto the vector w, the claimed expression for φ(a,α) follows readily, as well as that cos (w, x r (α)) = cos( w, x l (α)) or, equivalently, ( w, x r (α)) = ( w, x l (α)). The latter equality and as z r (α) = z l (α), implies that z r (α) = z l (α).

7 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Remark 3.3. Note that Proposition 3.1 and Corollary 3. hold for α (0, 1/] when the assumption of irreducibility of A is relaxed to irreducibility of the symmetric part of A. We will now apply the results in [11] in order to investigate the behavior of the Perron vectors of L(A, α). First, define the interval X A = max 0, 1 δ 16 var, 1 (3.3) and observe that α (0, 1/] lies in X A if and only if δ > 4(1 α) var. Notice also that since 0 / X A, if the symmetric part of A is irreducible, then for every α X A, L(A, α) is irreducible. Theorem 3.4. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part. Then for every α X A, the cosine of the angle ( w, x r (α)) = ( w, x l (α)) is greater than or equal to the quantity 1 R A = + δ 4(1 α) var 4δ. Proof. We prove that cos( w, x r (α)) R A.Foranyα X A, by Proposition.4, φ(a,α) δ + δ 4(1 α) var. Hence, by Corollary 3. applied to L(A, α), it follows that δ(w t x r (α)) w or, equivalently, w t x r (α) w δ + δ 1 + Since the vector x r (α) is unit, it is clear that cos( w, x r (α)) 1 + δ 4(1 α) var 4δ δ 4(1 α) var 4δ. δ 4(1 α) var 4δ. Remark 3.5. These remarks refer to the above theorem. (i) The following interpretation of var is possible. For any α X A, define the angle ϑ A (α) [0, π/4] such that

8 50 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) cos ϑ A (α) = R A = + δ 4(1 α) var 4δ. (3.4) Consider now α varying in X A, starting from 1/ and taking values toward the left endpoint of X A.ThenthePerronvectorsx r (α) and x l (α) of L(A, α) lie in the cone K A (α) ={u R n : 0 (ŵ, u) ϑ A (α)}, which contains w. Notice that the smaller var is, the slower K A (α) dilates, and the slower x r (α) and x l (α) dilate away from w. (ii) For α = 1/, we have 1 1 = cos 0 = cos(ŵ, w) + δ 4δ = 1. Notice also that for every α X A, the angle ( w, x r (α)) = ( w, x l (α)) is not greater than π/4. Theorem 3.4 also allows us to estimate apriorithe angle between x r (α) and x l (α) and subsequently the Euclidean distance between these two vectors for any α X A. Theorem 3.6. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part. Then for every α X A, cos( x r (α), δ x l (α)) 4(1 α) var δ. Proof. With ϑ A (α) as defined in (3.4) and for the angles ( x r (α), x l (α)), ( w, x r (α)) and ( w, x l (α)), we have ( x r (α), x l (α)) ( w, x r (α)) + ( w, x l (α)) ϑ A (α) π. Thus, cos( x r (α), x l (α)) cos(ϑ A (α)) 0, where cos(ϑ A (α)) = cos ϑ A (α) 1 δ = 4(1 α) var δ. Corollary 3.7. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part. Then for every α X A, the Perron vectors x r (α) and x l (α) satisfy

9 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) x r (α) x l (α) 1 δ 4(1 α) var δ. Proof. Since the vectors x r (α) and x l (α) are unit, one can see that x r (α) x l (α) = (x r(α) t x l (α) t )(x r (α) x l (α)) = cos( x r (α), x l (α)). Hence, by the above theorem, x r (α) x l (α) δ 4(1 α) var δ. 4. Bounds for Levinger s function and its derivative Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part, and recall Levinger s function φ(a,α) = ρ(l(a, α)) = ρ((1 α)a + αa t ), α [0, 1/] and the interval X A (0, 1/] defined in (3.3). Proposition.4 applied to A, and since then λ(a, α) = φ(a,α), yields a lower bound on Levinger s function. In this section, we focus on upper bounds for φ(a,α) and for the rate of change of φ(a,α) as a function of α. The rate of change of Levinger s function has been studied systematically by Fiedler [3]. By the proof of [3, Theorem 1., p. 176], we have that for every α (0, 1/), 0 φ (A, α) = 1 x l (α) t (L(A, α) t L(A, α))x r (α) 1 α x l (α) t x r (α) = x l(α) t Kx r (α) cos( x r (α), x l (α)). (4.1) This expression for φ (A, α) will lead us to an upper bound for φ (A, α) that depends on var and δ; it is contained in Theorem 4.1. Subsequently, this upper bound will be used to obtain an upper bound for φ(a,α). To begin, by (4.1) and our Theorem 3.6, it follows that for every α X A \{1/}, 0 φ (A, α) ( xl (α) t Kx r (α) ), (4.) q(α) where q(α) = δ 4(1 α) var δ. (4.3)

10 5 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) At this point, it is necessary to introduce the notion of q-numerical range of an n n complex matrix N for a real q [0, 1], that is, F q (N) ={x Ny C : x,y C n,x x = y y = 1andx y = q} { x = N y } C : x,y C n \{0} and cos( x,y) = q. x y For q = 1,F q (N) coincides with the classical numerical range F(N) F 1 (N) ={x Nx C : x C n and x x = 1}. The q-numerical range F q (N) (q [0, 1]) is always a compact and convex subset of the complex plane. For 0 q<1,f q (N) has a nonempty interior, and for q = 1, the range F(N) is a line segment if and only if N is a normal matrix with colinear eigenvalues. In particular, a complex matrix N is Hermitian (resp., skew-hermitian) if and only if F(N) R (resp., F(N) ir). For the matrix A, it is obvious now that the quantity x l (α) t Kx r (α) in (4.) is positive and lies in the interval [0, + ) F cos( xr (α),x l (α)) (K). As a consequence, it will be necessary to estimate the length of the intersection of the positive half-axis [0, + ) with the cos( x r (α), x l (α))-numerical range of the real skew-symmetric matrix K. First observe that in general, for any pair 0 <α 1 <α < 1/, it follows that q(α 1 )<q(α ), where q(α) is defined in (4.3). Thus, by [8, Theorem.5], F q(α )(K) q(α ) q(α 1 ) F q(α 1 )(K) and consequently, [0, + ) F q(α )(K) q(α ) { [0, + ) Fq(α1 )(K) }. q(α 1 ) Similarly we obtain that for every α X A \{1/}, cos( x r (α), x l (α)) [0, + ) F cos( xr (α),x (K) l (α)) q(α) { [0, + ) F q(α) (K) }. Hence, by (4.) and Theorem 3.6, 0 φ (A, α) cos( x r (α), x l (α)) q (α) max { [0, + ) F q(α) (K) } q (α) max { [0, + ) F q(α) (K) }.

11 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Theorem 4.1. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part and let s 1 be the maximum singular value of the skewsymmetric matrix K. Then for every α X A \{1/}, 0 φ (A, α) 4s 1(1 α)δ var δ 4(1 α) var. Proof. The numerical range of K is F (K) =[ iβ,iβ], where the real number β is nonnegative [6]. Denote by D(λ, r) the closed disk centered at λ with radius r. By the results in [9], it is known that for any q [0, 1], F q (K) = (iγ,h) γ,h R D ( iqγ, (1 q )(h γ ) where the union is taken over all the pairs (iγ,h) = (x Kx, x (K K)x), x x = 1. Since K is skew-symmetric, there is a unitary matrix U such that K = iu diag{±s 1, ±s,...,±s m }U and { } K K = U diag s1,s 1,s,s,...,s m U, where s 1 s s m 0 are the singular values of K. (Note that every nonzero singular value appears an even number of times.) One can see that for the pair (iγ,h) = (0,s1 ), the radius of the disk ( ) D iqγ, (1 q )(h γ ) attains its maximum value, that is, r max (A, q) = s 1 1 q. Indeed, let y 1 and ŷ 1 be two orthonormal eigenvectors of K corresponding to the eigenvalues is 1 and is 1, respectively. Then the vector y 0 = (y 1 +ŷ 1 )/ isa unit eigenvector of matrix K K corresponding to s 1, and ), (y0 Ky 0,y0 (K K)y 0 ) ( y = 1 Ky 1 + ŷ 1 Kŷ ) 1,y0 (K K)y 0 = (0,s 1 ). Thus, for any α X A \{1/}, the set [0, + ] F q(α) (K) coincides with the interval

12 54 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) ] [ [0,s 1 1 q (α) = 0, s 1(1 α) ] var. δ Consequently, for any α X A \{1/}, we have 0 φ (A, α) q (α) s 1 (1 α) var, δ where q(α) is given in (4.3), or equivalently, 0 φ (A, α) 4s 1(1 α)δ var δ 4(1 α) var. Next we turn our attention to obtaining an upper bound for φ(a,α). The only upper bound we know so far is Levinger s result, namely, φ(a,α) δ.however, our bound for φ (A, α) can lead us to a better estimate for φ(a,α). Theorem 4.. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part and let s 1 be the maximum singular value of the skewsymmetric matrix K. Then for every α 1,α X A \{1/} such that α 1 <α, 0 φ(a,α ) φ(a,α 1 ) s 1δ 4 var ln ( δ 4(1 α ) var δ 4(1 α 1 ) var Proof. From Theorem 4.1, for every α X A \{1/}, we get 0 φ (A, α) 4s 1(1 α)δ var δ 4(1 α) var. Integrating through the above inequality with respect to α in the interval (α 1, α ) X A \{1/}, and as φ(a,α)is a non-decreasing function in [0, 1/] (see [3,7]), we obtain the claimed inequality. Corollary 4.3. Let A M n (R) be a nonnegative almost skew-symmetric matrix with irreducible symmetric part and let s 1 be the maximum singular value of the skew-symmetric matrix K. If δ > 4var, then for every α [0, 1/), we have φ(a,α) ρ + s ( 1δ δ 4 var ln 4(1 α) ) var δ. 4var Moreover, for α = 1/, the following inequality obtains: δ ρ s ( 1δ 4 var ln δ ) δ. 4var Note that for values of α sufficiently close to 0, the upper bound for φ(a,α) in the above corollary is less than δ, and for α = 0, it coincides with ρ. ).

13 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Illustrative example Consider the (irreducible) nonnegative matrix A = This matrix has irreducible symmetric part S = ww t, where w = ( /)[1, 1, 1, 1, 1, 1] t. Thus A is almost skew-symmetric. The spectral radius of A is ρ =.818, its variance is var = 0.53 and δ = 3. The maximum singular value of the skewsymmetric part of A, K = , is s 1 = We also have that XA = (0, 1/] and that for every α [0, 1/], 9 = δ >.1 4(1 α) var. If we choose α =1/3, then the Perron root of L(A, 1/3) is φ(a,1/3) = with corresponding unit Perron vectors x r (1/3) =[ , , , , , ] t and x l (1/3) =[ , , , , , ] t. By (4.1), we have φ (A, 1/3) = x l(1/3) t Kx r (1/3) = x l (1/3) t x r (1/3) Notice that q(1/3) = < = cos( x r (1/3), x l (1/3)), confirming Theorem 3.6. The upper bound of the derivative of Levinger s function in Theorem 4.1 is 4s 1 (1 /3)δ var δ 4(1 /3) var = > = φ (A, 1/3).

14 56 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) Fig.. The lower and upper bound for φ(a,α). In Fig., we illustrate the upper bound for φ(a,α) in Corollary 4.3 and the lower bound in Proposition.4. The Perron roots φ(a,α) for α = 0, 0.1, 0., 0.3, 0.4, 0.5 are marked with o s. Notice that since the variance var = 0.53 is relatively small, the lower bound in Proposition.4 is evidently quite close to Levinger s function φ(a,α). Finally, we remark that Levinger s function and our bounds for it have the same qualitative behavior in X A, that is, they are all increasing and concave functions, and their derivatives have a zero at α = 1/. References [1] A. Berman, R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia, PA, [] M. Fiedler, Geometry of the numerical range of matrices, Linear Algebra Appl. 37 (1981) [3] M. Fiedler, Numerical range of matrices and Levinger s theorem, Linear Algebra Appl. 0 (1995) [4] S. Friedland, Eigenvalues of almost skew-symmetric matrices and tournament matrices, Combinatorial and graph-theoretical problems in linear algebra, in: R.A. Brualdi, S. Friedland, V. Klee (Eds.), IMA vol. Math. Appl., vol. 50, Springer, New York, 1993, pp [5] S. Friedland, M. Katz, On the maximal spectral radius of even tournament matrices and the spectrum of almost skew-symmetric compact operators, Linear Algebra Appl. 08/09 (1994) [6] R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, [7] B.W. Levinger, An inequality for nonnegative matrices, Notices Am. Math. Soc. 17 (1970) 60.

15 P.J. Psarrakos, M.J. Tsatsomeros / Linear Algebra and its Applications 360 (003) [8] C.-K. Li, P. Metha,, L. Rodman, A generalized numerical range: the range of a constrained sesquilinear form, Linear and Multilinear Algebra 37 (1998) [9] C.-K. Li, H. Nakazato, Some results on the q-numerical range, Linear and Multilinear Algebra 43 (1998) [10] J. Maroulas, P.J. Psarrakos, M.J. Tsatsomeros, Perron-Frobenius type results on the numerical range, Linear Algebra Appl. 348 (00) [11] J. McDonald, P. Psarrakos, M. Tsatsomeros, Almost skew-symmetric matrices, Rocky Mountain J. Math., to appear.

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

Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Linear Algebra and its Applications 416 006 759 77 www.elsevier.com/locate/laa Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Panayiotis J. Psarrakos a, Michael J. Tsatsomeros

More information

Geometric Mapping Properties of Semipositive Matrices

Geometric Mapping Properties of Semipositive Matrices Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices

More information

Wavelets and Linear Algebra

Wavelets and Linear Algebra Wavelets and Linear Algebra 4(1) (2017) 43-51 Wavelets and Linear Algebra Vali-e-Asr University of Rafsanan http://walavruacir Some results on the block numerical range Mostafa Zangiabadi a,, Hamid Reza

More information

Z-Pencils. November 20, Abstract

Z-Pencils. November 20, Abstract Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is

More information

INVESTIGATING THE NUMERICAL RANGE AND Q-NUMERICAL RANGE OF NON SQUARE MATRICES. Aikaterini Aretaki, John Maroulas

INVESTIGATING THE NUMERICAL RANGE AND Q-NUMERICAL RANGE OF NON SQUARE MATRICES. Aikaterini Aretaki, John Maroulas Opuscula Mathematica Vol. 31 No. 3 2011 http://dx.doi.org/10.7494/opmath.2011.31.3.303 INVESTIGATING THE NUMERICAL RANGE AND Q-NUMERICAL RANGE OF NON SQUARE MATRICES Aikaterini Aretaki, John Maroulas Abstract.

More information

MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM

MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM MAPPING AND PRESERVER PROPERTIES OF THE PRINCIPAL PIVOT TRANSFORM OLGA SLYUSAREVA AND MICHAEL TSATSOMEROS Abstract. The principal pivot transform (PPT) is a transformation of a matrix A tantamount to exchanging

More information

Point equation of the boundary of the numerical range of a matrix polynomial

Point equation of the boundary of the numerical range of a matrix polynomial Linear Algebra and its Applications 347 (2002) 205 27 wwwelseviercom/locate/laa Point equation of the boundary of the numerical range of a matrix polynomial Mao-Ting Chien a,, Hiroshi Nakazato b, Panayiotis

More information

Characterization of half-radial matrices

Characterization of half-radial matrices Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the

More information

Another algorithm for nonnegative matrices

Another algorithm for nonnegative matrices Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,

More information

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

Some bounds for the spectral radius of the Hadamard product of matrices Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard

More information

Spectral Properties of Matrix Polynomials in the Max Algebra

Spectral Properties of Matrix Polynomials in the Max Algebra Spectral Properties of Matrix Polynomials in the Max Algebra Buket Benek Gursoy 1,1, Oliver Mason a,1, a Hamilton Institute, National University of Ireland, Maynooth Maynooth, Co Kildare, Ireland Abstract

More information

Two applications of the theory of primary matrix functions

Two applications of the theory of primary matrix functions Linear Algebra and its Applications 361 (2003) 99 106 wwwelseviercom/locate/laa Two applications of the theory of primary matrix functions Roger A Horn, Gregory G Piepmeyer Department of Mathematics, University

More information

Eventual Cone Invariance

Eventual Cone Invariance Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 17 2017 Eventual Cone Invariance Michael Kasigwa Washington State University, kasigwam@gmail.com Michael Tsatsomeros Washington State

More information

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea

More information

ELA

ELA Volume 15, pp. 39-50, August 006 AN EIGENVALUE INEQUALITY AND SPECTRUM LOCALIZATION FOR COMPLEX MATRICES MARIA ADAM AND MICHAEL J. TSATSOMEROS Abstract. Using the notions of the numerical range, Schur

More information

Matrix functions that preserve the strong Perron- Frobenius property

Matrix functions that preserve the strong Perron- Frobenius property Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 18 2015 Matrix functions that preserve the strong Perron- Frobenius property Pietro Paparella University of Washington, pietrop@uw.edu

More information

On the spectra of striped sign patterns

On the spectra of striped sign patterns On the spectra of striped sign patterns J J McDonald D D Olesky 2 M J Tsatsomeros P van den Driessche 3 June 7, 22 Abstract Sign patterns consisting of some positive and some negative columns, with at

More information

Abed Elhashash and Daniel B. Szyld. Report August 2007

Abed Elhashash and Daniel B. Szyld. Report August 2007 Generalizations of M-matrices which may not have a nonnegative inverse Abed Elhashash and Daniel B. Szyld Report 07-08-17 August 2007 This is a slightly revised version of the original report dated 17

More information

arxiv: v1 [math.fa] 12 Mar 2019

arxiv: v1 [math.fa] 12 Mar 2019 SINGULARITIES OF BASE POLYNOMIALS AND GAU WU NUMBERS KRISTIN A. CAMENGA, LOUIS DEAETT, PATRICK X. RAULT, TSVETANKA SENDOVA, ILYA M. SPITKOVSKY, AND REBEKAH B. JOHNSON YATES arxiv:1903.05183v1 [math.fa]

More information

Spectrally arbitrary star sign patterns

Spectrally arbitrary star sign patterns Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,

More information

BIRKHOFF-JAMES ǫ-orthogonality SETS IN NORMED LINEAR SPACES

BIRKHOFF-JAMES ǫ-orthogonality SETS IN NORMED LINEAR SPACES BIRKHOFF-JAMES ǫ-orthogonality SETS IN NORMED LINEAR SPACES MILTIADIS KARAMANLIS AND PANAYIOTIS J. PSARRAKOS Dedicated to Profess Natalia Bebiano on the occasion of her 60th birthday Abstract. Consider

More information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

More information

A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices

A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices University of Wyoming Wyoming Scholars Repository Mathematics Faculty Publications Mathematics 9-1-1997 A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices Bryan L. Shader University

More information

arxiv: v3 [math.ra] 10 Jun 2016

arxiv: v3 [math.ra] 10 Jun 2016 To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles

More information

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

Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Linear Algebra and its Applications 7 (2) 227 24 www.elsevier.com/locate/laa Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Wen Li a,, Weiwei Sun b a Department of Mathematics,

More information

Minimizing the Laplacian eigenvalues for trees with given domination number

Minimizing the Laplacian eigenvalues for trees with given domination number Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School

More information

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

Generalizations of M-matrices which may not have a nonnegative inverse Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 2435 2450 www.elsevier.com/locate/laa Generalizations of M-matrices which may not have a nonnegative inverse Abed

More information

Uniqueness of the Solutions of Some Completion Problems

Uniqueness of the Solutions of Some Completion Problems Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive

More information

Notes on Linear Algebra and Matrix Theory

Notes on Linear Algebra and Matrix Theory Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a

More information

The minimum rank of matrices and the equivalence class graph

The minimum rank of matrices and the equivalence class graph Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,

More information

Intrinsic products and factorizations of matrices

Intrinsic products and factorizations of matrices Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences

More information

QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY

QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics

More information

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

b jσ(j), Keywords: Decomposable numerical range, principal character AMS Subject Classification: 15A60 On the Hu-Hurley-Tam Conjecture Concerning The Generalized Numerical Range Che-Man Cheng Faculty of Science and Technology, University of Macau, Macau. E-mail: fstcmc@umac.mo and Chi-Kwong Li Department

More information

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

The spectrum of a square matrix A, denoted σ(a), is the multiset of the eigenvalues CONSTRUCTIONS OF POTENTIALLY EVENTUALLY POSITIVE SIGN PATTERNS WITH REDUCIBLE POSITIVE PART MARIE ARCHER, MINERVA CATRAL, CRAIG ERICKSON, RANA HABER, LESLIE HOGBEN, XAVIER MARTINEZ-RIVERA, AND ANTONIO

More information

On the spectral radius of graphs with cut edges

On the spectral radius of graphs with cut edges Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy

More information

A primer of Perron Frobenius theory for matrix polynomials

A primer of Perron Frobenius theory for matrix polynomials Linear Algebra and its Applications 393 (2004) 333 35 wwwelseviercom/locate/laa A primer of Perron Frobenius theory for matrix polynomials Panayiotis J Psarrakos a,, Michael J Tsatsomeros b a Department

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear Algebra: Matrix Eigenvalue Problems CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given

More information

N-WEAKLY SUPERCYCLIC MATRICES

N-WEAKLY SUPERCYCLIC MATRICES N-WEAKLY SUPERCYCLIC MATRICES NATHAN S. FELDMAN Abstract. We define an operator to n-weakly hypercyclic if it has an orbit that has a dense projection onto every n-dimensional subspace. Similarly, an operator

More information

Higher rank numerical ranges of rectangular matrix polynomials

Higher rank numerical ranges of rectangular matrix polynomials Journal of Linear and Topological Algebra Vol. 03, No. 03, 2014, 173-184 Higher rank numerical ranges of rectangular matrix polynomials Gh. Aghamollaei a, M. Zahraei b a Department of Mathematics, Shahid

More information

PROJECTIONS ONTO CONES IN BANACH SPACES

PROJECTIONS ONTO CONES IN BANACH SPACES Fixed Point Theory, 19(2018), No. 1,...-... DOI: http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html PROJECTIONS ONTO CONES IN BANACH SPACES A. DOMOKOS AND M.M. MARSH Department of Mathematics and Statistics

More information

On the Hermitian solutions of the

On the Hermitian solutions of the Journal of Applied Mathematics & Bioinformatics vol.1 no.2 2011 109-129 ISSN: 1792-7625 (print) 1792-8850 (online) International Scientific Press 2011 On the Hermitian solutions of the matrix equation

More information

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2 EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 2 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 5, 2012 Andre Tkacenko

More information

Affine iterations on nonnegative vectors

Affine iterations on nonnegative vectors Affine iterations on nonnegative vectors V. Blondel L. Ninove P. Van Dooren CESAME Université catholique de Louvain Av. G. Lemaître 4 B-348 Louvain-la-Neuve Belgium Introduction In this paper we consider

More information

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

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices Applied Mathematics Letters 25 (202) 2339 2343 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Comparison theorems for a subclass

More information

Maximizing the numerical radii of matrices by permuting their entries

Maximizing the numerical radii of matrices by permuting their entries Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and

More information

Eventually reducible matrix, eventually nonnegative matrix, eventually r-cyclic

Eventually reducible matrix, eventually nonnegative matrix, eventually r-cyclic December 15, 2012 EVENUAL PROPERIES OF MARICES LESLIE HOGBEN AND ULRICA WILSON Abstract. An eventual property of a matrix M C n n is a property that holds for all powers M k, k k 0, for some positive integer

More information

1 Linear Algebra Problems

1 Linear Algebra Problems Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and

More information

Some inequalities for sum and product of positive semide nite matrices

Some inequalities for sum and product of positive semide nite matrices Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,

More information

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing

More information

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.

More information

Linear Algebra Massoud Malek

Linear Algebra Massoud Malek CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product

More information

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

On the simultaneous diagonal stability of a pair of positive linear systems On the simultaneous diagonal stability of a pair of positive linear systems Oliver Mason Hamilton Institute NUI Maynooth Ireland Robert Shorten Hamilton Institute NUI Maynooth Ireland Abstract In this

More information

Interpolating the arithmetic geometric mean inequality and its operator version

Interpolating the arithmetic geometric mean inequality and its operator version Linear Algebra and its Applications 413 (006) 355 363 www.elsevier.com/locate/laa Interpolating the arithmetic geometric mean inequality and its operator version Rajendra Bhatia Indian Statistical Institute,

More information

On the maximal numerical range of some matrices

On the maximal numerical range of some matrices Electronic Journal of Linear Algebra Volume 34 Volume 34 (218) Article 21 218 On the maximal numerical range of some matrices Ali N. Hamed New York University Abu Dhabi, alinosh@nyu.edu Ilya M. Spitkovsky

More information

David Hilbert was old and partly deaf in the nineteen thirties. Yet being a diligent

David Hilbert was old and partly deaf in the nineteen thirties. Yet being a diligent Chapter 5 ddddd dddddd dddddddd ddddddd dddddddd ddddddd Hilbert Space The Euclidean norm is special among all norms defined in R n for being induced by the Euclidean inner product (the dot product). A

More information

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

SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY. February 16, 2010 SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY MINERVA CATRAL, LESLIE HOGBEN, D. D. OLESKY, AND P. VAN DEN DRIESSCHE February 16, 2010 Abstract. A matrix A is power-positive if some positive integer

More information

Inequalities for the spectra of symmetric doubly stochastic matrices

Inequalities for the spectra of symmetric doubly stochastic matrices Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department

More information

Lecture notes: Applied linear algebra Part 1. Version 2

Lecture notes: Applied linear algebra Part 1. Version 2 Lecture notes: Applied linear algebra Part 1. Version 2 Michael Karow Berlin University of Technology karow@math.tu-berlin.de October 2, 2008 1 Notation, basic notions and facts 1.1 Subspaces, range and

More information

Elements of Convex Optimization Theory

Elements of Convex Optimization Theory Elements of Convex Optimization Theory Costis Skiadas August 2015 This is a revised and extended version of Appendix A of Skiadas (2009), providing a self-contained overview of elements of convex optimization

More information

Spectral inequalities and equalities involving products of matrices

Spectral inequalities and equalities involving products of matrices Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department

More information

Convexity of the Joint Numerical Range

Convexity of the Joint Numerical Range Convexity of the Joint Numerical Range Chi-Kwong Li and Yiu-Tung Poon October 26, 2004 Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement. Abstract Let A = (A 1,..., A m ) be an

More information

On factor width and symmetric H -matrices

On factor width and symmetric H -matrices Linear Algebra and its Applications 405 (2005) 239 248 www.elsevier.com/locate/laa On factor width and symmetric H -matrices Erik G. Boman a,,1, Doron Chen b, Ojas Parekh c, Sivan Toledo b,2 a Department

More information

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

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional

More information

Diagonalizing Matrices

Diagonalizing Matrices Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B

More information

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

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

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius. May 7, DETERMINING WHETHER A MATRIX IS STRONGLY EVENTUALLY NONNEGATIVE LESLIE HOGBEN 3 5 6 7 8 9 Abstract. A matrix A can be tested to determine whether it is eventually positive by examination of its

More information

Matrix Inequalities by Means of Block Matrices 1

Matrix Inequalities by Means of Block Matrices 1 Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,

More information

DAVIS WIELANDT SHELLS OF NORMAL OPERATORS

DAVIS WIELANDT SHELLS OF NORMAL OPERATORS DAVIS WIELANDT SHELLS OF NORMAL OPERATORS CHI-KWONG LI AND YIU-TUNG POON Dedicated to Professor Hans Schneider for his 80th birthday. Abstract. For a finite-dimensional operator A with spectrum σ(a), the

More information

Perron-Frobenius Theory and Positivity in Linear Algebra

Perron-Frobenius Theory and Positivity in Linear Algebra Perron-Frobenius Theory and Positivity in Linear Algebra Washington State University ALA - Novi Sad 2010 - In honour of Hans Schneider May 26, 2010 Oskar Perron (1880-1975) Georg Frobenius (1849-1917)

More information

Note on the Jordan form of an irreducible eventually nonnegative matrix

Note on the Jordan form of an irreducible eventually nonnegative matrix Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 19 2015 Note on the Jordan form of an irreducible eventually nonnegative matrix Leslie Hogben Iowa State University, hogben@aimath.org

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

Means of unitaries, conjugations, and the Friedrichs operator

Means of unitaries, conjugations, and the Friedrichs operator J. Math. Anal. Appl. 335 (2007) 941 947 www.elsevier.com/locate/jmaa Means of unitaries, conjugations, and the Friedrichs operator Stephan Ramon Garcia Department of Mathematics, Pomona College, Claremont,

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has

More information

Strictly nonnegative tensors and nonnegative tensor partition

Strictly nonnegative tensors and nonnegative tensor partition SCIENCE CHINA Mathematics. ARTICLES. January 2012 Vol. 55 No. 1: 1 XX doi: Strictly nonnegative tensors and nonnegative tensor partition Hu Shenglong 1, Huang Zheng-Hai 2,3, & Qi Liqun 4 1 Department of

More information

Computing the elasticity of a Krull monoid

Computing the elasticity of a Krull monoid Linear Algebra and its Applications 336 (2001) 191 200 www.elsevier.com/locate/laa Computing the elasticity of a Krull monoid S.T. Chapman a,, J.I. García-García b,1, P.A. García-Sánchez b,1, J.C. Rosales

More information

Fiedler s Theorems on Nodal Domains

Fiedler s Theorems on Nodal Domains Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A Spielman September 9, 202 7 About these notes These notes are not necessarily an accurate representation of what happened in

More information

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min. MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.

More information

RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES

RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES CHI-KWONG LI, YIU-TUNG POON, AND XUEFENG WANG Abstract. Let M n be the set of n n complex matrices. in this note, all the possible ranks of a bipartite

More information

Sign Patterns with a Nest of Positive Principal Minors

Sign Patterns with a Nest of Positive Principal Minors Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P

More information

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

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted

More information

Minimum number of non-zero-entries in a 7 7 stable matrix

Minimum number of non-zero-entries in a 7 7 stable matrix Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a

More information

Numerical Range for the Matrix Exponential Function

Numerical Range for the Matrix Exponential Function Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 45 2016 Numerical Range for the Matrix Exponential Function Christos Chorianopoulos horjoe@yahoo.gr Chun-Hua Guo University of Regina,

More information

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis. Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar

More information

The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B

The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B International Journal of Algebra, Vol. 6, 0, no. 9, 903-9 The Hermitian R-symmetric Solutions of the Matrix Equation AXA = B Qingfeng Xiao Department of Basic Dongguan olytechnic Dongguan 53808, China

More information

Positive systems in the behavioral approach: main issues and recent results

Positive systems in the behavioral approach: main issues and recent results Positive systems in the behavioral approach: main issues and recent results Maria Elena Valcher Dipartimento di Elettronica ed Informatica Università dipadova via Gradenigo 6A 35131 Padova Italy Abstract

More information

Moore Penrose inverses and commuting elements of C -algebras

Moore Penrose inverses and commuting elements of C -algebras Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We

More information

Fiedler s Theorems on Nodal Domains

Fiedler s Theorems on Nodal Domains Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A. Spielman September 19, 2018 7.1 Overview In today s lecture we will justify some of the behavior we observed when using eigenvectors

More information

Spectral radius of bipartite graphs

Spectral radius of bipartite graphs Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an

More information

We describe the generalization of Hazan s algorithm for symmetric programming

We describe the generalization of Hazan s algorithm for symmetric programming ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,

More information

November 18, 2013 ANALYTIC FUNCTIONAL CALCULUS

November 18, 2013 ANALYTIC FUNCTIONAL CALCULUS November 8, 203 ANALYTIC FUNCTIONAL CALCULUS RODICA D. COSTIN Contents. The spectral projection theorem. Functional calculus 2.. The spectral projection theorem for self-adjoint matrices 2.2. The spectral

More information

Gershgorin type sets for eigenvalues of matrix polynomials

Gershgorin type sets for eigenvalues of matrix polynomials Electronic Journal of Linear Algebra Volume 34 Volume 34 (18) Article 47 18 Gershgorin type sets for eigenvalues of matrix polynomials Christina Michailidou National Technical University of Athens, xristina.michailidou@gmail.com

More information

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

An estimation of the spectral radius of a product of block matrices Linear Algebra and its Applications 379 (2004) 267 275 wwwelseviercom/locate/laa An estimation of the spectral radius of a product of block matrices Mei-Qin Chen a Xiezhang Li b a Department of Mathematics

More information

The Newton Bracketing method for the minimization of convex functions subject to affine constraints

The Newton Bracketing method for the minimization of convex functions subject to affine constraints Discrete Applied Mathematics 156 (2008) 1977 1987 www.elsevier.com/locate/dam The Newton Bracketing method for the minimization of convex functions subject to affine constraints Adi Ben-Israel a, Yuri

More information

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

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu

More information

The Laplacian spectrum of a mixed graph

The Laplacian spectrum of a mixed graph Linear Algebra and its Applications 353 (2002) 11 20 www.elsevier.com/locate/laa The Laplacian spectrum of a mixed graph Xiao-Dong Zhang a,, Jiong-Sheng Li b a Department of Mathematics, Shanghai Jiao

More information

Two Characterizations of Matrices with the Perron-Frobenius Property

Two Characterizations of Matrices with the Perron-Frobenius Property NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2009;??:1 6 [Version: 2002/09/18 v1.02] Two Characterizations of Matrices with the Perron-Frobenius Property Abed Elhashash and Daniel

More information

On the adjacency matrix of a block graph

On the adjacency matrix of a block graph On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit

More information

Linear estimation in models based on a graph

Linear estimation in models based on a graph Linear Algebra and its Applications 302±303 (1999) 223±230 www.elsevier.com/locate/laa Linear estimation in models based on a graph R.B. Bapat * Indian Statistical Institute, New Delhi 110 016, India Received

More information