In this report we analyze and compare four different implementations of Sparse Linear Systems solvers that make use of the Cholesky Decomposition for sparse, symmetric and positive defined matrices. We used MATLAB, C++, Python and R. For each environment, we will take into consideration its execution time, memory usage and relative error. We will also make comparisons between Windows and Linux.
