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

Suppose I have the Cholesky decomposition for a symmetric matrix $A$:

$$ A = L L^T $$

I wish to compute the Cholesky decomposition for $A+kI$ where $I$ is the identity and $k$ is a scalar. Is there a way to obtain this using the decomposition for $A$ faster than recomputing the Cholesky decomposition from scratch?

share|cite|improve this question
Have updated the question. If $k$ is negative then $A+kI$ may or may not be positive definite. For an example that is positive definite, take $A=2I$ and $k=-1$. – Alex Flint Jul 16 '13 at 19:45
There is a literature on the low-rank update of Cholesky-factored matrices, of which this is a very narrow case. See e.g.… – Nimrod Mar 9 at 21: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.