The QR decompostion always exists, even if the matrix does not have full column rank, so the compute
method will never fail. The primary use of the QR decomposition is in the least squares solution of
overdetermined systems of simultaneous linear equations. This will fail if the matrix does not have
full column rank. The rank must be equal to the number of columns.