Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a question about computing the following linear algebraic operation


$u = (1, 0, 0)$

$v = \begin{pmatrix} 1\\ 0\\ 0\end{pmatrix}$

$A = \begin{pmatrix} 0.5 &0.2 &0.3\\0.2 &0.3 &0.5\\ 0.3 &0.5 &0.2\end{pmatrix}$


$g(n) = u\cdot A^n\cdot v$

I want to calculate

$g(20)/g(19)$ constructing a Markov process and using Metropolis algorithm.

share|cite|improve this question

I don't know what the Metropolis algorithm is.

I know that if you can find a basis $x,y,z$ for ${\bf R}^3$ consisting of eigenvectors of $A$ with eigenvalues $a,b,c$, respectively, then $$A^nv=d_1a^nx+d_2b^ny+d_3c^nz$$ where you get the numbers $d_1,d_2,d_3$ from $v=d_1x+d_2y+d_3z$. Once you have $A^nv$ there is no difficulty getting $g(n)=uA^nv$, and then getting $g(20)/g(19)$.

Of course, since $A$ is stochastic and regular, $A^n$ converges, and I'd expect $g(20)/g(19)$ to be pretty close to $1$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.