Evaluation of spectrum of 2-periodic tridiagonal-Sylvester

Emrah KILIÇ AND Talha ARIKAN

Abstract. The Sylvester matrix was …rstly de…ned by J.J. Sylvester. Some authors have studied the relationships between certain or- thogonal and of Sylvester matrix. Chu studied a generalization of the Sylvester matrix. In this paper, we introduce its 2-period generalization. Then we compute its spec- trum by left eigenvectors with a similarity trick.

1. Introduction There has been increasing interest in tridiagonal matrices in many di¤erent theoretical …elds, especially in applicative …elds such as numer- ical analysis, orthogonal polynomials, engineering, telecommunication system analysis, system identi…cation, signal processing (e.g., speech decoding, deconvolution), special functions, partial di¤erential equa- tions and naturally linear algebra (see [2, 4, 5, 6, 15]). Some authors consider a general of …nite order and then describe its LU factorizations, determine the determinant and inverse of a tridi- agonal matrix under certain conditions (see [3, 7, 10, 11]). The Sylvester type tridiagonal matrix Mn(x) of order (n + 1) is de- …ned as x 1 0 0 0 0 n x 2 0    0 0 2 .   3 0 n 1 x 3 .. 0 0 6 . ...... 7 Mn(x) = 6 ...... 7 6 . . . 7 6 . . 7 6 0 0 0 .. .. n 1 0 7 6 7 6 0 0 0 0 x n 7 6    7 6 0 0 0 0 1 x 7 6    7 4 5 1991 Subject Classi…cation. 15A36, 15A18, 15A15. Key words and phrases. Sylvester Matrix, spectrum, determinant.  Corresponding author. 1 2 EmrahKILIÇANDTalhaARIKAN and Sylvester [12] gave its determinant as n

det Mn(x) = (x + n 2k): k=0 Y Askey [1] showed two ways to compute the determinant of Mn(x), one matrix-theoretic and another based on orthogonal polynomials. Also he explored their connection to orthogonal polynomials. For the relationships between orthogonal polynomials and other of Sylvester type matrices related to Krawtchouk, Hahn and Racah polynomials, we refer to [14]. Holtz [8] showed how the determinants in [12] can be evaluated by left eigenvectors of corresponding matrices coupled with a simple similarity trick. Chu [13] generalized the Sylvester matrix by adding a new parameter as shown x 1 0 n x + y 2 2 . 3 n 1 x + 2y .. Mn(x; y) = 6 . . 7 6 .. .. n 1 7 6 7 6 2 x + (n 1)y n 7 6 7 6 0 1 x + ny 7 6 7 4 5 and by using the method which Holtz uses in [8], evaluated its deter- minant as n ny n 2k det M (x; y) = (x + + 4 + y2); n 2 2 k=0 Y p via the generalized Fibonacci sequences. In this paper, we consider a new generalization of tridiogonal-Sylvester matrix. Then we compute its spectra and also determinant.

2. A Periodic Tridiagonal-Sylvester Matrix We de…ne 2-period Sylvester matrix of order (n + 1) as follows : x 1 0 n y 2 2 . 3 n 1 x .. An(x; y) = 6 . . 7 ; 6 .. .. n 1 7 6 7 6 2 an 1 (x; y) n 7 6 7 6 0 1 a (x; y) 7 6 n 7 4 5 2-periodictridiagonal-Sylvestermatrix 3 where x if n is even, a (x; y) = n y if n is odd.  If we take x = y, then the matrix An(x; x) gives the Sylvester matrix Mn (x) : K¬l¬ç[9] studied the case y = x. In this paper, our main purpose is to prove determinant formula for the matrix An(x; y): n=2 x (xy 4t2) if n is even, t=1 det A (x; y) = 8 n > Q > n=2 < b c(xy (2t + 1)2) if n is odd. > t=0 > Q We will frequently denote:> the matrix An(x; y) by An and, an (x; y) by an: 1 1 1 1 2 2 Let 1 = (x+y)+  and 2 = (x+y)  where  = (x y) + (2n) : 2 2 2 2 For the matrix An of order n + 1 with odd n, de…ne the vectors with (n + 1) dimension: p + (y x)+ (y x)+ (y x)+ z := 1 1 1 2n 2n    2n and   (y x)  (y x)  (y x)  z := 1 1 1 : 2n 2n    2n For the matrix A of order n+1 with even n; de…ne the vectors with  n  n + 1 dimension: + (y x)+ (y x)+ (y x)+ s := 1 1 1 1 2n 2n    2n and   (y x)  (y x)  (y x)  s := 1 1 1 1 : 2n 2n    2n We need the following results:  

