EXPLICIT SPECTRUM OF A CIRCULANT-TRIDIAGONAL WITH APPLICATIONS

EMRAH KILIÇ AND AYNUR YALÇINER

Abstract. We consider a circulant-tridiagonal matrix and compute its deter- minant by using generating function method. Then we explicitly determine its spectrum. Finally we present applications of our results for trigonometric factorizations of the generalized Lucas sequences.

1. Introduction Tridiagonal matrices have been used in many different fields, especially in ap- plicative fields such as numerical analysis (e.g., orthogonal polynomials), engineer- ing, telecommunication system analysis, system identification, signal processing (e.g., speech decoding, deconvolution), special functions, partial differential equa- tions and naturally (see [1, 3, 4, 12, 16, 17]). Some authors consider a general tridiagonal matrix of finite order and then compute its LU factorizations, and inverse (see [2, 5, 8, 13]). A tridiagonal of order n has the form: a b 0 c a b  c a  An = ,  . .   .. .. b     0 c a    where a, b and c’sare nonzero complex numbers.  A tridiagonal 2-Toeplitz matrix has the form:

a1 b1 0 0 0 ··· c1 a2 b2 0 0  ···  0 c2 a1 b1 0 T = ··· , n  0 0 c1 a2 b2   ···   0 0 0 c2 a1   ···   ......   ......    where a, b and c’sare nonzero complex numbers.  Let a1, a2, b1 and b2 be real numbers. The period two second order linear recur- rence system is defined to be the sequence f0 = 1, f1 = a1, and

f2n = a2f2n 1 + b1f2n 2 and f2n+1 = a1f2n + b2f2n 1 − − −

2000 Mathematics Subject Classification. 15A15, 15B36, 65Q05. Key words and phrases. Circulant and tridiagonal matrices, spectrum, determinant, generating function. 1 2 EMRAHKILIÇANDAYNURYALÇINER

2 for n 1. Let D = a1a2 + b1 + b2 and D 4b1b2 = 0. Gover≥ [6] and Marcellán and Petronilho− [15] showed6 that the eigenvalues of ma- trix T2n+1 are a1 and

2 a1 + a2 a1 a2 kπ − + b1c1 + b2c2 + 2 b1b2c1c2 cos 2 ± s 2 n + 1   p for 1 k n. ≤ ≤ They also gave a closed equation for the eigenvalues of T2n : They are the solu- tions of the following quadratic equations

(λ a1)(λ a2) b1c1 + b2c2 + b1b2c1c2znk = 0, k = 1, 2, . . . , n, − − − h i where znk, k = 1, 2, . . . , n, are the zerosp of the polynomial Rn (z) defined by

Rn+1 (x) = xRn (x) Rn 1 (x) , n 1 − − ≥ 2 with initials R0 (x) = 1,R1 (x) = x + β where β = b2c2/b1c1. Meanwhile, a matrix Cn is called a if it has the form

a1 a2 a3 an 1 an − an a1 a2 an 2 an 1  − −  an 1 an a1 an 3 an 2 C = − − − . n      a3 a4 a5 a1 a2     a2 a3 a4 an a1    Circulant matrices are a special type of Toeplitz matrix and have many interest- ing properties. Circulant matrices have been used in many areas such as physics, differential equations and digital image processing. Also circulant and skew circu- lant matrices have become an important tool in networks engineering. Define generalized Fibonacci and Lucas sequences by the recursion for n > 1

Un = PUn 1 QUn 2 and Vn = PVn 1 QVn 2, − − − − − − with the initials U0 = 0,U1 = 1, and, V0 = 2,V1 = P, resp. When P = 1 and Q = 1,Un = Fn (nth Fibonacci number) and Vn = Ln (nth Lucas number) . Recently− some authors have studied various interesting combinatorial matrices defined by terms of certain sequences. We could refer to the works [10, 14, 11, 18] for details about combinatorial matrix examples: In [9], the authors consider skew circulant type matrices with any continuous Fibonacci numbers. Then they discuss the invertibility of the skew circulant type matrices and present explicit and inverse matrices of them. In this paper, we consider a circulant-tridiagonal matrix and then compute its determinant by using generating function method. Then we explicitly determine its all eigenvalues. We show that determinant of the matrix satisfies a period second order recurrence system. We give applications for trigonometric factorizations of the Lucas sequences.

