Cholesky. The Cholesky decomposition method forms a Cholesky decomposition of the system's normal equations. It is only suitable for full rank problems. While it is not as accurate or robust as the other methods, it is the fastest of the three.

QR. The QR method uses the QR decomposition of the system matrix for nonsingular problems, or a complete orthogonal decomposition if the system is rank deficient numerically. The QR method is accurate and robust, but does not offer as robust control over the rank deficiency tolerance as the SVD method.

SVD. The SVD (singular value decomposition) method constructs an SVD of the system matrix. This method is not as fast as the other two, but is very robust for problems of near singularity and is as accurate as the QR method.