There are lots of QR decomposition algorithms and the results are not necessarily unique, especially for rank deficient inputs.
If you post your exact results, I could comment more specifically. Without more details, I really can't answer your question in any specific way. On Wed, Jan 18, 2012 at 9:39 AM, 刘鎏 <[email protected]> wrote: > Hi, > When I run QRDecomposition in mahout , I find the result of Q or R is > different from the example in wiki( > http://en.wikipedia.org/wiki/QR_decomposition#Using_Householder_reflections > ). > After reading the source code, I find the implement of QR decomposition is > exactly different from the tradition way such as the procedure in wiki. > Could any one show why mahout implement it in such a way? Thanks for your > replies! > > Liu Liu >
