Hey Qifan, I think you can do a distributed QR if the matrix is thin.
http://mahout.apache.org/docs/latest/algorithms/linear-algebra/d-qr.html dqrThin(drmA) I think you want. On Thu, Apr 19, 2018 at 10:09 AM, Ted Dunning <[email protected]> wrote: > There was a variant of cholesky decomposition in Mahout at one time not so > long ago. I would guess that it is still there. > > It is difficult to make a truly distributed version of QR decomposition, > but for the purposes of the randomized SVD in Mahout, it wasn't actually > necessary to have a true QR. > > I don't have a pointer handy and I am not even sure that this code is still > in Mahout. > > Sorry about that. > > > > On Wed, Apr 18, 2018 at 7:08 PM, QIFAN PU <[email protected]> wrote: > > > Hi, > > > > I'm wondering if distributed cholesky decomposition on mahout is > supported > > now. > > From this doc: > > https://mahout.apache.org/users/sparkbindings/ScalaSparkBindings.pdf > > It seems that the implementation is single-node? > > > > Thanks, > > Qifan > > >