Lemma 1. For odd n > 0; the matrix An has the eigenvalues 1 and + 2 with the corresponding left eigenvectors z and z; respectively. + + Proof. To prove the claim, it is su¢ cient to show z An = 1z and th zAn = 2z. From the de…nition of An, we should prove that the k components of zAn are

z0x + z1n = z01;2 for k = 0; zn 1n + zny = zn1;2 for k = n; and for 0 < k < n;

kzk 1 + akzk + (n k)zk+1 = zk1;2; where an is de…ned as before. 4 EmrahKILIÇANDTalhaARIKAN

For the case k = 0; we get 1 1 1 x + n [(y x) ] = (x + y)  = 1;2; 2n  2  2 as claimed. Now we consider the case k = n and examine the equality + + z An = 1z : So we get (y x) +  (x + y) +  (2.1) z+ = n 1 2n 2     1 = (y2 xy + y + 2n2) 2n y (2.2) = n + ((y x) + ) 2n + + = zn 1n + zn y; as claimed. To complete the proof, we show the last case 0 < k < n. Now we examine this case under two conditions: For even k; + + + kzk 1 + xzk + (n k)zk+1 1 1 = k ((y x) + ) + x + (n k) ((y x) + ) 2n 2n     1 = x + n ((y x) + ) 2n   1 1 = (x + y) +  =  = z+ ; 2 2 1 k 1 and for odd k; 1 kzk 1 + yzk + (n k)zk+1 = k + y ((y x) + ) + (n k) 2n   1 = n + y ((y x) + ) ; 2n   which, by the equations (2.1) and (2.2), equals

1 1 + ((y x) + ) ((x + y) + ) = z 1: 2n 2 k     + + So the proof is completed for the case z An = 1z . The other case, zAn = 2z; can be similarly shown. 

Lemma 2. For even n > 0; the matrix An has the eigenvalues 1 and + 2 with the corresponding to the left eigenvectors s and s; respec- tively. Proof. The proof can be done similar to the proof of the previous Lemma.  2-periodictridiagonal-Sylvestermatrix 5

For odd n > 0; we de…ne a (n + 1) (n + 1) matrix Tn as  + + . + + + z0 z1 . z2 zn 1 zn    2 . 3 z0 z1 . z2 zn 1 zn    Tn = 6 7 ; 6   .     7 6 . 7 6 7 6 . 7 6 0(n 1) 2 . In 1 7 6  7 4 5 where 0(n 1) 2 is the of order (n 1) 2 and In is the  of order n:  We can obtain inverse of the matrix Tn as follows: (x y)+  (x y) . 2 2 . 1 0 1 0 1 0 .    2 n n . 0 1 0 1 0 1 3      1 6           7 Tn = 6 . 7 : 6 0(n 1) 2 . 7 6  7 6 . 7 6 . In 1 7 6 . 7 6 . 7 6 7 4 5 So we can see that the matrix An is similar to the matrix En := 1 TnAnTn via the matrix Tn as shown . 1 0 . 02 (n 1)  . 2 0 2 . 3 1 TnAnTn = 6 7 ; 6 n(n 1) n (n 1) .  7 6 . 7 6   7 6 . 7 6 0(n 2) 2 . Wn 1 7 6  7 4 5 where the matrix Wn 1 of order (n 1) is given by x 4 n 0 1 n 0 1 n n 2 y 4 0    0 2 .      . 3 0 n 3 x 5 .. . 6 ...... 7 Wn 1 = 6 ...... 7 : 6 7 6 . .. 7 6 . . 3 y n 1 0 7 6 . 7 6 . ... 7 6 . 2 x n 7 6 0 0 1 y 7 6 7 4          5 Considering the 2 2 principal submatrix of En, it is clearly seen  that 1 and 2 are two eigenvalues of En: 6 EmrahKILIÇANDTalhaARIKAN

We focus on the matrix An for odd n up to now. By consider the matrix An for even n; we de…ne a matrix Yn of order (n + 1) as shown:

+ + . + + + s0 s1 . s2 sn 1 sn    . 2 s0 s1 . s2 sn 1 sn 3 Y =    ; n 6 7 6        7 6 7 6 . 7 6 0(n 1) 2 . In 1 7 6  7 4 5 where 0(n 1) 2 and In are de…ned as before.  1 We also obtain the inverse matrix Yn in the form

