Eigenvalues and eigenvectors of tridiagonal matrices
|
|
- Adam Daniel
- 5 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 15 Volume ) Article Eigenvalues and eigenvectors of tridiagonal matrices Said Kouachi kouachisaid@caramailcom Follow this and additional works at: Recommended Citation Kouachi, Said 006), "Eigenvalues and eigenvectors of tridiagonal matrices", Electronic Journal of Linear Algebra, Volume 15 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@uwyoedu
2 Volume 15, pp , April EIGENVALUES AND EIGENVECTORS OF TRIDIAGONAL MATRICES SAID KOUACHI Abstract This paper is continuation of previous work by the present author, where explicit formulas for the eigenvalues associated with several tridiagonal matrices were given In this paper the associated eigenvectors are calculated explicitly As a consequence, a result obtained by Wen- Chyuan Yueh and independently by S Kouachi, concerning the eigenvalues and in particular the corresponding eigenvectors of tridiagonal matrices, is generalized Expressions for the eigenvectors are obtained that differ completely from those obtained by Yueh The techniques used herein are based on theory of recurrent sequences The entries situated on each of the secondary diagonals are not necessary equal as was the case considered by Yueh Key words Eigenvectors, Tridiagonal matrices AMS subject classifications 15A18 1 Introduction The subject of this paper is diagonalization of tridiagonal matrices We generalize a result obtained in 5] concerning the eigenvalues and the corresponding eigenvectors of several tridiagonal matrices We consider tridiagonal matrices of the form α + b c a 1 b c a b A n = 0 0, 1) 0 cn a n 1 β + b where {a j } n 1 j=1 and {c j} n 1 j=1 are two finite subsequences of the sequences {a j} j=1 and {c j } j=1 of the field of complex numbers C, respectively, and α, β and b are complex numbers We suppose that a j c j = { d 1, if j is odd d, if j is even j =1,,, ) where d 1 and d are complex numbers We mention that matrices of the form 1) are of circulant type in the special case when α = β = a 1 = a = =0andall the entries on the subdiagonal are equal They are of Toeplitz type in the special case when α = β = 0 and all the entries on the subdiagonal are equal and those on the superdiagonal are also equal see U Grenander and G Szego 4]) When the Received by the editors 9 January 006 Accepted for publication 1 March 006 Handling Editor: Ludwig Elsner Laboratoire de mathematiques, Universite de badji, Mokhtar, Annaba, 300, Algeria kouachisaid@caramailcom) 115
3 Volume 15, pp , April S Kouachi entries on the principal diagonal are not equal, the calculi of the eigenvalues and the corresponding eigenvectors becomes very delicate see S Kouachi 6]) When a 1 = a = = c 1 = c = =1,b = andα = β = 0, the eigenvalues of A n has been constructed by J F Elliott ] and R T Gregory and D Carney 3] to be kπ λ k = +cos,k=1,,, n n +1 When a 1 = a = = c 1 = c = =1,b = andα =1andβ =0orβ =1,the eigenvalues has been reported to be and λ k = +cos kπ,k=1,,, n, n kπ λ k = +cos,k=1,,, n, n +1 respectively without proof W Yueh1] has generalized the results of J F Elliott ] and R T Gregory and D Carney 3] to the case when a 1 = a = = a, c 1 = c = = c and α =0,β= ac or α =0,β= ac or α = β = ac α = β = ac or α = β = ac He has calculated, in this case, the eigenvalues and their corresponding eigenvectors λ k = b + ac cos θ k,k=1,, n, where θ k = kπ n, kπ n n, k =1,, n respectively In S Kouachi5], we have generalized the results of W Yueh 1] to more general matrices of the form 1) for any complex constants satisfying condition n+1, k 1)π n+1, k 1)π and k 1)π a j c j = d,j=1,,, where d is a complex number We have proved that the eigenvalues remain the same as in the case when the a i s and the c i s are equal but the components of the eigenvector u k) σ) associated to the eigenvalue λ k, which we denote by u k) j σ),j=1,, n,are of the form u k) j σ) = d) 1 j a σ1 a σj 1 u k) d sinn j +1)θ k β sinn j)θ k 1,j=1,, n, d sin nθ k β sinn 1)θ k where θ k is given by formula d sin n +1)θ k d α + β)sinnθ k + αβ sin n 1) θ k =0,k=1,, n Recently in S Kouachi 6], we generalized the above results concerning the eigenvalues of tridiagonal matrices 1) satisfying condition ), but we were unable to calculate the corresponding eigenvectors, in view of the complexity of their expressions The
4 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 117 matrices studied by J F Elliott ] and R T Gregory and D Carney 3] are special cases of those considered by W Yueh1] which are, at their tour, special cases with regard to those that we have studied in S Kouachi 5] All the conditions imposed in the above papers are very restrictive and the techniques used are complicated and are not in general) applicable to tridiagonal matrices considered in this paper even tough for small n For example, our techniques are applicable for all the 7 7 matrices A 7 = i i 7 5 7i i and A 7 = i i i i 5 8i i 5 18i i 5 +i i 5 3 6, and guarantee that they possess the same eigenvalues and in addition they give their exact expressions formulas 15) lower) since condition ) is satisfied: λ 1,λ 4 =5± 3 ) ) + 3 ) 6 4 ) cos λ,λ 5 =5± 3 ) ) + 3 ) 6 4 ) cos λ 3,λ 6 =5± 3 ) ) + 3 ) 6 4 ) cos λ 7 = ), π 7 4π 7 6π 7 whereas the recent techniques are restricted to the limited case when the entries on the subdiagonal are equal and those on the superdiagonal are also equal and the direct calculus give the following characteristic polynomial P λ) =λ ) 6 35 λ ) λ 5 + ) ) λ ), ), ), ) λ λ 3 +
5 Volume 15, pp , April S Kouachi ) λ ) for which the roots are very difficult to calculate degree of P 5) If σ is a mapping not necessary a permutation) from the set of the integers from 1to n 1) into the set of the integers different of zero N, we denote by A n σ) the n n matrix α + b c σ a σ1 b c σ a σ b A n σ) = ) 0 cσn a σn 1 β + b and by n σ) = n σ) λi n its characteristic polynomial If σ = i, where i is the identity, then A n i) and its characteristic polynomial n i) will be denoted by A n and n respectively Our aim is to establish the eigenvalues and the corresponding eigenvectors of the matrices A n σ) The Eigenvalue Problem Throughout this section we suppose d 1 d 0In the case when α = β =0,thematrixA n σ) and its characteristic polynomial will be denoted respectively by A 0 n σ) and 0 n σ) and in the general case they will be denoted by A n and n We put where Y = d 1 + d +d 1d cos θ, 3) Y = b λ 31) In S Kouachi 6], we have proved the following result Theorem 1 When d 1 d 0, the eigenvalues of the class of matrices A n σ) on the form 11) are independent of the entries a i,c i,i=1,, n 1) and of the mapping σ provided that condition ) is satisfied and their characteristic determinants are given by n =d 1 d ) m 1 d 1d Y α β)sinm+1)θ+αβy αd 1 βd ) sin mθ sin θ, 4a) when n =m +1 is odd and d1d sinm+1)θ+αβ+d m 1 α+β)y ] d sin mθ+αβ 1 sinm 1)θ n =d 1 d ) d sin θ, 4b) when n =m is even
6 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 119 Proof Whenα = β = 0, formulas 4a) and 4b) become, respectively when n =m +1isoddand 0 n =d 1 d ) m Y sin m +1)θ, 4a0) sin θ sinm +1)θ + d sin mθ 0 n =d 1d ) m d 1, 4b0) sin θ when n =m is even Since the right hand sides of formulas 4a0) and 4b0) are independent of σ, then to prove that the characteristic polynomial of A 0 n σ), which we denote by 0 n, is also, it suffices to prove them for σ = i Expanding 0 n in terms of it s last column and using ) and 3), we get 0 n = Y 0 n 1 d 0 n,n=3,, 4a1) when n =m +1isoddand 0 n = Y 0 n 1 d 1 0 n,n=3,, 4b1) when n =m is even Then by writing the expressions of 0 n for n =m +1, m and m 1respectively, multiplying 0 m and 0 m 1 by Y and d 1 respectively and adding the three resulting equations term to term, we get 0 m+1 = Y d 1 d ) 0 m 1 d 1 d 0 m 3, 4a) We will prove by induction in m that formula 4a0) is true If n =m + 1is odd, for m =0andm = 1formula 4a0) is satisfied Suppose that it is satisfied for all integers <m, then from 4a) and using 3), we get 0 m+1 = Y d 1d ) m sinmθ cos θ sin m 1) θ sin θ Using the well known trigonometric formula sinη cos ζ =sinη + ζ)+sinη ζ), *) for η = mθ and ζ = θ, we deduce formula 4a0) When n =m is even, applying formula 4a1) for n =m +1, we get 0 m = 0 m+1 + d 0 m 1 Y By direct application of 4a0) two times, for n =m +1andn =m 1,tothe right hand side of the last expression, we deduce 4b0) If we suppose that α 0orβ 0, then expanding n in terms of the first and last columns and using the linear property of the determinants with regard to its columns, we get
7 Volume 15, pp , April S Kouachi Y c 0 0 n = 0 n α a Y E n 1 β E 1 n 1 + αβ 0 0 cn 0 0 a n Y where En 1 1 and E n 1 are the n 1) square matrices of the form 1), En 1 i = Y c i 0 0 a i Y 0 0 cn+i 3 0 a n+i 3 Y,i=1, Since all the entries a i s on the subdiagonal and c i s on the superdiagonal satisfy condition ), then using formulas 4a0) and 4b0) and taking in the account the order of the entries a i s and c i s, we deduce the general formulas 4a) and 4b) Before proceeding further, let us deduce from formula 4b) a proposition for the matrix B n σ) which is obtained from A n σ) by interchanging the numbers α and β Proposition When n is even, the eigenvalues of B n σ) are the same as A n σ) Let us see what formula 4) says and what it does not say It says that if a i,c i,i= 1,, n 1are other constants satisfying condition ) and α + b c a 1 b c a A b n = c n a n 1 β + b then the matrices A n, A n and A n σ) possess the same characteristic polynomial and hence the same eigenvalues Therefore we have this immediate consequence of formula 4) Corollary 3 The class of matrices A n σ), whereσ is a mapping from the set of the integers from 1 to n 1) into N are similar provided that all the entries on the subdiagonal and on the superdiagonal satisfy condition ) The components of the eigenvector u k) σ), k =1,, n associated to the eigenvalue λ k, k =1,, n, which we denote by u k) j, j =1,, n,aresolutionsofthe
8 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 11 linear system of equations α + k )u k) 1 + c σ1 u k) =0, a σ1 u k) 1 + k u k) + c σ u k) 3 =0, a σn 1 u k) n 1 + β + k)u k) n =0, 5) where k = Y is given by formula 3) and θ k, k =1,, n are solutions of d 1 d k α β)sinm +1)θ k + αβ k αd 1 βd ) sin mθk =0, 6a) when n =m +1isoddand d 1 d sinm +1)θ k + αβ + d α + β) ] k sin mθk + αβ d 1 sinm 1)θ k =0, 6b) d when n =m is even Since these n equations are linearly dependent, then by eliminating the first equation we obtain the following system of n 1) equations and n 1) unknowns, written in a matrix form as k c σ 0 0 a σ k 0 0 cσn a σn 1 β + k ) u k) u k) 3 u k) n = a σ1 u k) ) The determinant of this system is given by formulas 4) for α =0andn replaced by n 1and equal to k) n 1 =d 1d ) m 1 d 1 d sinm +1)θ k + d 1 β k ] sin mθk sin θ k, 8a) when n =m +1isoddand d 1 k β)sinmθ k β sinm 1)θ k n 1 =d 1d ) m 1 d, 8b) sin θ k k) when n =m is even, for all k =1,, n u k) j σ) = Γk) j σ),j,k=1,, n, 9) k) n 1
9 Volume 15, pp , April S Kouachi where Γ k) j σ) = k c σ 0 a σ1 u k) a σ k cσj 0 0 a σj k 0 0 aσj 1 0 c σj 0 k 0 aσj +1 cσn a σn 1 β + k ), j =,, n, k =1,, n By permuting the j first columns with the j 1)-th one and using the properties of the determinants, we get u k) j σ) = 1) j Λk) j where Λ k) j σ) is the determinant of the matrix C k) j σ) = σ),j=,, n, 10) n 1 T k) j 1 σ) 0 0 S k) n j σ) ), where T k) j 1 σ) = a σ1 u k) 1 k c σ a σ 0 0 cσj 0 0 k 0 0 a σj 1 is the supertriangular matrix of order j 1with diagonal a σ1 u k) 1,a σ,, a σj 1 ) and k c σj S k) n j σ) = a σj cσn a σn 1 β + k ),
10 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 13 is a tridiagonal matrix of order n j belonging to the class of the form 11) and satisfying condition ) Thus C k) j σ) = T k) S j 1 σ) k) n j σ) 11) = a σ1 a σj 1 u k) 1 k) n j,j=,, n and k =1,, n, where k) n j σ) is given by formulas 4) for α =0andn 1replaced by n j k) n j = when n is odd and k) n j = d 1 d ) n j 1 d 1d sin n j d 1 d ) n j 1 d 1 d ) n j 1 +1)θ k+d 1 β k) sin n j θ k sin θ k k β)sin n j+1 )θ k β d d 1 sin n j 1 sin θ k )θ k, when j is odd,, when j is even, 1a) d k β)sin n j 1 1 )θ k β sin n j 1 )θ k d sin θ k, when j is odd, d 1 d ) n j 1 d 1d sin n j +1)θ k+d β k) sin n j θ k sin θ k, when j is even, 1b) when n is even, for all j =,, n and k =1,, n Using formulas 9)-1), we get Finally u k) j u k) j σ) = 1) j 1 a σ1 a σj 1 u k) k) n j 1 σ) =µ j σ) u k) 1 when n is odd and u k) j σ) =µ j σ) u k) 1 k) n 1 d 1d sin n j +1)θ k+d 1 β k) sin n j θ k d 1d sin n+1 )θ k+d 1 β k) sin n 1 d1 d k β)sin n j+1 )θ k β d d 1 sin n j 1 )θ k d 1d sin n+1 )θ k+d 1 β k) sin n 1 k β)sin n j 1 )θ k β d 1 d sin n j 1 )θ k k β)sin n θ k β d 1 d sin n 1)θ k 1 d 1d sin n j +1)θ k+d β k) sin n j θ k d1d,j=,, n and k =1,, n 13) k β)sin n θ k β d 1 d sin n 1)θ k )θ k, when j is odd,, when j is even, )θ k 13a), when j is odd,, when j is even, 13b)
11 Volume 15, pp , April S Kouachi for all j =,, n and k =1,, n, whenn is even, where µ j σ) = d 1 d ) 1 j aσ1 a σj 1,j=,, n, ) k = Y and θ k are given respectively by 3) and formulas 6) 3 Special Cases From now on, we put ρ j σ) = where µ j σ) isgivenby ) 31 Case when n is odd If α = β =0, we have d 1 d ) n 1 µj σ), j =1,, n, ) Theorem 31 If α = β =0,the eigenvalues λ k σ), k =1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=1,, n 1) and of σ provided that condition ) is satisfied and they are given by b + d 1 + d +d 1d cos θ k, k =1,, m, λ k = b d 1 + d +d 1d cos θ k, k = m +1,, m, 14) The corresponding eigenvectors u k) σ) = given by u k) j σ) =ρ j σ) and u k) j σ) = b, k = n u k) 1 σ),, u k) n σ)) t,k=1,, n 1 are d 1 d sin n j +1)θ k + d n j 1 sin θ k, when is j odd, d1 d b λ k )sin n j+1 )θ k, when is j even, a σ1 a σj 1 d ) n j, when j is odd, 0, when j is even, 14a) 14b) j =1, n, whereρ j σ) is given by ) and θ k = kπ n+1, k =1,, m, k m)π n+1, k = m +1,, m Proof, We take a σ0 = a 0 = 1 The eigenvalues λ k, k =1,, m are trivial consequence of 4) by putting m +1)θ = kπ, k =1,, m and using 3) The
12 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 15 eigenvalue λ n is a consequence of 4) and 31) by putting Y = 0 Formula 14a) is a trivial consequence of 13a) by taking β = 0 and choosing u k) 1 = ) n 1 d 1 d d 1 d sin n +1 ) ] n 1 )θ k + d 1 sin θ k,k=1,, n 1 Concerning the n th eigenvector, we solve directly system 7) and choose u n) 1 = d ) n 1 If α = d and β = d 1 or β = d 1 and α = d, then using the trigonometric formula *) for η = m+1 )θ k and ζ = θ k, formula 6a) becomes m +1) k ± d 1 + d )) sin θ k cos θ k =0, 6a1) then we get Theorem 3 If α = d and β = d 1 or β = d 1 and α = d,the eigenvalues λ k σ),k=1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=1,, n 1) andofσ provided that condition ) is satisfied and they are given by b + d 1 + d +d 1d cos θ k, k =1,, m, λ k = b d 1 + d +d 1d cos θ k, k = m +1,, m, 15) b α + β), k = n t The corresponding eigenvectors u k) σ) = u k) 1 σ),, u k) n σ)), k =1,, n are given by d sin n j u k) +1)θ k +d 1 b + λ k ]sin n j θ k,j is odd, j σ) =ρ j σ) d d d1 1 b + λ k )sin n j+1 )θ k + d sin n j 1 ] )θ k,j is even, 15a) k =1, n 1 and u n) j σ) =ρ j σ) j =1,, n, whenα = d and β = d 1 and u k) j σ) =ρ j σ) 1, when j is odd, d d 1, when j is even, d sin n j +1)θ k +d 1 + b λ k ]sin n j θ k,j is odd, d d d1 1 + b λ k )sin n j+1 )θ k + d sin n j 1 ] )θ k,j is even, 15b)
13 Volume 15, pp , April S Kouachi k =1, n 1 and 1, when j is odd, u n) j σ) =ρ j σ) d d 1, when j is even, j =1,, n, whenβ = d 1 and α = d, j =1,, n, whereρ j σ) is given by ) and kπ n, k =1,, m, θ k = k m)π n, k = m +1,, m Proof Formula 15) is a simple consequence of 6a1) Using 13a), the expressions 15a) and 15b) are trivial by choosing u k) 1 = ) n 1 d 1 d d sin n +1 ) ] n 1 )θ k +d 1 b + λ k ]sin θ k, if α = d and β = d 1 and u k) 1 = ) n 1 d 1 d d sin n +1 ) ] n 1 )θ k +d 1 + b λ k ]sin θ k, when β = d 1 and α = d The last eigenvector is obtained by choosing u n) 1 σ) = ) n 1 d 1 d aσ1 a σj 1 formula When α = d and β = d 1 or α = d and β = d 1, then using the trigonometric cosη sin ζ =sinη + ζ) sinη ζ), **) for η = m+1 )θ k and ζ = θ k, formula 4a) becomes then we get k ± d d 1 )) cos m +1) θ k sin θ k =0, 6a) Theorem 33 If α = d and β = d 1 or β = d 1 and α = d,the eigenvalues λ k σ),k=1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=1,, n 1) andofσ provided that condition ) is satisfied and they are given by b + d 1 + d +d 1d cos θ k, k =1,, m, λ k = b d 1 + d +d 1d cos θ k, k = m +1,, m, 16) b α + β), k = n
14 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 17 t The corresponding eigenvectors u k) σ) = u k) 1 σ),, u k) n σ)), k =1,, n are given by 15a) and u n) 1) j 1 j σ) =ρ j σ), when j is odd, d d 1 1) j+ j =1,, n,, when j is even, when α = d and β = d 1 and 15b) and u n) 1) j 1 j σ) =ρ j σ), when j is odd, d d 1 1) j, when j is even, when β = d 1 and α = d,where ρ j σ) is given by ) and θ k = { k 1)π n, k =1,, m, k m) 1)π n, k = m +1,, m j =1,, n, Proof Formula 16) is trivial by solving 6a) Concerning the eigenvectors, following the same reasoning as in the case when α = d and β = d 1 or β = d 1 and α = d and since we use formula 13a) to find the components of the eigenvectors which depend only of β, we deduce the same results The last eigenvector is obtained by passage to the limit in formula 13a) when θ k tends to π and choosing the first component as in the previous case 3 Case when n is even If αβ = d, then using *) for η = mθ k and ζ = θ k, formula 6b) becomes d1 d cos θ k + αβ + d α + β) ] k sin mθk =0 Using 3), we get k α + β) k + d ] d 1 sin mθk =0, 6b1) which gives sin mθ k =0 and k α + β) k + d d 1 =0, 3) then we get Theorem 34 If αb = d,the eigenvalues λ k σ), k =1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=1,, n 1)
15 Volume 15, pp , April S Kouachi and of σ provided that condition ) is satisfied and they are given by b + d 1 + d +d 1d cos θ k, k =1,, m 1, b d 1 + d +d 1d cos θ k, k = m,, m, λ k = α + β)+ α β) +4d 1 17) b +, k = n 1, α + β) α β) +4d 1 b +, k = n t The corresponding eigenvectors u k) σ) = u k) 1 σ),, u k) n σ)),k=1,, n are given by b λ k β)sin n j 1 u k) )θ k β d 1 sin n j 1 d )θ k,j is odd, j σ) =ρ j σ) 1 d1 d1d d sin n j +1)θ k + d β b λ k ) ) sin n j θ k],jeven 17a) where ρ j σ), j =1,, n is given by ) and θ k = kπ n, k =1,, m 1, k m+1)π n, k = m,, m The eigenvectors u n 1) σ) and u n) σ) associated respectively with the eigenvalues λ n 1 and λ n are given by formula 13b), where θ k is given by 3), 31) and 3) Proof Formula 17) is a consequence of 6b1) The eigenvectors are a consequence of formula 13b) by choosing u k) 1 = b λ ) n 1 k β)sin n θ k β d 1 sin n d 1)θ k, when j is odd, d 1 d b λ k β)sin n θ k β d 1 sin n d 1)θ k, when j is even When α = β = ±d, then, using **), formula 6b) gives d 1 d cos mθ =0, 6b) then we have Theorem 35 If α = β = ±d,the eigenvalues λ k σ), k =1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=
16 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 19 1,, n 1) andofσ provided that condition ) is satisfied and they are given by b + d 1 + d +d 1d cos θ k, k =1,, m, λ k = b 18) d 1 + d +d 1d cos θ k, k = m +1,, n, t The corresponding eigenvectors u k) σ) = u k) 1 σ),, u k) n σ)), k =1,, n are given by b λ k d )sin n j 1 u k) )θ k d 1 sin n j 1 )θ k,j is odd, j σ) =ρ j σ) d 1 d sin n j +1)θ k + d d b λ k ) ] sin n j θ k,j is even, 18a) when α = β = d and b λ k + d )sin n j 1 u k) )θ k + d 1 sin n j 1 )θ k,j is odd, j σ) =ρ j σ) d 1 d sin n j +1)θ k + d + d b λ k ) ] sin n j θ k,j is even, 18b) when α = β = d where ρ j σ), j =1,, n is given by ) and θ k = k 1)π n, k =1,, m, k m 1)π n, k = m +1,, n Proof Formula 18) is a consequence of 6b)The eigenvectors are a consequence of formula 13b) by choosing u k) 1 = ) n 1 b λ k d )sin n θ k d 1 sin n 1)θ k, when j =l +1 d 1 d d1 d b λk d )sin n θ k d 1 sin n 1)θ ] k, when j =l when α = β = d u k) 1 = ) n 1 b λ k + d )sin n θ k + d 1 sin n 1)θ k, when j =l +1 d 1 d d1 d b λk + d )sin n θ k + d 1 sin n 1)θ ] k, when j =l when α = β = d 4 Case when d 1 d =0 In this case, we have proved in S Kouachi 6], the following Proposition 41 When d 1 d =0,the eigenvalues λ k σ), k =1,, n of the class of matrices A n σ) on the form 11) are independent of the entries a i,c i,i=
17 Volume 15, pp , April S Kouachi 1,, n 1) andofσ provided that condition ) is satisfied and their characteristic polynomials are given by d) n 1 1 α) ) β d, when n is odd; n = d) n 1 α + β) + αβ ) 19a), when n is even, when d 1 =0and n = d1) n 1 1 β) ) α d 1, when n is odd; 19b) d1) n ) α d 1 ) β d 1, when n is even, when d =0,where = Y is given by 3) An immediate consequence of this proposition is Proposition 4 If d 1 d =0,the eigenvalues λ k σ),k=1,, n of the class of matrices A n σ) on the form 11)are independent of the entries a i,c i,i=1,, n 1) and of σ provided that condition ) is satisfied: 1) When α = β =0, they are reduced to three eigenvalues when d 1 =0or when n is odd and d =0 and only two eigenvalues { b ± d, b} { b ± d 1, b} { b ± d 1 } when n is even and d =0 ) When α 0or β 0, they are reduced to five eigenvalues { : b ± d, b α, b 1 β ± 1 } β +4d when n is odd and d 1 =0,fivealso { b ± d 1,b β, b 1 α ± 1 } α +4d 1 when n is odd and d =0,four {b ± d,b α, b β} when n is even and d 1 =0and six eigenvalues { b ± d 1,b 1 α ± 1 α +4d 1, b 1 β ± 1 } β +4d 1
18 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 131 when n is even and d =0 3) All the corresponding eigenvectors u k) σ) = are are simple and given by 31)When λ k is simple u k) j σ) =ν j σ) when d 1 =0and u k) j σ) =ν j σ) ] n j b λ k ) d,whenj is odd, u k) 1 σ),, u k) n σ)) t, k =1,, n ] n j 1,n is odd, b λ k ) d b λ k ),whenj is even, ] 1+n j b λ k ) d,whenj is odd, ] n j b λ k ) d b λ k ),whenj is even,,n is even,, 0a) ] n j b λ k ) b λ k ) d 1,whenj is odd,,n is odd, ] n j 1 b λ k ) d +1 1,whenj is even, ] n 1 j b λ k ) b λ k ) d 1,whenj is odd,,n is even, ] n j b λ k ) d 1,whenj is even, 0b) when d =0,j=,, n and k =1,, n,where ν j σ) = 1) n j a σ1 a σj 1,j =,, n 3) When λ k is multiple, then all the components are zero except the last four ones at most and which we calculate directly Proof The expressions of the eigenvalues are trivial by annulling the corresponding characteristic determinants Following the same reasoning as the case d 1 d 0, by solving system 7), we get the expressions of the eigenvectors by formulas 13) ]] k) u k) j σ) = 1) n 1 ν j σ) u k) n j 1,j=,, n and k =1,, n, k) n 1 where ]] denote the reduced fraction ) k d m ) ) k) n 1 = k d k β k d, when n =m + 1is odd, ) k d m k β), k ) d, when n =m is even,
19 Volume 15, pp , April S Kouachi when d 1 =0and k) n 1 = ) k d m 1 1 k β ), when n =m + 1is odd, k ) k d m ) 1 k k β k d 1, when n =m is even, when d =0 k) n j = when d 1 =0and k) n j = k d) n j ) ) k d k β k d,whenj is odd, n is odd, k d) n j 1 1 ) k k β k d,whenj is even k d) n j 1 1 k β) k ) d,whenj is odd, n is even, k d) n j 1 ) k β k,whenj is even, k d1) n j 1 ) k β k,whenj is odd, k d1) n j 1 1 k β) n is odd; ) k d 1,whenj is even k d1) n j 1 1 ) k k β k d 1,whenj is odd, n is even, k d1) n j ) ) k d 1 k β k d 1,whenj is even when d =0 Then, when d 1 =0,wehave k d) 1 j u k) j σ) = 1) n 1 ν j σ),whenj is odd, k d ) j k,whenj is even k d ) 1 j,whenj is odd, k d ) j k,whenj is even, n is odd, n is even, j =,, n and k =1,, n By putting j = n, calculatingu k) 1 according to u k) n σ) and choosing u k) n σ) =a σ1 a σn 1,
20 Volume 15, pp , April Eigenvalues and Eigenvectors of Tridiagonal Matrices 133 we get 0a) Following the same reasoning as in the case when d 1 = 0, we deduce 0b) Acknowledgment The author thanks the superior education ministry and the national agency of development and scientific research ANDRU) for their financial support REFERENCES 1] Wen-Chyuan Yueh Eigenvalues of several tridiagonal matrices Applied Mathematics E-Notes, 5:66 74, 005 ] J F Elliott The characteristic roots of certain real symmetric matrices Master s thesis, Univ of Tennessee, ] R T Gregory and D Carney A Collection of Matrices for Testing Computational Algorithm Wiley-Interscience, New York, ] U Grenander and G Szego Toeplitz Forms and Their Applications University of California Press, Berkeley and Los Angeles, ] S Kouachi Eigenvalues and eigenvectors of several tridiagonal matrices Submitted to the Bulletin of the Belgian Mathematical Society 6] S Kouachi Eigenvalues and eigenvectors of tridiagonal matrices with non equal diagonal entries In preparation 7] S Kouachi Explicit Eigenvalues of tridiagonal matrices To appear in Applied Mathematics E-Notes
Non-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 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 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 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 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 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 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 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 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 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 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 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 informationAnalytic roots of invertible matrix functions
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 15 2005 Analytic roots of invertible matrix functions Leiba X. Rodman lxrodm@math.wm.edu Ilya M. Spitkovsky Follow this and additional
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 informationMath 240 Calculus III
Generalized Calculus III Summer 2015, Session II Thursday, July 23, 2015 Agenda 1. 2. 3. 4. Motivation Defective matrices cannot be diagonalized because they do not possess enough eigenvectors to make
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 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 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 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 informationINTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES
Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s36-08-056-9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS nn Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
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 informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationPY 351 Modern Physics Short assignment 4, Nov. 9, 2018, to be returned in class on Nov. 15.
PY 351 Modern Physics Short assignment 4, Nov. 9, 2018, to be returned in class on Nov. 15. You may write your answers on this sheet or on a separate paper. Remember to write your name on top. Please note:
More informationBanded symmetric Toeplitz matrices: where linear algebra borrows from difference equations. William F. Trench Professor Emeritus Trinity University
Banded symmetric Toeplitz matrices: where linear algebra borrows from difference equations William F. Trench Professor Emeritus Trinity University This is a lecture presented the the Trinity University
More informationTridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix
Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix Roy Oste a,, Joris Van der Jeugt a a Department of Applied Mathematics, Computer Science and Statistics,
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
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 informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
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 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 informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationIntrinsic 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 informationLinear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7
Linear Algebra Rekha Santhanam Johns Hopkins Univ. April 3, 2009 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 1 / 7 Dynamical Systems Denote owl and wood rat populations at time k
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationOn the reduction of matrix polynomials to Hessenberg form
Electronic Journal of Linear Algebra Volume 3 Volume 3: (26) Article 24 26 On the reduction of matrix polynomials to Hessenberg form Thomas R. Cameron Washington State University, tcameron@math.wsu.edu
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS n n Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
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 informationNormalized rational semiregular graphs
Electronic Journal of Linear Algebra Volume 8 Volume 8: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 6 015 Normalized rational semiregular graphs Randall
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
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 informationGeneralization of Gracia's Results
Electronic Journal of Linear Algebra Volume 30 Volume 30 (015) Article 16 015 Generalization of Gracia's Results Jun Liao Hubei Institute, jliao@hubueducn Heguo Liu Hubei University, ghliu@hubueducn Yulei
More informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
More informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
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 informationProducts of commuting nilpotent operators
Electronic Journal of Linear Algebra Volume 16 Article 22 2007 Products of commuting nilpotent operators Damjana Kokol Bukovsek Tomaz Kosir tomazkosir@fmfuni-ljsi Nika Novak Polona Oblak Follow this and
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationMATHEMATICS 23a/E-23a, Fall 2015 Linear Algebra and Real Analysis I Module #1, Week 4 (Eigenvectors and Eigenvalues)
MATHEMATICS 23a/E-23a, Fall 205 Linear Algebra and Real Analysis I Module #, Week 4 (Eigenvectors and Eigenvalues) Author: Paul Bamberg R scripts by Paul Bamberg Last modified: June 8, 205 by Paul Bamberg
More informationInverses, determinants, eigenvalues, and eigenvectors of real symmetric Toeplitz matrices with linearly increasing entries
Inverses, determinants, eigenvalues, and eigenvectors of real symmetric Toeplitz matrices with linearly increasing entries F. Bünger Institute for Reliable Computing, Hamburg University of Technology,
More informationEvaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks innumerical linear algebra. Itisawidely known factthat, inthe caseofwell separated eigenvalues, the eigenvectors
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann The eigenvalues for a triangular matrix are
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 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 informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationLinear 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 informationAn analysis of GCD and LCM matrices via the LDL^T-factorization
Electronic Journal of Linear Algebra Volume 11 Article 5 2004 An analysis of GCD and LCM matrices via the LDL^T-factorization Jeffrey S Ovall jovall@mathucsdedu Follow this and additional works at: http://repositoryuwyoedu/ela
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
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 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 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 matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
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 information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
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 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 informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
More informationb 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 informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
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 informationThe Cyclic Decomposition of a Nilpotent Operator
The Cyclic Decomposition of a Nilpotent Operator 1 Introduction. J.H. Shapiro Suppose T is a linear transformation on a vector space V. Recall Exercise #3 of Chapter 8 of our text, which we restate here
More informationDIAGONALIZATION BY SIMILARITY TRANSFORMATIONS
DIAGONALIZATION BY SIMILARITY TRANSFORMATIONS The correct choice of a coordinate system (or basis) often can simplify the form of an equation or the analysis of a particular problem. For example, consider
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationLinear Algebra - Part II
Linear Algebra - Part II Projection, Eigendecomposition, SVD (Adapted from Sargur Srihari s slides) Brief Review from Part 1 Symmetric Matrix: A = A T Orthogonal Matrix: A T A = AA T = I and A 1 = A T
More informationLower bounds for the Estrada index
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 48 2012 Lower bounds for the Estrada index Yilun Shang shylmath@hotmail.com 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 informationGeneralized Eigenvectors and Jordan Form
Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least
More informationThe symmetric linear matrix equation
Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 8 00 The symmetric linear matrix equation Andre CM Ran Martine CB Reurings mcreurin@csvunl Follow this and additional works at: http://repositoryuwyoedu/ela
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationA classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationApril 26, Applied mathematics PhD candidate, physics MA UC Berkeley. Lecture 4/26/2013. Jed Duersch. Spd matrices. Cholesky decomposition
Applied mathematics PhD candidate, physics MA UC Berkeley April 26, 2013 UCB 1/19 Symmetric positive-definite I Definition A symmetric matrix A R n n is positive definite iff x T Ax > 0 holds x 0 R n.
More informationSign patterns that allow eventual positivity
Electronic Journal of Linear Algebra Volume 19 Volume 19 (2009/2010) Article 5 2009 Sign patterns that allow eventual positivity Abraham Berman Minerva Catral Luz Maria DeAlba Abed Elhashash Frank J. Hall
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationConvergence Rate Analysis for Periodic Gossip Algorithms in Wireless Sensor Networks
Convergence Rate Analysis for Periodic Gossip Algorithms in Wireless Sensor Networks S Kouachi Sateeshkrishna Dhuli Y N Singh Senior Member IEEE arxiv:805030v csdc 7 May 08 Abstract Periodic gossip algorithms
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 informationLattices and Hermite normal form
Integer Points in Polyhedra Lattices and Hermite normal form Gennady Shmonin February 17, 2009 1 Lattices Let B = { } b 1,b 2,...,b k be a set of linearly independent vectors in n-dimensional Euclidean
More informationGeneralized left and right Weyl spectra of upper triangular operator matrices
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017 Article 3 2017 Generalized left and right Weyl spectra of upper triangular operator matrices Guojun ai 3695946@163.com Dragana S. Cvetkovic-Ilic
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationA Tridiagonal Matrix
A Tridiagonal Matrix We investigate the simple n n real tridiagonal matrix: α β 0 0 0 0 0 1 0 0 0 0 β α β 0 0 0 1 0 1 0 0 0 0 β α 0 0 0 0 1 0 0 0 0 M = = αi + β = αi + βt, 0 0 0 α β 0 0 0 0 0 1 0 0 0 0
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationChapter 3. Linear and Nonlinear Systems
59 An expert is someone who knows some of the worst mistakes that can be made in his subject, and how to avoid them Werner Heisenberg (1901-1976) Chapter 3 Linear and Nonlinear Systems In this chapter
More information