1
$\begingroup$

Suppose that I have an $nk \times nk$ matrix of the form $$ T_n = \left[\begin{array}{cccccc} A&B&&&&\\ B^T&A&B&&&\\ &B^T&A&B&&\\ &&\ddots&\ddots&\ddots&\\ &&&B^T&A&B\\ &&&&B^T&A\\ \end{array} \right] $$ where $A$ and $B$ are $k \times k$ real matrices (with $A$ symmetric).

This is a symmetric block-tridiagonal matrix.

I would like an expression for the characteristic polynomial of $T_n$, or even a recurrence to compute the characteristic polynomial of $T_n$.

If I had the slightly different matrix $$ T'_n = \left[\begin{array}{cccccc} A&B&&&&B^T\\ B^T&A&B&&&\\ &B^T&A&B&&\\ &&\ddots&\ddots&\ddots&\\ &&&B^T&A&B\\ B&&&&B^T&A\\ \end{array} \right] $$ which is a block-circulant matrix, then there is a nice expression to be found in Denis Serre's answer to the question:

One question on block-circulant matrices

which can be used to express the characteristic polynomial as a product of determinants of various matrices.

There are various papers about block tridiagonal matrices, in particular one by Molinari (https://arxiv.org/abs/0712.0681), that seems initially promising, but this requires the off-diagonal blocks to be invertible (mine are not invertible).

There is also the question Determinant of block tridiagonal matrices that asks the same thing (essentially) for a particular instance of a matrix of this form where $A = J_k$ and $B = I_k$ ($J_k$ is the all-ones matrix of order $k \times k$). My blocks do not commute so this answer does not work for me.

Any pointers or references gratefully received.

$\endgroup$
2
  • $\begingroup$ If you can handle invertible $A,B$, shouldn't that give the general case by approximation? $\endgroup$ Commented Oct 6 at 15:33
  • $\begingroup$ @ChristianRemling I am not quite sure what you mean by that - the paper by Molinari has an expression that involves various $2 \times 2$ block matrices whose blocks are products involving multiple occurrences of each $B_i^{-1}$. I can't see how to modify it to accommodate non-invertible blocks. $\endgroup$ Commented Oct 8 at 1:05

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.