Examples of DecompositionSolver

org.apache.commons.math.linear.DecompositionSolver
Interface handling decomposition algorithms that can solve A × X = B.
Decomposition algorithms decompose an A matrix has a product of several specific matrices from which they can solve A × X = B in least squares sense: they find X such that ||A × X - B|| is minimal.

Some solvers like {@link LUDecomposition} can only find the solution forsquare matrices and when the solution is an exact linear solution, i.e. when ||A × X - B|| is exactly 0. Other solvers can also find solutions with non-square matrix A and with non-null minimal norm. If an exact linear solution exists it is also the minimal norm solution.
@version $Revision: 811685 $ $Date: 2009-09-05 19:36:48 +0200 (sam. 05 sept. 2009) $ @since 2.0
org.apache.commons.math3.linear.DecompositionSolver
Interface handling decomposition algorithms that can solve A × X = B.
Decomposition algorithms decompose an A matrix has a product of several specific matrices from which they can solve A × X = B in least squares sense: they find X such that ||A × X - B|| is minimal.
Some solvers like {@link LUDecomposition} can only find the solution forsquare matrices and when the solution is an exact linear solution, i.e. when ||A × X - B|| is exactly 0. Other solvers can also find solutions with non-square matrix A and with non-null minimal norm. If an exact linear solution exists it is also the minimal norm solution. @since 2.0

Examples of org.apache.commons.math3.linear.DecompositionSolver


        // Compute transpose(J)J.
        final RealMatrix jTj = j.transpose().multiply(j);


        // Compute the covariances matrix.
        final DecompositionSolver solver
            = new QRDecomposition(jTj, threshold).getSolver();
        return solver.getInverse().getData();
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver

            }


            try {
                // solve the linearized least squares problem
                RealMatrix mA = new BlockRealMatrix(a);
                DecompositionSolver solver = useLU ?
                        new LUDecomposition(mA).getSolver() :
                        new QRDecomposition(mA).getSolver();
                final double[] dX = solver.solve(new ArrayRealVector(b, false)).toArray();
                // update the estimated parameters
                for (int i = 0; i < nC; ++i) {
                    currentPoint[i] += dX[i];
                }
            } catch (SingularMatrixException e) {

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver


        // Compute transpose(J)J.
        final RealMatrix jTj = j.transpose().multiply(j);


        // Compute the covariances matrix.
        final DecompositionSolver solver
            = new QRDecomposition(jTj, threshold).getSolver();
        return solver.getInverse().getData();
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver

            }


            try {
                // solve the linearized least squares problem
                RealMatrix mA = new BlockRealMatrix(a);
                DecompositionSolver solver = useLU ?
                        new LUDecomposition(mA).getSolver() :
                        new QRDecomposition(mA).getSolver();
                final double[] dX = solver.solve(new ArrayRealVector(b, false)).toArray();
                // update the estimated parameters
                for (int i = 0; i < nC; ++i) {
                    currentPoint[i] += dX[i];
                }
            } catch (SingularMatrixException e) {

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver

     * are stored in As and Bs.
     */
    private void computeMllrTransforms(double[][][][][] regLs,
            double[][][][] regRs) {
        int len;
        DecompositionSolver solver;
        RealMatrix coef;
        RealVector vect, ABloc;


        for (int c = 0; c < nrOfClusters; c++) {
            this.As[c] = new float[loader.getNumStreams()][][];
            this.Bs[c] = new float[loader.getNumStreams()][];


            for (int i = 0; i < loader.getNumStreams(); i++) {
                len = loader.getVectorLength()[i];
                this.As[c][i] = new float[len][len];
                this.Bs[c][i] = new float[len];


                for (int j = 0; j < len; ++j) {
                    coef = new Array2DRowRealMatrix(regLs[c][i][j], false);
                    solver = new LUDecomposition(coef).getSolver();
                    vect = new ArrayRealVector(regRs[c][i][j], false);
                    ABloc = solver.solve(vect);


                    for (int k = 0; k < len; ++k) {
                        this.As[c][i][j][k] = (float) ABloc.getEntry(k);
                    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver

  public Solver getSolver(RealMatrix M) {
    if (M == null) {
      return null;
    }
    RRQRDecomposition decomposition = new RRQRDecomposition(M, SINGULARITY_THRESHOLD);
    DecompositionSolver solver = decomposition.getSolver();
    if (solver.isNonSingular()) {
      return new Solver(solver);
    }
    // Otherwise try to report apparent rank
    int apparentRank = decomposition.getRank(0.01); // Better value?
    log.warn("{} x {} matrix is near-singular (threshold {}). Add more data or decrease the " +

View Full Code Here

Examples of org.apache.commons.math3.linear.DecompositionSolver

    throw new SingularMatrixSolverException(apparentRank, "Apparent rank: " + apparentRank);
  }  


  public boolean isNonSingular(RealMatrix M) {
    QRDecomposition decomposition = new RRQRDecomposition(M, SINGULARITY_THRESHOLD);
    DecompositionSolver solver = decomposition.getSolver();
    return solver.isNonSingular();
  }

View Full Code Here

0 1 2 3 4

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.