Abstract: In this report we review the algorithms for the QR decomposition that are based on the Schmidt orthonormalization process and show how an accurate decomposition can be obtained using modified Gram Schmidt and reorthogonalization. We also show that the modified Gram Schmidt algorithm may be derived using the representation of the matrix product as a sum of matrices of rank one.