2. The main results

We define a tridiagonal matrix Hn = [hij] of order n with h11 = a, hi+1,i = hi,i+1 = b for odd i, hi,i+1 = hi+1,i = a for even i and hnn = a if n is even and hnn = b if n is odd. EXPLICIT SPECTRUM OF A CIRCULANT-TRIDIAGONAL MATRIX 3

Then the matrix H2n takes the form a b b 0 a  a 0 b  H2n =  .. ..  .  b . .     .   .. 0 b     b a      We define a period two second order linear recurrence system hn given by { } h0 = 0, h1 = a + b, and the recursions

h2n = (a b) h2n 1 abh2n 2, − − − − h2n+1 = ( a + b) h2n abh2n 1 − − − for n 1. We≥ give relationships between the period two second order linear recurrence system hn and the determinant of Hn. Then we determine the eigenvalues of { } matrix Hn. By expanding the determinant of Hn with respect to the first row, we have the following result without proof. Lemma 1. For n > 1, n+1 2n 2n n 2n+1 2n+1 det H2n = ( 1) a b and det H2n+1 = ( 1) a + b . − − − Let   n H (x) = hnx . n 0 X≥ Also let 2n+1 2n H1 (x) = h2n+1x and H2 (x) = h2nx . n 0 n 0 X≥ X≥ By these equations, we get the equation system 2 H2 (x) = (a b) xH1 (x) abx H2 (x) , − − 2 H1 (x) (a + b) x = ( a + b) xH2 (x) abx H1 (x) . − − − By Cramer solution of the system, we obtain (a + b) abx3 + (a + b) x H (x) = 1 1 + (a2 + b2) x2 + a2b2x4 and a2 b2 x2 H (x) = − . 2 1 + (a2 + b2) x2 + a2b2x4  Thus we get (b + a) x + a2 b2 x2 + a2b + ab2 x3 H (x) = H (x) + H (x) = − . 1 2 1 + (a2 + b2) x2 + a2b2x4   Here note that 1 + a2 + b2 x2 + a2b2x4 = 1 α2x2 1 β2x2 − − = (1 αx) (1 + αx) (1 βx) (1 + βx) ,  −  − where α = ia, β = ib and i =√ 1. − 4 EMRAHKILIÇANDAYNURYALÇINER

By partial fraction decomposition, we find A1,A2,B1 and B2 such that A A B B H (x) = h xn = 1 + 2 + 1 + 2 . n (1 αx) (1 + αx) (1 βx) (1 + βx) n 0 X≥ − − Solving the equation above, we get the coeffi cients have the forms: (1 + i) 1 i 1 i 1 + i A1 = ,A2 = − ,B1 = − and B2 = . − 2 − 2 2 2 Therefore

