Cholesky Decomposition Method (Algorithm)
Iteration/Recursion
ggb.Iteration()
A linear system L L^T x = b, where L is a lower triangular matrix and L^T is a upper triangular matrix can be solved by forward substitution L y = b/backward substitution L^T x = y (starting with the upper/lower right-hand corner of the triangular matrix in the order of inceasing/decreasing the row numbers i)
solve forward substitution, backward substitution
ggb.Iterationlist()
