Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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 matrix that is composed of small block diagonal matrices. For example:

$$ M = \left[ \begin{array}{ccc} \Sigma & \Psi & \Psi \\ \Psi & \Sigma & \Psi \\ \Psi & \Psi & \Sigma \\ \end{array} \right], $$ where both $\Sigma$ and $\Psi$ are diagonal matrices.

My question is: Is there an efficient way to perform Cholesky decomposition on this? It is such a regular matrix, that I feel like one must be able to do some trick to simplify the problem, rather than use brute force method.

For 2x2, I found a simple solution shown here ( However, I couldn't figure out how to generalize this to n dimension.

Thanks for your help.


share|cite|improve this question
I presume it is symmetric positive definite? – copper.hat Jun 16 '12 at 1:05
Yes, that's correct. Sorry I forgot to mention that. – Bin Jun 17 '12 at 17:41

Your Answer


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

Browse other questions tagged or ask your own question.