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. The QR method is accurate and robust, but does not offer as robust control over the rank deficiency tolerance as the SVD method. This method is not as fast as the other two, but is very robust to problems of near singularity and is as accurate as the QR method.
Objects using all three methods are available.