If the coefficient matrix A in a least squares problem has dimensions m × n and rank n, then the three methods of solution discussed in Section 7, the normal equations, the QR factorization, and the singular value decomposition, will all compute highly accurate solutions.
In the case of a true statement, explain or prove your answer. In the case of a false statement, give an example to show that the statement is not always true.