The square root factorization of a matrix is not unique. For large and sparse matrices, various algorithms and their implementations on different computing platforms have been studied for many years. The literature can be traced back to the early days of electronic computers [1]}. In the case of Cholesky factorization, the square root of a sparse matrix is still sparse, although the computation may require larger memory than the original matrix [2]}, [3]}.
