I found a "Cholesky's method" in my maths textbook, this looks like what you want:
code:
We have a matrix A
A = a11 a12 a13
a21 a22 a23
a31 a32 a33
And we want two matrices B and BT
B = b11 0 0
b21 b22 0
b31 b32 b33
BT = b11 b21 b31
0 b22 b32
0 0 b33
First row/column: (b11 to bj1)
b11 = sqrt(a11)
bj1 = aj1/b11
Diagonal: (b11 to bjj)
bjj = sqrt(ajj - sum [s = 1 to j - 1] (bjs2)
Everything else:
bpj = 1/bjj(apj - sum [s = 1 to j - 1] (bps bsj)
I assume afterwards that you'd find B-1B-1T to get A-1, like you do with the other decompositions.
[This message has been edited by mole (edited 11-30-2003 09:09 AM).]