Difference between dpptrf and dpotrf
Hi,
I have implemented my own piece of code for computing a cholesky decomposition for symmetric packed matrices. To test it, I compared it with the LAPACK-routine dpptrf, but unfortunately the results were not similar.
However, compared to the dpotrf-routine, the results are exactly the same.
Besides the use of packed format in dpptrf is there any other algorithmic difference with dpotrf?
It seems that the second diagonal element (L(2,2)) is already quite different. In dpptrf it is just the square root of the original A(2,2)-element while it should be: sqrt(A(2,2)-A(2,1)²/A(1,1)).
Is there some sort of block algorithm used in dpptrf?
Best regards,
Arne
edit: I must say that the matrix was a singular matrix, does that make any difference?
I have implemented my own piece of code for computing a cholesky decomposition for symmetric packed matrices. To test it, I compared it with the LAPACK-routine dpptrf, but unfortunately the results were not similar.
However, compared to the dpotrf-routine, the results are exactly the same.
Besides the use of packed format in dpptrf is there any other algorithmic difference with dpotrf?
It seems that the second diagonal element (L(2,2)) is already quite different. In dpptrf it is just the square root of the original A(2,2)-element while it should be: sqrt(A(2,2)-A(2,1)²/A(1,1)).
Is there some sort of block algorithm used in dpptrf?
Best regards,
Arne
edit: I must say that the matrix was a singular matrix, does that make any difference?