1 n n n n hn = ( (1 + i) α (1 i)( α) + (1 i) β + (1 + i)( β) ) . 2 − − − − − − Especially we have that n 2n+1 2n+1 n+1 2n 2n h2n+1 = ( 1) a + b and h2n = ( 1) a b . − − − By the results above, we have the following result:  Corollary 1. For n > 1, det Hn = hn. If we choose a and b as the roots of the characteristic equation of the general Lucas sequences, x2 P x + Q = 0, then we have − n n+1 h2n+1 = ( 1) V2n+1 and h2n = ( 1) U2n√∆, − − where ∆ = P 2 4Q. − Lemma 2. For n > 1, det Hn = 0 if and only if 2 2 2kπ n 2 a = b or a + b = 2ab cos n for 1 k −2 if n is even, ± (2k 1)π ≤ ≤ a + b = 2√ab cos − for 1 k n if n is odd.  2n ≤ ≤ Proof. Since hn = det Hn and by our result mentioned before, hn = det Hn = 0 if and only if 1 ( (1 + i) αn (1 i)( α)n + (1 i) βn + (1 + i)( β)n) = 0. 2 − − − − − − Thus (1 + i) αn + (1 i)( 1)n αn = (1 i) βn + (1 + i)( 1)n βn − − − − or αn (1 i) + (1 + i)( 1)n = − − . βn (1 + i) + (1 i)( 1)n − − For even n such that n = 2m, we find the all solution of the equation α2m (1 i) + (1 + i) = − = 1, β2m (1 + i) + (1 i) − which, by α = ia and β = ib, satisfies a2m = b2m or a2m b2m = 0. − From (pp. 34, formula 1.396.2, [7]), we recall the known result m 1 − kπ x2m 1 x2 + 1 2x cos = − . − m x2 1 k=1 Y   − EXPLICIT SPECTRUM OF A CIRCULANT-TRIDIAGONAL MATRIX 5

By taking x = a/b, we get

m 1 − kπ a2 b2 a2 + b2 2ab cos = a2m b2m. − − m − k=1    Y Thus a2m b2m = 0 if and only if − kπ a = b or a2 + b2 = 2ab cos ± m for some 1 k m 1 where n = 2m. ≤ ≤ −

For odd n such that n = 2m + 1, det Hn = 0 if and only if α2m+1 = 1 β2m+1 − or α2m+1 + β2m+1 = 0, which, by α = ia and β = ib, is equivalent to a2m+1 + b2m+1 = 0. By the product form of Chebyshev polynomials of the first kind, we have that m (2k 1) π am + bm = (a + b) 2√ab cos − − 2m k=1 Y   and so 2m+1 (2k 1) π a2m+1 + b2m+1 = (a + b) 2√ab cos − . − 2 (2m + 1) k=1 Y   2m+1 2m+1 (2k 1)π Finally a +b = 0 if and only if a+b = 2√ab cos − for 1 k 2m+1. 2(2m+1) ≤ ≤ Thus the claim is proven. 

Now we can determine eigenvalues of the matrix Hn. For this, we define a new period second order recurrence system gn by the recursion { } g2n = (a b x) g2n 1 (ab) g2n 2, − − − − − g2n+1 = ( a + b x) g2n (ab) g2n 1 − − − − with g0 = 0 and g1 = a + b x for n > 0. On the other hand, by straightforward− computations gives us the characteristic equation of matrix Hn as

det (H2n xI2n) = g2n − and

det (H2n+1 xI2n+1) = g2n+1, − where In is the of order n. Combining them, we determine the eigenvalues of matrix Hn :

