matrix multiplication convergence problem
Suppose A is a square matrix.
Does $A^n$(matrix multiplication) converge when n is an infinite big number？
Is it always true or under certain circumstances?
$\endgroup$2 Answers
$\begingroup$If the Jordan normal form of the matrix $A$ is $J$, then you have $A=PJP^{-1}$ and this yields $A^n=PJ^nP^{-1}$. So we only have to ask when powers of the Jordan blocks of the given matrix converge. The structure of powers of Jordan blocks is relatively simple.
It is relatively easy to see that the power $A^n$ converges to zero matrix if $|\lambda|<1$ for all eigenvalues of $A$. (See e.g. the result at the end of this text.)
If the only eigenvalue with absolute value 1 is 1 and the corresponding Jordan blocks have size 1, then it converges. If there is a Jordan block corresponding to 1 of size at least 2, then the power does not converge. (This was pointed out by Ted in the comments, thanks for the correction.)
If there are complex eigenvalues different from 1 with $|\lambda|=1$ then the power does not converge.
If it has an eigenvalue with $|\lambda|>1$, it does not converge.
$\endgroup$ 4 $\begingroup$The convergence properties of $A^n$ are fully understood by studying the eigenspectrum of $A$. The work by H.H. Bauschke thoroughly covers the subject, and beyond.
For example, a sufficient condition for convergence is that the spectral radius of $A$ be strictly less than $1$. In fact, in this case, $\underset{n \rightarrow \infty}{lim}A^n = 0$.
$\endgroup$
