Symmetric nonnegative realization of spectra
|
|
- Cori Malone
- 5 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 6 Article 7 Symmetric nonnegative realization of spectra Ricardo L. Soto rsoto@bh.ucn.cl Oscar Rojo Julio Moro Alberto Borobia Follow this and additional works at: Recommended Citation Soto, Ricardo L.; Rojo, Oscar; Moro, Julio; and Borobia, Alberto. (7), "Symmetric nonnegative realization of spectra", Electronic Journal of Linear Algebra, Volume 6. DOI: This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been accepted for inclusion in Electronic Journal of Linear Algebra by an authorized editor of Wyoming Scholars Repository. For more information, please contact scholcom@uwyo.edu.
2 Volume 6, pp. -8, January 7 SYMMETRIC NONNEGATIVE REALIZATION OF SPECTRA RICARDO L. SOTO, OSCAR ROJO, JULIO MORO, AND ALBERTO BOROBIA Abstract. A perturbation result, due to R. Rado and presented by H. Perfect in 9, shows how to modify r eigenvalues of a matrix of order n, r n, via a perturbation of rank r, without changing any of the n r remaining eigenvalues. This result extended a previous one, due to Brauer, on perturbations of rank r =. Both results have been exploited in connection with the nonnegative inverse eigenvalue problem. In this paper a symmetric version of Rado s extension is given, which allows us to obtain a new, more general, sufficient condition for the existence of symmetric nonnegative matrices with prescribed spectrum. Key words. Symmetric nonnegative inverse eigenvalue problem. AMS subject classifications. A8, A.. Introduction. The real nonnegative inverse eigenvalue problem (hereafter RNIEP) is the problem of characterizing all possible real spectra of entrywise n n nonnegative matrices. For n the problem remains unsolved. In the general case, when the possible spectrum Λ is a set of complex numbers, the problem has only been solved for n = 3 by Loewy and London []. The complex cases n = and n = have been solved for matrices of trace zero by Reams [7] and Laffey and Meehan [], respectively. Sufficient conditions or realizability criteria for the existence of a nonnegative matrix with a given real spectrum have been obtained in [,,,8,8,,9,](see[3,.] and references therein for a comprehensive survey). If we additionally require the realizing matrix to be symmetric, we have the symmetric nonnegative inverse eigenvalue problem (hereafter SNIEP). Both problems, RNIEP and SNIEP, are equivalent for n (see [6]), but are different otherwise [7]. Partial results for the SNIEP have been obtained in [,, 6,, 3] (see [3,.] and references therein for more on the SNIEP). The origin of the present paper is a perturbation result, due to Brauer [] (Theorem. below), which shows how to modify one single eigenvalue of a matrix via a rank-one perturbation, without changing any of the remaining eigenvalues. This result was first used by Perfect [] in connection with the NIEP, and has given rise lately to a number of realizability criteria [9,, ]. Closer to our approach in this paper is Rado s extension (Theorem.3 below) of Brauer s result, which was used by Received by the editors 3 June 6. Accepted for publication 7 December 6. Handling Editor: Michael Neumann. Departamento de Matemáticas, Universidad Católica del Norte, Antofagasta, Casilla 8, Chile (rsoto@ucn.cl, orojo@ucn.cl). Supported by Fondecyt 6, Fondecyt 8 and Mecesup UCN, Chile. Departamento de Matemáticas, Universidad Carlos III de Madrid, 89 Leganés, Spain (jmoro@math.uc3m.es). Supported by the Spanish Ministerio de Ciencia y Tecnología through grant BFM-3-3. Departamento de Matemáticas, UNED, Madrid, Senda del Rey s/n., 8 Madrid, Spain (aborobia@mat.uned.es). Perfect points out in [] that both the extension and its proof are due to Professor R. Rado.
3 Volume 6, pp. -8, January 7 R.L.Soto,O.Rojo,J.Moro,andA.Borobia Perfect in [] to derive a sufficient condition for the RNIEP. Our goal in this paper is twofold: to obtain a symmetric version of Rado s extension and, as a consequence of it, to obtain a new realizability criterion for the SNIEP. The paper is organized as follows: In section we introduce some notation, basic concepts and results which will be needed throughout the paper, including Rado s Theorem and its new, symmetric version (Theorem.6 below). Based on this symmetric version, we give in section 3 a new criterion (Theorem 3.) for the existence of a symmetric nonnegative matrix with prescribed spectrum, together with an explicit procedure to construct the realizing matrices. Section is devoted to comparing this new criterion with some previous criteria for the SNIEP, and section to illustrate the results with two specific examples.. Symmetric rank-r perturbations. Let Λ = {λ,λ,...,λ n } be a set of real numbers. We shall say that Λ is realizable (respectively, symmetrically realizable) if it exists an entrywise nonnegative (resp., a symmetric entrywise nonnegative) matrix of order n with spectrum Λ. Definition.. AsetK of conditions is said to be a symmetric realizability criterion if any set Λ = {λ,λ,..., λ n } satisfying the conditions K is symmetrically realizable. Arealmatrix A =(a ij ) n i,j= is said to have constant row sums if all its rows sum up to a same constant, say α, i.e. n a ij = α, j= i =,...,n. The set of all real matrices with constant row sums equal to α is denoted by CS α. It is clear that any matrix in CS α has eigenvector e =(,,...) T corresponding to the eigenvalue α. Denote by e k the vector with one in the k-th position and zeros elsewhere. The relevance of matrices with constant row sums in the RNIEP is due to the fact [6] that if λ is the dominant element in Λ, then the problem of finding a nonnegative matrix with spectrum Λ is equivalent to the problem of finding a nonnegative matrix in CS λ with spectrum Λ. The following theorem, due to Brauer [, Thm. 7], is relevant for the study of the nonnegative inverse eigenvalue problem. In particular, Theorem. plays an important role not only to derive sufficient conditions for realizability, but also to compute a realizing matrix. Theorem.. (Brauer []) Let A be an n n arbitrary matrix with eigenvalues λ,λ,..., λ n. Let v =(v,v,..., v n ) T be an eigenvector of A associated with the eigenvalue λ k and let q be any n-dimensional vector. Then the matrix A + vq T has eigenvalues λ,λ,..., λ k,λ k + v T q,λ k+,..., λ n.
4 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra 3 The following result, due to R. Rado and presented by Perfect [] in 9, is an extension of Theorem.. It shows how to change an arbitrary number r of eigenvalues of an n n matrix A (with n>r) via a perturbation of rank r, without changing any of the remaining n r eigenvalues. Theorem.3. (Rado []) Let A be an n n arbitrary matrix with eigenvalues λ,λ,..., λ n and let Ω = diag{λ,λ,..., λ r } for some r n. Let X be an n r matrix with rank r such that its columns x,...,x r satisfy Ax i = λ i x i, i =,,...r,. Let C be an r n arbitrary matrix. Then the matrix A + XC has eigenvalues µ,µ,..., µ r,λ r+,λ r+,..., λ n,where µ,µ,..., µ r are eigenvalues of the matrix Ω+CX. Perfect used this extension to derive a realizability criterion for the RNIEP. Although it turns out to be a quite powerful result, inexplicably, this criterion was completely ignored for many years in the literature until it was brought up again in []. Perfect s criterion for the RNIEP is the following: Theorem.. (Perfect []) Let Λ={λ,...,λ n } R be such that λ λ k, k = r +,...,n for a certain r<nand let ω,...,ω r be nonnegative real numbers such that there exists an r r nonnegative matrix B CS λ with eigenvalues {λ,...,λ r } and diagonal entries {ω,...,ω r }. If one can partition the set {ω,...,ω r } {λ r+,...,λ n } into r realizable sets Γ k = {ω k,λ k,..., λ kpk }, k =,...,r,then Λ isalsoarealizable set. Perfect complemented this result with conditions under which ω,ω,..., ω r are the diagonal entries of some r r nonnegative matrix B CS λ with spectrum {λ,λ,..., λ r }. For the particular case r = 3, these conditions, which are necessary and sufficient, are i) ω k λ, k =,, 3 ii) ω + ω + ω 3 = λ + λ + λ 3 iii) ω ω + ω ω 3 + ω ω 3 λ λ + λ λ 3 + λ λ 3 iv) max k ω k λ with (see also []) where B = ω λ ω λ ω p ω p λ ω 3 ω 3, (.) p = λ ω 3 [ω ω + ω ω 3 + ω ω 3 λ λ λ λ 3 λ λ 3 ].
5 Volume 6, pp. -8, January 7 R.L.Soto,O.Rojo,J.Moro,andA.Borobia To show the power of both Theorem.3 and Theorem., consider the following example; in which, as far as we know, no other realizability criterion is satisfied by the set Λ (except the extended Perfect criterion given in []): Example.. Let Λ = {6, 3, 3,, }. We take the partition with the associated realizable sets {6, } {3, } {3} Γ = {, }, Γ = {, }, Γ 3 = {}. Then A = ; X = and Ax i = λ i x i,i=,, 3. Now we need to compute a 3 3matrixB CS λ eigenvalues 6, 3, 3 and diagonal entries,,. From (.), that matrix is B = with and from it we compute the matrix C =. Then A + XC = is nonnegative with spectrum Λ = {6, 3, 3,, }. We finish this section by proving its main result, namely a symmetric version of Rado s Theorem.3. Theorem.6. Let A be an n n symmetric matrix with eigenvalues λ,...,λ n, and,for some r n,let {x, x,..., x r } be an orthonormal set of eigenvectors of A
6 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra spanning the invariant subspace associated with λ,..., λ r.letx be the n r matrix with i-th column x i,let Ω=diag{λ,...,λ r },and let C be any r r symmetric matrix. Then the symmetric matrix A + XCX T has eigenvalues µ,µ,..., µ r,λ r+,..., λ n, where µ,µ,..., µ r are the eigenvalues of the matrix Ω+C. Proof. SincethecolumnsofXare an orthonormal set, we may complete X to an orthogonal matrix W =[XY], i.e., X T X = I r,y T Y = I n r,x T Y =,Y T X =. Then [ W X T AW = A [ X Y ] [ ] Ω X = T AY [ W (XCX T Ir )W = Y T ] ] C [ I r ] = Y T AY [ ] C. Therefore, W (A + XCX T )W = [ Ω+C X T AY Y T AY ] and A + XCX T is a symmetric matrix with eigenvalues µ,..., µ r,λ r+,..., λ n. 3. A new criterion for symmetric nonnegative realization of spectra. The following result gives a realizability criterion for the SNIEP, that is, if Λ satisfies the criterion then Λ is realizable as the spectrum of a symmetric nonnegative matrix. It is a consequence of Theorem.6 in the same way as Theorem. follows from Theorem.3. In section we show that Soto s realizability criterion [9, Theorem 7], which is also sufficient for the symmetric case, is contained in the criterion of Theorem 3. below. Example. in section shows that the inclusion is strict. Theorem 3.. Let Λ={λ,...,λ n } be a set of real numbers with λ λ... λ n and,for some t n,let ω,...,ω t be real numbers satisfying ω k λ, k =,...,t. Suppose there exist i) a partition Λ = Λ... Λ t, with Λ k = {λ k,λ k,...,λ kpk }, λ = λ, λ k ; λ k... λ kpk, such that for each k =,...,t the set Γ k = {ω k,λ k,...,λ kpk } is realizable by a symmetric nonnegative matrix of order p k,and ii) a symmetric nonnegative t t matrix with eigenvalues λ,λ,...,λ t and diagonal entries ω,ω,...,ω t. Then Λ is realizable by a symmetric nonnegative matrix of order n. Proof. For each k =,...,t,denotebya k the symmetric nonnegative p k p k matrix realizing Γ k.weknowfromi) that the n n matrix A =diag{a,a,...,a t } is symmetric nonnegative with spectrum Γ Γ... Γ t.let{x,...,x r } be an orthonormal set of eigenvectors of A associated, respectively, with ω,...,ω r. Then, the n r matrix X with i-th column x i satisfies AX = XΩ for Ω = diag{ω,ω,...,ω t }. Moreover, X is entrywise nonnegative, since each x i is a Perron vector of A i.now,let
7 Volume 6, pp. -8, January 7 6 R.L.Soto,O.Rojo,J.Moro,andA.Borobia B be the symmetric nonnegative t t matrix with spectrum {λ,...,λ t } and diagonal entries ω,ω,...,ω t.ifwesetc = B Ω, the matrix C is symmetric nonnegative, and Ω + C has eigenvalues λ,...,λ t. Therefore, by Theorem.6, the symmetric matrix A + XCX T has spectrum Λ. Moreover, it is nonnegative, since all the entries of A, X and C are nonnegative. Theorem 3. not only ensures the existence of a realizing matrix, but, as will be shown in the rest of this section, it also allows to construct the realizing matrix. Of course, the key is knowing under which conditions does there exist a symmetric nonnegative matrix B of order t with eigenvalues λ,...,λ t and diagonal entries ω,...,ω t. Necessary and sufficient conditions are known for the existence of a real, not necessarily nonnegative, symmetric matrix. They are due to Horn []: There exists a real symmetric matrix with eigenvalues λ λ... λ t and diagonal entries ω ω... ω t if and only if the vector (λ,...,λ t ) majorizes the vector (ω,...,ω t ), that is, if and only if k λ i k ω i for k =,,..., t i= i= t λ i = t (3.) ω i. i= i= From now on, we separate the study in four cases, depending on the number t of subsets in the partition of Λ. 3.. The case t =. For t = the conditions (3.) become } λ ω, λ + λ = ω + ω and they are also sufficient for the existence of a symmetric nonnegative matrix B with eigenvalues λ λ and diagonal entries ω ω, namely, [ ] ω B = (λ ω )(λ ω ). (λ ω )(λ ω ) ω 3.. The case t =3. There are also necessary and sufficient conditions, obtained by Fiedler [], for the existence of a 3 3 symmetric nonnegative matrix with prescribed spectrum and diagonal entries: Lemma 3.. (Fiedler []) The conditions λ ω λ + λ ω + ω λ + λ + λ 3 = ω + ω + ω 3 λ ω (3.)
8 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra 7 are necessary and sufficient for the existence of a 3 3 symmetric nonnegative matrix B with eigenvalues λ λ λ 3 and diagonal entries ω ω ω 3. Remark 3.3. The matrix B for t =3. Using the proof of Theorem. in [], one can write a procedure to construct the symmetric nonnegative matrix B in Lemma 3.. The procedure is as follows:. Define µ = λ + λ ω.. Construct the symmetric nonnegative matrix T = [ ] ω τ, τ = (µ ω τ ω )(µ ω 3 ) 3 with eigenvalues µ and λ 3. Observe that, using (3.), we have µ = λ + λ ω ω + ω ω = ω. 3. Find a normalized Perron vector u of T T u = µu, u T u =.. Construct the symmetric nonnegative matrix S = [ ] µ s, s = (λ s ω µ)(λ ω ) with eigenvalues λ and λ. It follows from (3.) that λ µ = ω λ.. By Lemma. in [], the matrix B = [ ] T su su T ω is symmetric nonnegative with the prescribed eigenvalues and diagonal entries. Finally, the matrix [ ω su B = T su T similar to B, has the diagonal entries in the order ω ω ω 3. One can easily check that this procedure yields ω µ ω3 µ ω ω 3 s µ ω µ ω ω 3 s B = µ ω3 µ ω ω 3 s ω (µ ω )(µ ω 3 ). (3.3) s (µ ω )(µ ω 3 ) ω 3 µ ω µ ω ω 3 ],
9 Volume 6, pp. -8, January 7 8 R.L.Soto,O.Rojo,J.Moro,andA.Borobia 3.3. The case t =. For t we may use the following result: Theorem 3.. (Fiedler []) If λ... λ t and ω... ω t are such that s i) λ i s ω i, s t i= i= t ii) λ i = t (3.) ω i i= i= iii) λ k ω k, k t then there exists a t t symmetric nonnegative matrix B with eigenvalues λ,...,λ t and diagonal entries ω,...,ω t. As before, a procedure to construct the symmetric nonnegative matrix B of Theorem 3. can be obtained for the case t = following the proofs of Theorem., Lemma. and Theorem.8 in []. Remark 3.. Construction of B for t =. Let λ λ λ 3 λ and ω ω ω 3 ω satisfy the conditions (3.) above. Then, the following procedure leads to a symmetric nonnegative matrix B with eigenvalues λ i and diagonal entries ω i.. Define µ = λ + λ ω.. Using the procedure in Remark 3.3, construct a 3 3 symmetric nonnegative matrix T with eigenvalues µ, λ 3,λ and diagonal entries ω,ω 3,ω. Notice that these eigenvalues and diagonal entries satisfy the necessary and sufficient conditions given in Lemma 3.: µ = λ + λ ω ω + ω ω = ω µ + λ 3 = λ + λ + λ 3 ω ω + ω + ω 3 ω = ω + ω 3 µ + λ 3 + λ = λ + λ ω + λ 3 + λ = ω + ω ω + ω 3 + ω 3. Find u such that = ω + ω 3 + ω λ 3 ω T u = µu, u T u =.. Construct the symmetric nonnegative matrix [ ] µ s S =, s = (λ s ω µ)(λ ω ) with eigenvalues λ and λ. It follows from (3.) that λ µ = ω λ.. By Lemma. in [], [ ] T su B = su T ω
10 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra 9 is a symmetric nonnegative matrix with the prescribed eigenvalues and diagonal entries. Finally, the matrix [ ] ω su B = T, su T similar to B, has the diagonal entries in the order ω ω ω 3 ω. Remark 3.6. We observe that for t the conditions in Theorem 3. are only sufficient. The matrix B =, for instance,has eigenvalues 8, 6, 3, 3 and its second largest eigenvalue is strictly larger than its largest diagonal entry. 3.. The case t. Recursively, the above procedure can be easily extended to t Remark 3.7. Construction of B for t. Let λ... λ t and ω... ω t satisfying the sufficient conditions of Theorem 3... Define µ = λ + λ ω.. Using the above procedure recursively, construct a (t ) (t ) symmetric nonnegative matrix T with eigenvalues µ, λ 3,...,λ t and diagonal entries ω,ω 3,..., ω t. Notice that these eigenvalues and diagonal entries satisfy the conditions of Theorem 3.: µ + µ + µ = λ + λ ω ω + ω ω = ω l l λ j = λ + λ ω + j=3 = l λ j ω j= t λ j = λ + λ ω + j=3 = t λ j ω = j= j=3 λ j l ω j for 3 l t. j= t j=3 t j= ω j λ j λ k ω k for 3 k t
11 Volume 6, pp. -8, January 7 R. L. Soto, O. Rojo, J. Moro, and A. Borobia 3. Find u such that T u = µu, u T u =.. Construct the symmetric nonnegative matrix [ ] µ s S =, s = (λ s ω µ)(λ ω ) with eigenvalues λ and λ. It follows from (3.) that λ µ = ω λ.. By Lemma. in [], [ ] T su B = su T ω is a symmetric nonnegative matrix with the prescribed eigenvalues and diagonal entries. Finally, the matrix [ ] ω su B = T, su T similar to B, has the diagonal entries in the order ω ω... ω t.. Comparison with previous criteria. Several realizability criteria which were first obtained for the RNIEP have later been shown to be realizability criteria for the SNIEP as well. Kellogg s criterion [8], for instance, was shown by Fiedler [] to imply symmetric realizability. Radwan [6] proved that Borobia s criterion [] is also a criterion for symmetric realizability, and Soto s criterion for the RNIEP [9] (Theorem. below), which contains both Kellogg s and Borobia s criteria [], was shown in [3] to be also a symmetric realizability criterion. In this section we compare the new result in this paper (Theorem 3.) with some previous realizability criteria for SNIEP. First, we will show that Soto s criterion is actually contained in the new symmetric realizability criterion. Example. in section shows that the inclusion is strict. Comparisons with results given in [9], [] and [3] will also be discussed in this section. We begin by recalling Soto s criterion, first in a simplified version which displays the essential ingredients, and then in full generality. Theorem.. (Soto [9]) Let Λ={λ,λ,...,λ n } be a set of real numbers, satisfying λ... λ p >λ p+... λ n. Let [ n ] S j = λ j + λ n j+, j =, 3,..., and (.) If S n+ =min{λn+, } for n odd. λ λ n S j< S j, (.)
12 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra then Λ is realizable by a nonnegative matrix A CS λ. It was shown in [] that condition (.) is also sufficient for the existence of a symmetric nonnegative matrix with prescribed spectrum. In the context of Theorem. we define T (Λ) = λ + λ n + S j< S j and observe that (.) is equivalent to T (Λ). If Λ = {λ,...,λ n } satisfies the sufficient condition (.), then Λ = { λ n S j< S j,λ,...,λ n } is a symmetrically realizable set. The number λ n S S j< j is the minimum value that λ may take in order that Λ be symmetrically realizable according to Theorem.. Now, suppose that Λ = {λ,λ,...,λ n } is partitioned as Λ = Λ Λ... Λ t. Then, according to Theorem., for each subset Λ k = {λ k,λ k,...,λ kpk }, k =,,..., t, of the partition, T (Λ k )=T k = λ k + λ kpk + S kj. (.3) S kj < Clearly, Λ k is symmetrically realizable if and only if T k. The following result is an extension of Theorem.. As mentioned above, it is also a symmetric realizability criterion [3]. Theorem.. (Soto [9]) Let Λ={λ,λ,...,λ n } as in Theorem.. Let the partition Λ=Λ Λ... Λ t with Λ k = {λ k,λ k,...,λ kpk }, k =,...,t, λ = λ, λ k, λ k... λ kpk. Let T k be defined as in (.3),and let L =max{λ T ; max {λ k}}. (.) k t If λ L T k, (.) T k < then Λ is realizable by a nonnegative matrix A CS λ. Moreover, Λ is symmetrically realizable. Now we show that the (symmetric) realizability criterion of Theorem. implies Theorem 3.. Example. in section shows that the inclusion is strict. We point
13 Volume 6, pp. -8, January 7 R. L. Soto, O. Rojo, J. Moro, and A. Borobia out that Theorem. is a constructive criterion in the sense that it allows to compute an explicit realizing matrix. However, to construct a symmetric nonnegative matrix we need a different approach. Theorem.3. If the conditions of Theorem. are satisfied,then the conditions of Theorem 3. are satisfied as well. Proof. Suppose condition (.) of Theorem. is satisfied. Without loss of generality, we may assume that λ = L T k < T k, since increasing the dominant element of a set never leads to a loss of realizability. Consider the partition Λ = Λ... Λ t, Λ k = {λ k,λ k,...,λ kpk },k=,...,t, in Theorem.. We define the sets Γ k = {ω k,λ k,...,λ kpk }, k =,,...,t, where ω = L ω k = λ k T k if T k < ω k = λ k if T k, k =, 3,...,t Then, using the symmetric realizability condition (.) given by Theorem., Γ k is realizable by a p k p k symmetric nonnegative matrix A k. We now show, by checking conditions (3.), the existence of a symmetric nonnegative matrix B with eigenvalues λ,λ,...,λ t and diagonal entries ω,ω,...,ω t : since ω = L = λ + T k < T k, we have s λ k = ω T k + (ω k + T k )+ k= = T k < s ω k k= T k <, k {,...,s} T k <, k/ {,...,s} T k s ω k, s =,...,t. k= This proves condition i) in (3.). Next, t λ k = ω T k + k= = t k= ω k proves ii). Finally, since T k < T k <, k {,...,t} (ω k + T k )+ T k, k {,...,s} T k, k {,...,t} if T k < then λ k λ (k ) = ω k + T k ω k, ω k ω k
14 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra 3 or if T k then λ k λ (k ) = ω k, condition iii) in (3.) also holds. Thus the conditions of Theorem 3. are satisfied. In [3], McDonald and Neumann denote as R n the set of all points σ =(,λ,..., λ n ), which correspond to spectra realizable by symmetric nonnegative matrices and as S n the set of all σ R n, which are Soules realizable, that is, there exists an n n symmetric nonnegative matrix A and a Soules matrix R such that R T AR = diag{,λ,...,λ n }. Then they show that S n = R n for n =3andn =. In [9], Knudsen and McDonald establish that S is properly contained in R. In particular they show that the point m =(, +, +,, ) R is not in S and that every point on the line segment from l =(,,,,, )tom, correspond to a set {,λ,...,λ }, which is realizable by a symmetric nonnegative matrix. In [3], Egleston et al. study the symmetric realizability of lists of five numbers {,λ,...,λ } and point out that there are two cases where SNIEP is unknown. One of these cases is shown to be not realizable as the spectrum of a symmetric nonnegative matrix by using a necessary condition given in ([3], Lemma.). Concerning to the second unresolved case, it is shown in [] that every point on the line from l to m is also realized by a symmetric nonnegative circulant matrix. Conditions i) >λ λ 3 > >λ λ ii) +λ + λ + λ < (.6) in the second case (see [3]) imply that Theorem 3. gives no information about the realizability of the list Λ = {,λ,...,λ } : from Theorem 3. with t =3wehavethe partition Λ={,λ } {λ,λ } {λ 3 } with Γ = { λ,λ }; Γ = { λ,λ }; Γ 3 = {S} where S =+λ + λ 3 + λ + λ. From (.6), ii) and Lemma 3. it is easy to see that there is no a 3 3 symmetric nonnegative matrix with eigenvalues and diagonal entries,λ,λ 3 and λ, λ,s, respectively. The same occurs if we take ω = λ + S or ω = λ + S and ω = λ + S, with Γ 3 = {}. If we take t = in Theorem 3., that is, if we consider partitions as Λ={,λ } {λ,λ 3,λ } with Γ = { λ,λ }; Γ = { λ,λ 3,λ }, then from (.6), ii) wehave+λ < λ λ and therefore there is no a symmetric nonnegative matrix with eigenvalues,λ and diagonal entries λ, λ. A recent contribution to the solution of SNIEP for n =isduetoloewyand McDonald []. They describe the possible patterns (+, ) for which there exists
15 Volume 6, pp. -8, January 7 R. L. Soto, O. Rojo, J. Moro, and A. Borobia an extreme symmetric matrix with prescribed spectrum and show that one of these patterns yields to realizable points which have not been known previously. In [] is presented a graph related with the second unresolved case in [3]. In particular this graph considers points of the form (,λ,λ,λ 3,λ 3 ), which are plotted with λ on the horizontal axis and λ 3 on the vertical axis. Then the authors illustrate the boundaries of the following regions of realizable points: i) The boundary λ 3 = λ of the Soules set S, of the points that were shown to be realizable in [3]. We observe that every point in that boundary is indeed symmetrically realizable by Theorem. and consequently by Theorem 3.. ii) The boundary of the additional points that were identified as being realizable in [9] is the line segment from m to a =(,,,, ). These points have the form αm +( α)a, that is: (, + + α, + + α, + α, + α), (.7) where α. Observe that for α +, all points in (.7) have only nonnegative entries. Moreover, positive entries λ = λ 3 dominate λ = λ for α and therefore all these points are trivially realizable by the symmetric nonnegative matrix λ +λ λ λ A = λ λ λ +λ λ 3+λ λ 3 λ λ 3 λ λ 3+λ So, we consider points in (.7) for which <α. In order to see if Theorem 3. works here, we look for a 3 3 symmetric nonnegative matrix with eigenvalues and diagonal entries λ i :, + + ω i : ( + α, + + α. α)+β, ( + α)+γ,δ, respectively, where β +γ +δ =( α), the sum of the entries in αm+( α)a. Then by taking appropriately the numbers β, γ and δ, conditions of Lemma 3. are satisfied and the corresponding set Λ = {,λ,λ 3,λ,λ } is realizable by Theorem 3.. The points on the line segment from m to a have the form (,λ,λ,λ 3,λ 3 ), so they can be written as an even-conjugate vector (,λ,λ 3,λ 3,λ ). Then it is natural to analyze whether they are the spectrum of a symmetric nonnegative circulant matrix. This is the case for all points on the line from m to a. iii) The boundary of the new additional points identified in [] as realizable is given by a portion of the curve λ λ 3 =. The corresponding set of points is of the form (,λ,λ, λ, λ )where + λ 3. Let us see if Theorem 3. is
16 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra satisfied for this kind of points: For t =3wehave λ i :,λ,λ ω i :,,S, λ λ where S =+λ λ. Observe that in this case S < λ. A straight forward calculation shows that + λ <ω + ω, which contradicts conditions of Lemma 3.. For t =,λ i :,λ and ω i : λ, λ. Conditions ω and +λ = ω +ω are only satisfied for λ = 3, that is, for a point on the intersection with the boundary λ 3 = λ of the Soules set S. Hence, Theorem 3. gives no information about realizability of these points.. Examples. Example.. Let Λ = {7,,, 3,, 6}. Consider the partition and the associated realizable sets Λ = {7, 6}, Λ = {, }, Λ 3 = {, 3} Γ = {6, 6}, Γ = {, }, Γ 3 = {3, 3}. Here λ =7, λ =,λ 3 =andω =6, ω =, ω 3 =3. The conditions in Lemma 3. are satisfied. Then there exists a symmetric nonnegative matrix B with eigenvalues 7,, and diagonal entries 6,, 3. We have µ =7+ 6=6. From (3.3) B = Clearly, A = ( ) 6, A 6 = ( ), A 3 = ( ) 3 3 are symmetric nonnegative matrices realizing Γ, Γ, Γ 3, respectively. Let Ω = diag{6,, 3}. Then the matrix C defined in the proof of Theorem 3. is 3 C = 3 6, 6 while the matrices A and X are A = diag {A,A,A 3 },
17 Volume 6, pp. -8, January 7 6 R. L. Soto, O. Rojo, J. Moro, and A. Borobia X =. Then, the symmetric nonnegative matrix A + XCX T = has the prescribed eigenvalues 7,,, 3,, 6. Example.. Let Λ = {7,,,,,, 6}. The conditions of Theorem. are not satisfied. However, the conditions for the new symmetric realizability criterion, Theorem 3., are satisfied: consider the partition Λ = Λ Λ, where Λ = {7, 6}, Λ = {,,,, }, with associated symmetrically realizable sets Γ = {6, 6}, Γ = {6,,,, }. It is clear that there exists a symmetric nonnegative matrix with diagonal entries ω =6,ω = 6 and eigenvalues λ =7,λ =, namely, B = [ 6 6 By Theorem 3., there exists an 7 7 symmetric nonnegative matrix M with the prescribed spectrum Λ. Now we compute the matrix M. Firstly we obtain the symmetric matrices A, realizing Γ, and A, realizing Γ, (see [] for the way in which we obtain A ): A = [ 6 6 ], A = ]
18 Volume 6, pp. -8, January 7 Symmetric Nonnegative Realization of Spectra 7 Then A = [ ] [ A, C = A ] and Therefore, M = A + XCX T = X = 6 6 is a symmetric nonnegative matrix realizing Λ Acknowledgment. We thank the referee for comments and suggestions which improved the presentation. REFERENCES [] A. Borobia. On the Nonnegative Eigenvalue Problem. Linear Algebra Appl., 3/:3-, 99. [] A. Brauer. Limits for the characteristic roots of a matrix. IV: Aplications to stochastic matrices, Duke Math. J., 9 (9) 7-9. [3] P. D. Egleston, T. D. Lenker and S. K. Narayan. The nonnegative inverse eigenvalue problem. Linear Algebra Appl., 379:7-9,. [] M. Fiedler. Eigenvalues of nonnegative symmetric matrices. Linear Algebra Appl., 9:9-, 97. [] A. Horn. Doubly stochastic matrices and the diagonal of a rotation matrix. Amer. J. Math., 76:6-63, 9. [6] C. R. Johnson. Row stochastic matrices similar to doubly stochastic matrices. Linear Multilinear Algebra, :3-3, 98. [7] C.R.Johnson,T.J.Laffey,andR.Loewy.Therealandthesymmetricnonnegativeinverse eigenvalue problems are different. Proc.Amer.Math.Soc., :367-36, 996. [8] R. Kellogg. Matrices similar to a positive or essentially positive matrix. Linear Algebra Appl., :9-, 97.
19 Volume 6, pp. -8, January 7 8 R. L. Soto, O. Rojo, J. Moro, and A. Borobia [9] C. Knudsen and J. J. McDonald. A note on the convexity of the realizable set of eigenvalues for nonnegative symmetric matrices. Electron. J. Linear Algebra, 8:-,. [] T. J. Laffey and E. Meehan. A characterization of trace zero nonnegative matrices. Linear Algebra Appl. 3/33:9-3, 999. [] R. Loewy and D. London. A note on an inverse problem for nonnegative matrices. Linear Multilinear Algebra, 6:83-9, 978. [] R. Loewy and J. J. McDonald. The symmetric nonnegative inverse eigenvalue problem for matrices. Linear Algebra Appl., 393:7-98,. [3] J. J. McDonald and M. Neumann. The Soules approach to the inverse eigenvalue problem for nonnegative symmetric matrices with n. Contemp. Math. 9:387-7,. [] H. Perfect. Methods of constructing certain stochastic matrices. Duke Math. J., :39-, 93. [] H. Perfect. Methods of constructing certain stochastic matrices II. Duke Math. J., :3-3, 9. [6] N. Radwan. An inverse eigenvalue problem for symmetric and normal matrices. Linear Algebra Appl., 8:-9, 996. [7] R. Reams. An inequality for nonnegative matrices and the inverse eigenvalue problem. Linear Multilinear Algebra, :367-37, 996. [8] F. Salzmann. A note on eigenvalues of nonnegative matrices. Linear Algebra Appl., :39-338, 97. [9] R. Soto. Existence and construction of nonnegative matrices with prescribed spectrum. Linear Algebra Appl., 369:69-8, 3. [] R. Soto, A. Borobia, and J. Moro. On the comparison of some realizability criteria for the real nonnegative inverse eigenvalue problem. Linear Algebra Appl., 396:7-,. [] R. L. Soto. Realizability by symmetric nonnegative matrices. Proyecciones, :6-78,. [] R. L. Soto and O. Rojo. Applications of a Brauer Theorem in the nonnegative inverse eigenvalue problem. Linear Algebra Appl., 6:8-86, 6. [3] R. L. Soto. Realizability criterion for the symmetric nonnegative inverse eigenvalue problem. Linear Algebra Appl., 6:783-79, 6. [] G. Soules. Constructing symmetric nonnegative matrices. Linear Multilinear Algebra, 3:-, 983. [] H. R. Suleimanova. Stochastic matrices with real characteristic values. Dokl. Akad. Nauk, 66:33-3, 99. [6] G. Wuwen. An inverse eigenvalue problem for nonnegative matrices. Linear Algebra Appl., 9:67-78, 996.
On nonnegative realization of partitioned spectra
Electronic Journal of Linear Algebra Volume Volume (0) Article 5 0 On nonnegative realization of partitioned spectra Ricardo L. Soto Oscar Rojo Cristina B. Manzaneda Follow this and additional works at:
More informationREALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES
Proyecciones Vol. 4, N o 1, pp. 65-78, May 005. Universidad Católica del Norte Antofagasta - Chile REALIZABILITY BY SYMMETRIC NONNEGATIVE MATRICES RICARDO L. SOTO Universidad Católica del Norte, Chile
More informationA Note on the Symmetric Nonnegative Inverse Eigenvalue Problem 1
International Mathematical Forum, Vol. 6, 011, no. 50, 447-460 A Note on the Symmetric Nonnegative Inverse Eigenvalue Problem 1 Ricardo L. Soto and Ana I. Julio Departamento de Matemáticas Universidad
More informationA map of sufficient conditions for the real nonnegative inverse eigenvalue problem
Linear Algebra and its Applications 46 (007) 690 705 www.elsevier.com/locate/laa A map of sufficient conditions for the real nonnegative inverse eigenvalue problem Carlos Marijuán a, Miriam Pisonero a,
More informationA Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1
International Mathematical Forum, Vol, 06, no 3, 599-63 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/0988/imf0668 A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors Ricardo
More informationTHE REAL AND THE SYMMETRIC NONNEGATIVE INVERSE EIGENVALUE PROBLEMS ARE DIFFERENT
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 124, Number 12, December 1996, Pages 3647 3651 S 0002-9939(96)03587-3 THE REAL AND THE SYMMETRIC NONNEGATIVE INVERSE EIGENVALUE PROBLEMS ARE DIFFERENT
More informationThe Nonnegative Inverse Eigenvalue Problem
1 / 62 The Nonnegative Inverse Eigenvalue Problem Thomas Laffey, Helena Šmigoc December 2008 2 / 62 The Nonnegative Inverse Eigenvalue Problem (NIEP): Find necessary and sufficient conditions on a list
More informationarxiv: v2 [math.sp] 5 Aug 2017
Realizable lists via the spectra of structured matrices arxiv:70600063v [mathsp] 5 Aug 07 Cristina Manzaneda Departamento de Matemáticas, Facultad de Ciencias Universidad Católica del Norte Av Angamos
More informationOn characterizing the spectra of nonnegative matrices
1 / 41 On characterizing the spectra of nonnegative matrices Thomas J. Laffey (University College Dublin) July 2017 2 / 41 Given a list σ = (λ 1,..., λ n ) of complex numbers, the nonnegative inverse eigenvalue
More informationOn the M-matrix inverse problem for singular and symmetric Jacobi matrices
Electronic Journal of Linear Algebra Volume 4 Volume 4 (0/0) Article 7 0 On the M-matrix inverse problem for singular and symmetric Jacobi matrices Angeles Carmona Andres Encinas andres.marcos.encinas@upc.edu
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationMatrix 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 informationOn cardinality of Pareto spectra
Electronic Journal of Linear Algebra Volume 22 Volume 22 (2011) Article 50 2011 On cardinality of Pareto spectra Alberto Seeger Jose Vicente-Perez Follow this and additional works at: http://repository.uwyo.edu/ela
More informationTHE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED 2 p -ARY TREE
Proyecciones Vol 3, N o, pp 131-149, August 004 Universidad Católica del Norte Antofagasta - Chile THE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED p -ARY TREE OSCAR ROJO Universidad Católica del Norte,
More informationShort proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 35 2009 Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices Eric A. Carlen carlen@math.rutgers.edu
More informationThe symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009 Article 23 2009 The symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation Qing-feng Xiao qfxiao@hnu.cn
More informationNilpotent matrices and spectrally arbitrary sign patterns
Electronic Journal of Linear Algebra Volume 16 Article 21 2007 Nilpotent matrices and spectrally arbitrary sign patterns Rajesh J. Pereira rjxpereira@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationOn 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 informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
More informationGiven an n n matrix A, the spectrum of A is denoted by σ(a) and its spectral radius by
1 Some notation and definitions Given an n n matrix A, the spectrum of A is denoted by σ(a) and its spectral radius by ρ(a) = max{ λ λ σ(a)}. An eigenvalue λ of A is said to be dominant if λ = ρ(a). The
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationBounds 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 informationThe third smallest eigenvalue of the Laplacian matrix
Electronic Journal of Linear Algebra Volume 8 ELA Volume 8 (001) Article 11 001 The third smallest eigenvalue of the Laplacian matrix Sukanta Pati pati@iitg.ernet.in Follow this and additional works at:
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationOn 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 informationCopies of a rooted weighted graph attached to an arbitrary weighted graph and applications
Electronic Journal of Linear Algebra Volume 26 Volume 26 2013 Article 47 2013 Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications Domingos M. Cardoso dcardoso@ua.pt
More informationA note on a conjecture for the distance Laplacian matrix
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 5 2016 A note on a conjecture for the distance Laplacian matrix Celso Marques da Silva Junior Centro Federal de Educação Tecnológica
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationMore calculations on determinant evaluations
Electronic Journal of Linear Algebra Volume 16 Article 007 More calculations on determinant evaluations A. R. Moghaddamfar moghadam@kntu.ac.ir S. M. H. Pooya S. Navid Salehy S. Nima Salehy Follow this
More informationGeneralized Schur complements of matrices and compound matrices
Electronic Journal of Linear Algebra Volume 2 Volume 2 (200 Article 3 200 Generalized Schur complements of matrices and compound matrices Jianzhou Liu Rong Huang Follow this and additional wors at: http://repository.uwyo.edu/ela
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationA note on estimates for the spectral radius of a nonnegative matrix
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 22 2005 A note on estimates for the spectral radius of a nonnegative matrix Shi-Ming Yang Ting-Zhu Huang tingzhuhuang@126com Follow
More informationPairs of matrices, one of which commutes with their commutator
Electronic Journal of Linear Algebra Volume 22 Volume 22 (2011) Article 38 2011 Pairs of matrices, one of which commutes with their commutator Gerald Bourgeois Follow this and additional works at: http://repository.uwyo.edu/ela
More informationStructured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control
Electronic Journal of Linear Algebra Volume 34 Volume 34 08) Article 39 08 Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control Christian Mehl Technische Universitaet
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationMethods for Constructing Distance Matrices and the Inverse Eigenvalue Problem
Methods for Constructing Distance Matrices and the Inverse Eigenvalue Problem Thomas L. Hayden, Robert Reams and James Wells Department of Mathematics, University of Kentucky, Lexington, KY 0506 Department
More informationResearch Article On the Marginal Distribution of the Diagonal Blocks in a Blocked Wishart Random Matrix
Hindawi Publishing Corporation nternational Journal of Analysis Volume 6, Article D 59678, 5 pages http://dx.doi.org/.55/6/59678 Research Article On the Marginal Distribution of the Diagonal Blocks in
More informationA 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 informationNon-trivial solutions to certain matrix equations
Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 4 00 Non-trivial solutions to certain matrix equations Aihua Li ali@loyno.edu Duane Randall Follow this and additional works at: http://repository.uwyo.edu/ela
More informationNote 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 informationSingular value inequality and graph energy change
Electronic Journal of Linear Algebra Volume 16 Article 5 007 Singular value inequality and graph energy change Jane Day so@mathsjsuedu Wasin So Follow this and additional works at: http://repositoryuwyoedu/ela
More informationAn angle metric through the notion of Grassmann representative
Electronic Journal of Linear Algebra Volume 18 Volume 18 (009 Article 10 009 An angle metric through the notion of Grassmann representative Grigoris I. Kalogeropoulos gkaloger@math.uoa.gr Athanasios D.
More informationA new upper bound for the eigenvalues of the continuous algebraic Riccati equation
Electronic Journal of Linear Algebra Volume 0 Volume 0 (00) Article 3 00 A new upper bound for the eigenvalues of the continuous algebraic Riccati equation Jianzhou Liu liujz@xtu.edu.cn Juan Zhang Yu Liu
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More informationRETRACTED On construction of a complex finite Jacobi matrix from two spectra
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 On construction of a complex finite Jacobi matrix from two spectra Gusein Sh. Guseinov guseinov@ati.edu.tr Follow this and additional
More informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationInertially arbitrary nonzero patterns of order 4
Electronic Journal of Linear Algebra Volume 1 Article 00 Inertially arbitrary nonzero patterns of order Michael S. Cavers Kevin N. Vander Meulen kvanderm@cs.redeemer.ca Follow this and additional works
More informationMinimum rank of a graph over an arbitrary field
Electronic Journal of Linear Algebra Volume 16 Article 16 2007 Minimum rank of a graph over an arbitrary field Nathan L. Chenette Sean V. Droms Leslie Hogben hogben@aimath.org Rana Mikkelson Olga Pryporova
More informationDihedral groups of automorphisms of compact Riemann surfaces of genus two
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 36 2013 Dihedral groups of automorphisms of compact Riemann surfaces of genus two Qingje Yang yangqj@ruc.edu.com Dan Yang Follow
More informationOn Projection of a Positive Definite Matrix on a Cone of Nonnegative Definite Toeplitz Matrices
Electronic Journal of Linear Algebra Volume 33 Volume 33: Special Issue for the International Conference on Matrix Analysis and its Applications, MAT TRIAD 2017 Article 8 2018 On Proection of a Positive
More informationMoore 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 informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationZ-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 informationPositive definiteness of tridiagonal matrices via the numerical range
Electronic Journal of Linear Algebra Volume 3 ELA Volume 3 (998) Article 9 998 Positive definiteness of tridiagonal matrices via the numerical range Mao-Ting Chien mtchien@math.math.scu.edu.tw Michael
More informationA norm inequality for pairs of commuting positive semidefinite matrices
Electronic Journal of Linear Algebra Volume 30 Volume 30 (205) Article 5 205 A norm inequality for pairs of commuting positive semidefinite matrices Koenraad MR Audenaert Royal Holloway University of London,
More informationOn the maximum positive semi-definite nullity and the cycle matroid of graphs
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 16 2009 On the maximum positive semi-definite nullity and the cycle matroid of graphs Hein van der Holst h.v.d.holst@tue.nl Follow
More informationFiedler 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 informationA method for computing quadratic Brunovsky forms
Electronic Journal of Linear Algebra Volume 13 Volume 13 (25) Article 3 25 A method for computing quadratic Brunovsky forms Wen-Long Jin wjin@uciedu Follow this and additional works at: http://repositoryuwyoedu/ela
More informationMTH 2032 SemesterII
MTH 202 SemesterII 2010-11 Linear Algebra Worked Examples Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2011 ii Contents Table of Contents
More informationPositive definite preserving linear transformations on symmetric matrix spaces
Positive definite preserving linear transformations on symmetric matrix spaces arxiv:1008.1347v1 [math.ra] 7 Aug 2010 Huynh Dinh Tuan-Tran Thi Nha Trang-Doan The Hieu Hue Geometry Group College of Education,
More informationInterior points of the completely positive cone
Electronic Journal of Linear Algebra Volume 17 Volume 17 (2008) Article 5 2008 Interior points of the completely positive cone Mirjam Duer duer@mathematik.tu-darmstadt.de Georg Still Follow this and additional
More informationRecognition of hidden positive row diagonally dominant matrices
Electronic Journal of Linear Algebra Volume 10 Article 9 2003 Recognition of hidden positive row diagonally dominant matrices Walter D. Morris wmorris@gmu.edu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationLinear Algebra 2 Spectral Notes
Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex
More informationOn the distance spectral radius of unicyclic graphs with perfect matchings
Electronic Journal of Linear Algebra Volume 27 Article 254 2014 On the distance spectral radius of unicyclic graphs with perfect matchings Xiao Ling Zhang zhangxling04@aliyun.com Follow this and additional
More informationReview of Some Concepts from Linear Algebra: Part 2
Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set
More informationE2 212: Matrix Theory (Fall 2010) Solutions to Test - 1
E2 212: Matrix Theory (Fall 2010) s to Test - 1 1. Let X = [x 1, x 2,..., x n ] R m n be a tall matrix. Let S R(X), and let P be an orthogonal projector onto S. (a) If X is full rank, show that P can be
More informationA factorization of the inverse of the shifted companion matrix
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 A factorization of the inverse of the shifted companion matrix Jared L Aurentz jaurentz@mathwsuedu Follow this and additional
More informationPolynomial numerical hulls of order 3
Electronic Journal of Linear Algebra Volume 18 Volume 18 2009) Article 22 2009 Polynomial numerical hulls of order 3 Hamid Reza Afshin Mohammad Ali Mehrjoofard Abbas Salemi salemi@mail.uk.ac.ir Follow
More informationPotentially nilpotent tridiagonal sign patterns of order 4
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 50 2016 Potentially nilpotent tridiagonal sign patterns of order 4 Yubin Gao North University of China, ybgao@nuc.edu.cn Yanling
More informationLinear 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 informationInequalities 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 informationBlock Representation and Spectral Properties of Constant Sum Matrices
Electronic Journal of Linear Algebra Volume 34 Volume 34 (2018 Article 13 2018 Block Representation and Spectral Properties of Constant Sum Matrices Sally L. Hill School of Mathematics Cardiff University,
More informationProperties for the Perron complement of three known subclasses of H-matrices
Wang et al Journal of Inequalities and Applications 2015) 2015:9 DOI 101186/s13660-014-0531-1 R E S E A R C H Open Access Properties for the Perron complement of three known subclasses of H-matrices Leilei
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationThe Jordan forms of AB and BA
Electronic Journal of Linear Algebra Volume 18 Volume 18 (29) Article 25 29 The Jordan forms of AB and BA Ross A. Lippert ross.lippert@gmail.com Gilbert Strang Follow this and additional works at: http://repository.uwyo.edu/ela
More informationInequalities involving eigenvalues for difference of operator means
Electronic Journal of Linear Algebra Volume 7 Article 5 014 Inequalities involving eigenvalues for difference of operator means Mandeep Singh msrawla@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationExtremal graphs for the sum of the two largest signless Laplacian eigenvalues
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 41 2015 Extremal graphs for the sum of the two largest signless Laplacian eigenvalues Carla Silva Oliveira Escola Nacional de Ciencias
More informationThe 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 informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationSingular Value and Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 8 2017 Singular Value Norm Inequalities Associated with 2 x 2 Positive Semidefinite Block Matrices Aliaa Burqan Zarqa University,
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationA new parallel polynomial division by a separable polynomial via hermite interpolation with applications, pp
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012 Article 54 2012 A new parallel polynomial division by a separable polynomial via hermite interpolation with applications, pp 770-781 Aristides
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationOn (T,f )-connections of matrices and generalized inverses of linear operators
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 33 2015 On (T,f )-connections of matrices and generalized inverses of linear operators Marek Niezgoda University of Life Sciences
More information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k of the form
LINEARIZATIONS OF SINGULAR MATRIX POLYNOMIALS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M. DOPICO, AND D. STEVEN MACKEY Abstract. A standard way of dealing with a regular matrix polynomial
More informationUniqueness 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 informationMATH 235. Final ANSWERS May 5, 2015
MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationOn EP elements, normal elements and partial isometries in rings with involution
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012 Article 39 2012 On EP elements, normal elements and partial isometries in rings with involution Weixing Chen wxchen5888@163.com Follow this
More informationRow and Column Distributions of Letter Matrices
College of William and Mary W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2016 Row and Column Distributions of Letter Matrices Xiaonan Hu College of William and
More informationA note on simultaneous block diagonally stable matrices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 7 2013 A note on simultaneous block diagonally stable matrices I. Bras A. C. Carapito carapito@ubi.pt P. Rocha Follow this and additional
More informationPermutation transformations of tensors with an application
DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn
More informationIn particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with
Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient
More information1 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 informationH-matrix theory vs. eigenvalue localization
Numer Algor 2006) 42: 229 245 DOI 10.1007/s11075-006-9029-3 H-matrix theory vs. eigenvalue localization Ljiljana Cvetković Received: 6 February 2006 / Accepted: 24 April 2006 / Published online: 31 August
More information