Theorem 1. The eigenvalues of H2n are kπ a b and a2 + b2 2ab cos , 1 k n 1, ± ± r − n ≤ ≤ − 6 EMRAHKILIÇANDAYNURYALÇINER and the eigenvalues of H2n+1 are (2k 1) π a + b and (a2 + b2) 2ab cos − , 1 k n. ± r − 2n + 1 ≤ ≤ 3. Two Applications Now we will give two applications of our results on trigonometric factorizations of the second order recurrences Un and Vn . If we choose the entries of the { } { } 2 2 matrix Hn as a = P + P 4Q /2 and b = P P 4Q /2, then we will − − − obtain the following resultsp :   p  n 2k 1 V2n+1 = V1 V2 2Q cos − π − 2n + 1 k=1 Y   and n 1 − kπ U2n = U2 V2 2Q cos . − n k=1 Y   Especially when P = 1 and Q = 1, then we get − n n 1 2k 1 − kπ L = 3 + 2 cos − π and F = 3 + 2 cos . 2n+1 2n + 1 2n n k=1 k=1 Y   Y   References [1] A. Bunse-Gerstner, R. Byers and V. Mehrmann, A chart of numerical methods for struc- tured eigenvalue problems, SIAM J. Matrix Anal. Appl. 13(2) (1992), 419—453, doi: 10.1137/0613028. [2] R.L. Burden, J.D. Fairs and A.C. Reynolds, Numerical Analysis, 2nd Ed., Prindle, Weber & Schmidt, Boston, MA, 1981. [3] W. Chu, Fibonacci polynomials and Sylvester determinant of tridiagonal matrix. Applied Math. Comput. 216(3) (2010), 1018—1023, doi: 10.1016/j.amc.2010.01.089. [4] C.F. Fischer and R.A. Usmani, Properties of some tridiagonal matrices and their appli- cation to boundary value problems, SIAM J. Numer. Anal. 6(1) (1969), 127—142, doi: 10.1137/0706014. [5] C. M. Fonseca, On the eigenvalues of some tridiagonal matrices, J. Comput.Appl. Math. 200(1) (2007), 283—286, doi: 10.1016/j.cam.2005.08.047. [6] M.J.C. Gover, The eigenproblem of a tridiagonal 2-Toeplitz Matrix, Linear Algebra Appl. 197-198 (1994), 63—78, doi: 10.1016/0024-3795(94)90481-2. [7] I.S. Gradshteyn and I.M. Ryzhik, Table of Integrals, Series, and Products, Academic Press, San Diego, 1980. [8] W.W. Hager, Applied Numerical Linear Algebra, Prentice-Hall Inter. Editions, Englewood Cliffs, NJ, 1988. [9] Z. Jiang, Y. Jinjiang and F. Lu, On skew circulant type matrices involving any continuous Fibonacci numbers, Abstract and Applied Analysis, Article ID 483021, 10 pp., 2014, doi: 10.1155/2014/483021. [10] Z. Jiang and D. Li, The invertibility, explicit determinants, and inverses of circulant and left circulant and g-circulant matrices involving any continuous Fibonacci and Lucas numbers, Abstr. Appl. Anal. Article ID 931451, 14 pp., 2014, doi: 10.1155/2014/931451. [11] Z. Jiang, H. Xin and F. Lu, Gaussian Fibonacci circulant type matrices, Abstr. Appl. Anal. Article ID 592782, 10 pp., 2014, doi: 10.1155/2014/592782. [12] E. Kılıçand D. Tascı,Factorizations and representations of the backward second-order linear recurrences, J. Comput. Appl. Math. 201(1) (2007), 182—197, doi: 10.1016/j.cam.2006.02.012. [13] D.H. Lehmer, Fibonacci and related sequences in periodic tridiagonal matrices, The Fibonacci Quarterly 13(2) (1975), 150—158. EXPLICIT SPECTRUM OF A CIRCULANT-TRIDIAGONAL MATRIX 7

[14] T. Mansour, A formula for the generating functions of powers of Horadam’s sequence, Aus- tralasian Journal of Combinatorics 30 (2004), 207—212. [15] F. Marcellán and J. Petronilho, Eigenproblems for tridiagonal 2-Toeplitz matrices and qua- dratic polynomial mappings, Linear Algebra Appl. 260 (1997), 169—208, doi: 10.1016/S0024- 3795(97)80009-2. [16] M. El-Mikkawy and E-D. Rahmo, A new recursive algorithm for inverting general tridi- agonal and anti-tridiagonal matrices. Appl. Math. Comput. 204(1) (2008), 368—372, doi: 10.1016/j.amc.2008.06.053. [17] M. El-Mikkawy and F. Atlan, A new recursive algorithm for inverting general k-tridiagonal matrices. Appl. Math. Lett. 44 (2015), 34—39, doi: 10.1016/j.aml.2014.12.018. [18] J. Zhou and Z. Jiang, Spectral norms of circulant-type matrices with binomial co- effi cients and harmonic numbers, Int. J. Comput. Methods 11(5) (2014), 1-14, doi: 10.1142/S021987621350076X.

TOBB University of Economics and Technology Mathematics Department 06560 Ankara Turkey E-mail address: [email protected]

Selçuk University Science Faculty Mathematics Department 42075 Konya Turkey E-mail address: [email protected]