Examples of UpperTriangular


Examples of org.apache.mahout.math.UpperTriangular

  /*
   * warning: both of these return actually n+1 rows with the last one being //
   * not interesting.
   */
  public UpperTriangular getRTilde() {
    UpperTriangular packedR = new UpperTriangular(n);
    for (int i = 0; i < n; i++) {
      packedR.assignNonZeroElementsInRow(i, getRRow(i));
    }
    return packedR;
  }
View Full Code Here

Examples of org.apache.mahout.math.UpperTriangular

  }

  public static double[][] computeQtHat(double[][] qt, int i,
      Iterator<UpperTriangular> rIter) {
    UpperTriangular rTilde = rIter.next();
    for (int j = 1; j < i; j++) {
      mergeR(rTilde, rIter.next());
    }
    if (i > 0) {
      qt = mergeQrDown(rTilde, qt, rIter.next());
View Full Code Here

Examples of org.apache.mahout.math.UpperTriangular

  public int getKP() {
    return kp;
  }

  private void flushSolver() throws IOException {
    UpperTriangular r = qSolver.getRTilde();
    double[][] qt = qSolver.getThinQtTilde();

    rSubseq.add(r);

    value.setBlock(qt);
View Full Code Here

Examples of org.apache.mahout.math.UpperTriangular

     */
    int block = 0;
    while (rHatInput.hasNext()) {
      Vector value = rHatInput.next().get();
      if (block < blockNum && block > 0) {
        GivensThinSolver.mergeR(mRs.get(0), new UpperTriangular(value));
      } else {
        mRs.add(new UpperTriangular(value));
      }
      block++;
    }

  }
View Full Code Here

Examples of org.apache.mahout.math.UpperTriangular

        int k = conf.getInt(QJob.PROP_K, -1);
        int p = conf.getInt(QJob.PROP_P, -1);

        Validate.isTrue(k > 0, "invalid k parameter");
        Validate.isTrue(p >= 0, "invalid p parameter");
        mBBt = new UpperTriangular(k + p);

      }

      String xiPathStr = conf.get(PROP_XI_PATH);
      if (xiPathStr != null) {
View Full Code Here

Examples of org.apache.mahout.math.UpperTriangular

      long omegaSeed =
        Long.parseLong(context.getConfiguration().get(PROP_OMEGA_SEED));

      omega = new Omega(omegaSeed, k + p);

      mYtY = new UpperTriangular(kp);

      // see which one works better!
      // yRow = new RandomAccessSparseVector(kp);
      yRow = new DenseVector(kp);
    }
View Full Code Here

Examples of org.apache.mahout.math.hadoop.stochasticsvd.UpperTriangular

  /*
   * warning: both of these return actually n+1 rows with the last one being //
   * not interesting.
   */
  public UpperTriangular getRTilde() {
    UpperTriangular packedR = new UpperTriangular(n);
    for (int i = 0; i < n; i++) {
      packedR.assignNonZeroElementsInRow(i, getRRow(i));
    }
    return packedR;
  }
View Full Code Here

Examples of org.apache.mahout.math.hadoop.stochasticsvd.UpperTriangular

  }

  public static double[][] computeQtHat(double[][] qt, int i,
      Iterator<UpperTriangular> rIter) {
    UpperTriangular rTilde = rIter.next();
    for (int j = 1; j < i; j++) {
      mergeR(rTilde, rIter.next());
    }
    if (i > 0) {
      qt = mergeQrDown(rTilde, qt, rIter.next());
View Full Code Here

Examples of org.apache.mahout.math.hadoop.stochasticsvd.UpperTriangular

  public int getKP() {
    return kp;
  }

  private void flushSolver() throws IOException {
    UpperTriangular r = qSolver.getRTilde();
    double[][] qt = qSolver.getThinQtTilde();

    rSubseq.add(r);

    value.setBlock(qt);
View Full Code Here

Examples of org.apache.mahout.math.hadoop.stochasticsvd.UpperTriangular

     */
    int block = 0;
    while (rHatInput.hasNext()) {
      Vector value = rHatInput.next().get();
      if (block < blockNum && block > 0) {
        GivensThinSolver.mergeR(mRs.get(0), new UpperTriangular(value));
      } else {
        mRs.add(new UpperTriangular(value));
      }
      block++;
    }

  }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.