The simplest implementation of the Cholesky factorization is generally known as the right-looking variant. The naming comes from the fact that at every stage of the algorithm, the bulk of the computation is due to the update of the part of matrix A to the right of the ``current'' column.