An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method

Algorithm 3

HM 3: Modified Cholesky factorization.

diag() ( is a diagonal matrix whose diagonal entries are diagonal entries of )

for     do

   , with

end for