x y+ x y  . . 1 0 1 0 1 2 2    n n . 1 2 . 0 1 0 1 0 3 Yn =      : 6          7 6 . 7 6 0(n 1) 2 . In 1 7 6  7 4 1 5 So the matrix An is similar to matrix Dn := YnAnYn via the matrix Yn is given by . 1 0 . 02 (n 1)  . 2 0 2 . 3 1 YnAnYn = 6 7 ; 6 n(n 1) n (n 1) .  7 6 . 7 6   7 6 . 7 6 0(n 2) 2 . Qn 1 7 6  7 4 5 where the matrix Qn 1 of order (n 1) is given by x 4 n 0 1 n 0 1 n 0 n 2 y 4 0    0 2 .      . 3 0 n 3 x 5 .. . 6 . . . 7 6 . 0 n 4 y .. .. 7 6 7 Qn 1 = 6 ...... 7 : 6 . . . n 2 . . 7 6 7 6 .. 7 6 . 3 x n 1 0 7 6 . . 7 6 . .. 2 y n 7 6 7 6 0 0 1 x 7 6       7 4 5 Consequently, by the above results, the matrix An has two eigenval- ues 1 and 2 for each n: To compute remaining eigenvalues of matrix An, we will give some auxiliary results. 2-periodictridiagonal-Sylvestermatrix 7

Now we de…ne an upper Un of order n as follows 1 0 1 0 0    .. . 2 1 0 1 . . 3 . 1 0 .. 0 Un = 6 7 : 6 . . 7 6 .. .. 1 7 6 7 6 1 0 7 6 7 6 0 1 7 6 7 1 4 5 and Un can be found as follows for even n; 1 0 1 0 1 0 .   1 0 1 .. 1 2 3 1 0 0 1 6 ...... 7 U = 6 . . . . 7 n 6 7 6 .. .. 7 6 . . 1 7 6 . 7 6 .. 7 6 0 7 6 0 1 7 6 7 4 1 5 and for odd n; the matrix Un takes the form: 1 0 1 0 0 1    .. .. 2 1 0 1 . . 0 3 . . . 1 0 .. .. . 1 6 7 U = 6 . . 7 : n 6 .. .. 1 0 7 6 7 6 1 0 1 7 6 7 6 1 0 7 6 7 6 0 1 7 6 7 4 5 Then both the matrix Wn and Qn are similar to the same tridiagonal matrix Gn of order n, that is, they satis…ed the equations 1 1 Gn := Un WnUn and Gn := Un QnUn; with x 1 0 n 1 y 2 2 n 2 x 3 3 . . . Gn = 6 ...... 7 6 7 6 3 an 3 n 2 7 6 7 6 2 an 2 n 1 7 6 7 6 0 1 an 1 7 6 7 4 5 8 EmrahKILIÇANDTalhaARIKAN and an is de…ned as before. For further computations, we de…ne a (n + 1) (n + 1) matrix U via  the matrix Un as follows . I2 . 02 (n 1) .  U = 2 . 3 ;       . 6 0(n 1) 2 . Un 1 7 6  7 and then it can be easily4 seen 5 . I2 . 02 (n 1)  1 . U = 2 . 3 :       . 1 6 0(n 1) 2 . Un 1 7 6  7 For both even and odd cases,4 we get 5 . 1 0 . 02 (n 1)  . 2 0 2 . 3 1 U EnU = 6 7 6 n(n 1) n (n 1) .  7 6 . 7 6   7 6 . 1 7 6 0(n 2) 2 . Un 1Wn 1Un 1 7 6  7 and 4 5 . 1 0 . 02 (n 1)  . 2 0 2 . 3 1 U DnU = 6 7 : 6 n(n 1) n (n 1) .  7 6 . 7 6   7 6 . 1 7 6 0(n 2) 2 . Un 1Qn 1Un 1 7 6  7 4 1 1 5 In general, we obtain that U EnU and U DnU are reduced to a block form: . 1 0 . 02 (n 1)  . 2 0 2 . 3 1 1 (2.3) U EnU = U DnU = 6 7 ; 6 n(n 1) n (n 1) .  7 6 . 7 6   7 6 . 7 6 0(n 2) 2 . Gn 1 7 6  7 4 5 where Gn is de…ned as before. 2-periodictridiagonal-Sylvestermatrix 9

