I&#39;m in the process of trying to convert some Matlab code into Python. There&#39;s a statement of the form:<br><br>[q,r,e] = qr(A)<br><br>which performs a qr-decomposition of A, but then also returns a &#39;permutation&#39; matrix. The purpose of this is to ensure that the values along r&#39;s diagonal are decreasing. I believe this technique is called &quot;qr decomposition with column pivoting&quot; or (equivalently) &quot;qr decomposition with householder reflections&quot;.
<br><br>I have not been able to find an implementation of this within numpy. Does one exist? Or should I come to truly understand this algorithm (prob&#39;ly a good idea regardless) and implement it?<br><br>Thanks,<br>Steven
<br>