I am having trouble finding information about decomposing a complex symmetric positive definite matrix. I was wondering if the cholesky decomposition would change to accommodate complex numbers. I understand that multiplying, dividing, and taking the square root of complex numbers is not the same as with real numbers, but would any additional components need to be added to the algorithm? I only ask because I am writing a C program and need to implement the Cholesky function. I have written code that works properly for the real decomposition, but when I try to use complex numbers, I am not getting the correct answer. I did read this, however... "All the square roots appearing are real. So if one writes a computer programme implementing the Cholesky factorisation one can be sure that no complex numbers appear in the course of the computation." How would this be so? The answer has imaginary parts, not on the diagonals (is that what this means), but elsewhere.