On the spectral properties of real anti-tridiagonal Hankel matrices
Jo\~ao Lita da Silva

TL;DR
This paper investigates the spectral properties of real anti-tridiagonal Hankel matrices by expressing their eigenvalues as zeros of rational functions and deriving their eigenvectors based on these eigenvalues.
Contribution
It introduces a novel method to determine eigenvalues and eigenvectors of these structured matrices using rational functions, expanding understanding of their spectral characteristics.
Findings
Eigenvalues are characterized as zeros of specific rational functions.
Eigenvectors can be derived once eigenvalues are known.
Provides a new analytical approach for spectral analysis of structured matrices.
Abstract
In this paper we express the eigenvalues of real anti-tridiagonal Hankel matrices as the zeros of given rational functions. We still derive eigenvectors for these structured matrices at the expense of prescribed eigenvalues.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Color Science and Applications
**On the spectral properties of real
anti-tridiagonal Hankel matrices**
João Lita da Silva111E-mail address: [email protected]; [email protected]
*Department of Mathematics and GeoBioTec
Faculty of Sciences and Technology
NOVA University of Lisbon
Quinta da Torre, 2829-516 Caparica, Portugal*
Abstract
In this paper we express the eigenvalues of real anti-tridiagonal Hankel matrices as the zeros of given rational functions. We still derive eigenvectors for these structured matrices at the expense of prescribed eigenvalues.
Key words: Anti-tridiagonal matrix, Hankel matrix, eigenvalue, eigenvector
2010 Mathematics Subject Classification: 15A18, 15B05
1 Introduction
Recently, some authors have computed the eigenvalues and eigenvectors for a sort of Hankel matrices thus obtaining its eigendecomposition (see [3], [4], [7], [11], [12], [13], [14] among others). In contrast to the tridiagonal Toeplitz matrices case where the eigenvalues and eigenvectors are well-known (see, for instance, [9]), a possible closed-form expression for the eigenvalues and eigenvectors of general anti-tridiagonal Hankel matrices is still to be found.
The aim of this short note is to give a contribution in that search. Specifically, we shall present an eigenvalue localization tool for real anti-tridiagonal Hankel matrices, providing also associated eigenvectors. To achieve our purpose, we shall use eigendecompositions of anti-circulant matrices available in [8] to ensure a decomposition for the matrices under study in a first step, and results concerning to sum of (rank one) matrices in a final stage to obtain all formulae.
The rational functions exhibited in this paper to locate eigenvalues of real anti-tridiagonal Hankel matrices, as well as the expressions for its eigenvectors, are given in explicit form which, on one hand, can be easily evaluated in computer programs, and, on the other, are useful for further theoretical investigations in this subject.
2 Main results
Let be a positive integer and consider the following anti-tridiagonal Hankel matrix
[TABLE]
where are real numbers. Throughout, we shall set
[TABLE]
where denotes the imaginary unit.
2.1 Eigenvalue localization for
Our first statement is an eigenvalue localization theorem for matrices of the form (2.1).
Theorem 1
Let be a positive integer, real numbers, given by (2.2),
[TABLE]
[TABLE]
[TABLE]
2.2 Eigenvectors of
Owning the eigenvalues of in (2.1), we are able to determine the corresponding eigenvectors.
Theorem 2
Let be an integer, real numbers such that , and , , , be given by (2.3a), (2.3b), (2.3c), (2.3d), respectively.
(a)* If is odd, the zeros of (2.4a) are not of the form , , , and , then*
[TABLE]
is an eigenvector of associated to , .
(b)* If is even, the zeros of (2.5a) are not of the form , , , , and , then*
[TABLE]
is an eigenvector of associated to , .
- Remark
We point out that if then expressions (2.6) and (2.7) should be replaced by
[TABLE]
and
[TABLE]
respectively, provided that . Of course, if then an eigenvalue decomposition of the exchange matrix is already known (see [3]).
3 Lemmas and proofs
Let be a positive integer. Consider the following real anti-circulant matrix
[TABLE]
and the unitary discrete Fourier transform matrix , that is, the matrix defined by
[TABLE]
where is given by (2.2). Our first auxiliary result is an orthogonal decomposition for . We shall denote by the conjugate transpose of any complex matrix.
Lemma 1
Let be a positive integer, real numbers, and , , , given by (2.2), (2.3a), (2.3b), respectively.
[TABLE]
[TABLE]
- Proof.
Let be a positive odd integer. According to Theorem 3.6 of [8] we have
[TABLE]
where
[TABLE]
with given by (3.2) and the following matrix
[TABLE]
Note that the first column of has all components equal to ; their next columns are
[TABLE]
for each and the last ones are
[TABLE]
for . Since
[TABLE]
we get that the entries of are given by (3.3b) which leads to (3.3a). Supposing a positive even integer , Theorem 3.7 in [8] ensures
[TABLE]
where
[TABLE]
with given by (3.2) and the matrix
[TABLE]
The first column of has all its components equal to . The next columns are given by (3.5) for and the last ones are defined by (3.6) for each ; the th column of is
[TABLE]
From identities (3.7), (3.8) we obtain (3.4a). The proof is completed.
The statement below is a decomposition for the matrices and plays a central role in the main results.
Lemma 2
Let be a positive integer, real numbers, and , , , given by (2.2), (2.3a), (2.3b), respectively.
(a)* If is odd,*
[TABLE]
then
[TABLE]
where is the matrix defined by (3.3b).
(b)* If is even,*
[TABLE]
then
[TABLE]
where is the whose the entries are given by (3.4b).
- Proof.
We only prove (a) since (b) can be proven in the same way. Consider a positive odd integer and the following matrices
[TABLE]
From Lemma 1,
[TABLE]
where is the matrix defined by (3.3b), is the matrix (3.1), is the first row of , i.e.
[TABLE]
and is the last row of ,
[TABLE]
- Proof of Theorem 1.
Consider a positive odd integer , given by (3.9), and . According to Lemma 2, it should be noted that the matrix and
[TABLE]
share the same eigenvalues. Let us adopt the notations of [1] by denoting the collection of all -element subsets of written in increasing order; additionally, for any rectangular matrix , we shall indicate by the minor determined by the subsets and . Setting
[TABLE]
and
[TABLE]
we have from Theorem 1 of [1] that is an eigenvalue of (3.11) if and only if
[TABLE]
provided that is not an eigenvalue of . Since
[TABLE]
we obtain (2.4a). Let be the eigenvalues of and be arranged in non-decreasing order by some bijection defined in . Thus,
[TABLE]
for each (see [6], page ). Using Miller’s formula for the determinant of the sum of matrices (see [10], page ), we can compute the characteristic polynomial of ,
[TABLE]
because
[TABLE]
and
[TABLE]
Hence, and (3.12) yields (2.4b). The proof of the remaining assertion is performed in the same way and so will be omitted.
- Proof of Theorem 2.
Since both assertions can be proven in the same way, we only prove (a). Let be a positive odd integer, , and the eigenvalues of . We can rewrite the matricial equation as
[TABLE]
where are defined in (3.9) and the matrix whose the entries are given by (3.3b). Thus,
[TABLE]
that is,
[TABLE]
for (see Theorem 5 of [2], page ) and
[TABLE]
is a nontrivial solution of (3.13). Thus, choosing we conclude that the vector having components (2.6) is an eigenvector of associated to the eigenvalue .
Acknowledgements
This work is a contribution to the Project UID/GEO/04035/2013, funded by FCT - Fundação para a Ciência e a Tecnologia, Portugal.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Anderson, A secular equation for the eigenvalues of a diagonal matrix perturbation, Linear Algebra Appl. 246 , 49–70 (1996).
- 2[2] J.R. Bunch, C.P. Nielsen and D.C. Sorensen, Rank-one modification of the symmetric eigenproblem, Numer. Math. 31 , 31–48 (1978).
- 3[3] J. Gutiérrez-Gutiérrez, Eigenvalue decomposition for persymmetric Hankel matrices with at most three non-zero anti-diagonals, Appl. Math. Comput. 234 , 333–338 (2014).
- 4[4] J. Gutiérrez-Gutiérrez and M. Zárraga-Rodríguez, Orthogonal diagonalization for complex skew-persymmetric anti-tridiagonal Hankel matrices, Spec. Matrices 4 , 73–79 (2016).
- 5[5] D.A. Harville, Matrix Algebra From a Statistician’s Perspective , Springer-Verlag, New York (1997).
- 6[6] R.A. Horn and C.R. Johnson, Matrix Analysis (second edition), Cambridge University Press, New York (2013).
- 7[7] J. Lita da Silva, On anti-pentadiagonal persymmetric Hankel matrices with perturbed corners, Comput. Math. Appl. 72 , 415–426 (2016).
- 8[8] H. Karner, J. Schneid and C.W. Ueberhuber, Spectral decompostion of real circulant matrices, Linear Algebra Appl. 367 , 301–311 (2003).
