Examples of QRDecomposition

Jama.QRDecomposition
QR Decomposition.
For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that A = Q*R.
The QR decompostion always exists, even if the matrix does not have full rank, so the constructor will never fail. The primary use of the QR decomposition is in the least squares solution of nonsquare systems of simultaneous linear equations. This will fail if isFullRank() returns false.
org.apache.commons.math.linear.QRDecomposition
nist.gov/javanumerics/jama/">JAMA library, with the following changes:
- a {@link #getQT() getQT} method has been added,
- the solve and isFullRank methods have been replaced by a {@link #getSolver() getSolver} method and the equivalent methods provided bythe returned {@link DecompositionSolver}.
@see MathWorld @see Wikipedia @version $Revision: 826627 $ $Date: 2009-10-19 12:27:47 +0200 (lun. 19 oct. 2009) $ @since 1.2
org.apache.commons.math3.linear.QRDecomposition
nist.gov/javanumerics/jama/">JAMA library, with the following changes:
- a {@link #getQT() getQT} method has been added,
- the {@code solve} and {@code isFullRank} methods have been replacedby a {@link #getSolver() getSolver} method and the equivalent methodsprovided by the returned {@link DecompositionSolver}.
@see MathWorld @see Wikipedia @since 1.2 (changed to concrete class in 3.0)
org.apache.mahout.math.QRDecomposition
partially deprecated until unit tests are in place. Until this time, this class/interface is unsupported.
org.ejml.factory.QRDecomposition
QR decompositions decompose a rectangular matrix 'A' such that 'A=QR'. Where A ∈ ℜ ^{n × m} , n ≥ m, Q ∈ ℜ ^{n × n} is an orthogonal matrix, and R ∈ ℜ ^{n × m} is an upper triangular matrix. Some implementations of QR decomposition require that A has full rank.

Some features of QR decompositions:
- Can decompose rectangular matrices.
- Numerically stable solutions to least-squares problem, but not as stable as SVD
- Can incrementally add and remove columns from the decomposed matrix. See {@link org.ejml.alg.dense.linsol.qr.AdjLinearSolverQr}
Orthogonal matrices have the following properties:
- QQ^T=I
- Q^T=Q^-1
@see org.ejml.alg.dense.decomposition.qr.QRDecompositionHouseholder @see org.ejml.alg.dense.decomposition.qr.QRDecompositionHouseholderColumn @author Peter Abeles
org.encog.mathutil.matrices.decomposition.QRDecomposition
nist.gov/javanumerics/jama/
org.jquantlib.math.matrixutilities.QRDecomposition
fpl.fs.fed.us/optimization.html">MINPACK/J
This subroutine uses householder transformations with optional column pivoting to compute a QR factorization of the {@latex$ m} by {@latex$ n} matrix {@latex$ A}.
That is, Minpack_f77#qrfac determines an orthogonal matrix {@latex$ Q}, a permutation matrix {@latex$ P}, and an upper trapezoidal matrix {@latex$ R} with diagonal elements of nonincreasing magnitude, such that {@latex$ A*P = Q*R}.
Return value ipvt is an integer array of length {@latex$ n}, which defines the permutation matrix {@latex$ P}such that {@latex$ A*P = Q*R}.
Column {@latex$ j} of {@latex$ P} is column ipvt[j] of the identity matrix.
See lmdiff.cpp for further details. @see MathWorld @see Wikipedia @see MINPACK/J @see MINPACK @author Richard Gomes

Examples of org.apache.mahout.math.QRDecomposition

      return null;
    }
  }


  private static Matrix solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y);
  }

View Full Code Here

Examples of org.apache.mahout.math.QRDecomposition

  public Vector solve(Vector ratings) {
    return solve(YtransposeY.plus(getYtransponseCuMinusIYPlusLambdaI(ratings)), getYtransponseCuPu(ratings));
  }


  private static Vector solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y).viewColumn(0);
  }

View Full Code Here

Examples of org.apache.mahout.math.QRDecomposition

    /* compute Ai * ui = Vi */
    return solve(Ai, Vi);
  }


  private static Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).viewColumn(0);
  }

View Full Code Here

Examples of org.apache.mahout.math.QRDecomposition

    Matrix a = m.viewPart(0, rows, 1, 2);
    Matrix b = m.viewPart(0, rows, 0, 1);


    Matrix ata = a.transpose().times(a);
    Matrix atb = a.transpose().times(b);
    QRDecomposition s = new QRDecomposition(ata);
    Matrix r = s.solve(atb).transpose();
    assertEquals(expectedCoefficient, r.get(0, 0), 0.2);
    return r.times(new DenseVector(new double[]{Math.log(currentIndex), 1})).get(0);
  }

View Full Code Here

Examples of org.apache.mahout.math.QRDecomposition

    /* compute ui = inverse(Ai) * Vi */
    return solve(Ai, Vi);
  }


  Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).getColumn(0);
  }

View Full Code Here

Examples of org.apache.mahout.math.QRDecomposition

    /* compute Ai * ui = Vi */
    return solve(Ai, Vi);
  }


  private static Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).viewColumn(0);
  }

View Full Code Here

Examples of org.ejml.factory.QRDecomposition

        // compute what the A matrix would look like without the row
        DenseMatrix64F A_e = RandomMatrices.createRandom(m-1,n,rand);
        SubmatrixOps.setSubMatrix(A,A_e,0,0,0,0,remove,n);
        SubmatrixOps.setSubMatrix(A,A_e,remove+1,0,remove,0,m-remove-1,n);


        QRDecomposition decomp = new QRDecompositionHouseholderColumn();


        // now compute the results by removing elements from A
        decomp.decompose(A);
        Q.reshape(m,m, false);
        decomp.getQ(Q,false);
        decomp.getR(R,false);


        QrUpdate update = new QrUpdate(m,n);


        update.deleteRow(Q,R,remove,true);

View Full Code Here

Examples of org.ejml.factory.QRDecomposition

        DenseMatrix64F A_e = RandomMatrices.createRandom(m+1,n,rand);
        SubmatrixOps.setSubMatrix(A,A_e,0,0,0,0,insert,n);
        System.arraycopy(row, 0, A_e.data, insert * n, n);
        SubmatrixOps.setSubMatrix(A,A_e,insert,0,insert+1,0,m-insert,n);


        QRDecomposition decomp = new QRDecompositionHouseholderColumn();


        decomp.decompose(A);
        Q.reshape(m,m, false);
        decomp.getQ(Q,false);
        R.reshape(m,n,false);
        decomp.getR(R,false);


        DenseMatrix64F Qmod = createQMod(Q,insert);


        QrUpdate update = new QrUpdate(m+1,n);

View Full Code Here

Examples of org.encog.mathutil.matrices.decomposition.QRDecomposition

        {21,22,23,24},
        {25,27,28,29},
        {37,33,31,30} };
    Matrix matrix2 = new Matrix(m2);
    
    QRDecomposition c = new QRDecomposition(matrix1);
    Matrix mx = c.solve(matrix2);
    
    Assert.assertEquals(17.0, mx.get(0,0));
    Assert.assertEquals(22.0, mx.get(1,1));
    Assert.assertEquals(28.0, mx.get(2,2));
    Assert.assertEquals(4, mx.getRows());

View Full Code Here

Examples of org.encog.mathutil.matrices.decomposition.QRDecomposition

   */
  public final Matrix solve(final Matrix b) {
    if (getRows() == getCols()) {
      return (new LUDecomposition(this)).solve(b);
    } else {
      return (new QRDecomposition(this)).solve(b);
    }
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.