Hello,
I'm trying to compute the solution of a singular square system using a QR factorization. When I'm using a QR factorization with pivoting (i.e. ?geqp3), everything works OK. However, I'm concerned about the cost of pivoting, and I'd rather use ?geqrf. The problem is that the computed vector is in this case not a solution of the original system, as shown in the code attached. Do you see what I'm doing wrong ?
Also, could you comment on the performance of ?geqp3 vs. ?geqrf ?
Thank you.