Up to now, the following results have been obtained 1 En = TnAnTn for odd n; 1 (2.4) Dn = YnAnYn for even n; 1 Gn = Un WnUn for odd n; 1 Gn = Un QnUn for even n:

From the de…nition of Gn; one can see that Gn = An 1 and both 1 1 of U EnU and U DnU can be rewritten in the following lower- triangular form Diag( ;  ) 0 1 2 : An 2    From (2.3) and (2.4) we get the following recurrence relation for det An

det A0 = x;

det A1 = xy 1; 2 det An = 12 det An 2 = (xy n ) det An 2; for n > 0: Therefore we have the spectrum of the matrix An : for even n; n=2 1 1 2 2 (An) = (x + y) (x y) + (4k) x 2  2 [ f g  k=1 and for odd n; p n=2 b c 1 1 2 2 (An) = (x + y) (x y) + (4k + 2) : 2  2  k=0 p By considering spectrum of the matrix An and recurrence relation of det An; we deduce that for even n; n=2 2 det An(x; y) = x (xy (2t) ) t=1 Y and for odd n;

n=2 b c 2 det An(x; y) = (xy (2t + 1) ): t=0 Y As we stated earlier, if we take x = y; then for even n;

n=2 2 2 det An(x; x) = x (x (2t) ) t=1 Y 10 EmrahKILIÇANDTalhaARIKAN and for odd n;

n=2 b c 2 2 det An(x; x) = (x (2t + 1) ); t=0 Y which, by combining, give us the single formula

n

det Mn(x) = (x + n 2k); k=0 Y which equals to det Mn (x) : Note that if we take y = x then we obtain results in [9].

References [1] Askey R. Evaluation of Sylvester type determinants using orthogonal polyno- mials. Advances in analysis. Hackensack, NJ : World Scienti…c 2005: 116. [2] Bunse-Gerstner A, Byers R, Mehrmann V. A chart of numerical methods for structured eigenvalue problems. SIAM J Matrix Anal Appl 1992; 13 (2): 419– 453. [3] Burden RL, Fairs JD. Reynolds AC. Numerical Analysis, Second ed., Prindle, Weber & Schmidt, Boston: MA, 1981. [4] El-Mikkawy M. A fast algorithm for evaluating nth order tri-diagonal deter- minants. J Comput Appl Math 2004; 166(2): 581–584. [5] El-Mikkawy M, Karawia A. Inversion of general tridiagonal matrices. Appl Math Letters 2006; 19(8): 712–720. [6] Fischer CF, Usmani RA. Properties of some tridiagonal matrices and their application to boundary value problems. SIAM J Numer Anal 1969; 6 (1): 127–142. [7] Hager WW. Applied Numerical Linear Algebra, Prentice-Hall International Editions, Englewood Cli¤s: NJ, 1988. [8] Holtz O. Evaluation of Sylvester type determinants using block- triangularization. Advances in analysis. Hackensack , NJ : World Scienti…c 2005: 395–405. [9] K¬l¬ç E. Sylvester-tridiagonal matrix with alternating main diagonal entries and its spectra. Inter J Nonlinear Sci Num Simulation 2013; 14(5): 261–266. [10] Lehmer DH. Fibonacci and related sequences in periodic tridiagonal matrices. The Fibonacci Quart 1975; 13: 150–158. [11] Meurant G. A review on the inverse of symmetric tridiagonal and block tridi- agonal matrices. SIAM J Matrix Anal Appl 1992; 13(3): 707–728. [12] Sylvester JJ. Theoreme sur les determinants. Nouvelles Annales de Math 1854; 13: 305. [13] Wenchang C. Fibonacci polynomials and Sylvester determinant of tridiagonal matrix. Appl Math Comput 2010; 216(3): 1018–1023. [14] Wenchang C. Eigenvectors of tridiagonal matrices of Sylvester type. Calcolo 2008; 45(4): 217–233. 2-periodictridiagonal-Sylvestermatrix 11

[15] Zhao H, Zhu G, Xiao P. A backward three-term recurrence relation for vector valued continued fractions and its applications. J Comput Appl Math 2002; 142(2): 389–400.

Department of Mathematics, TOBB Economics and Technology Uni- versity 06560, Ankara, Çankaya, Turkey E-mail address: [email protected]

Department of Mathematics, Hacettepe University, Ankara, Çankaya, Turkey E-mail address: [email protected]