OK, I attached a file to the issue tracker (sorry, github looked way
too complicated). The algorithm factors A -> Q, R or A -> L, Q
depending on the dimensions of A. The only restriction is m > 1 and n
> 1. The matrix A can have any content (even all zeros). I've tested
it on over 200k random sized matrices (m > n, m = n, m < n) with
random integers and floats, sprinkled with rows and columns of zeros,
duplicate rows and columns, and all zeros. So far no errors. I hope
the algorithm is a useful contribution.