Package org.ejml.alg.dense.decomposition.qr

Examples of org.ejml.alg.dense.decomposition.qr.QRColPivDecompositionHouseholderColumn

34
35
36
37
38
39
40
         shouldFailSingular = false;
    }

    @Override
    protected LinearSolver<DenseMatrix64F> createSolver( DenseMatrix64F A ) {
        return new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),true);
    }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
    }

    @Test
    public void checkSingularBasic() {
        LinearSolver<DenseMatrix64F> solver =
                new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),true);
        GenericSolvePseudoInverseChecks checks = new GenericSolvePseudoInverseChecks(solver);

        checks.all();
    }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
    }

    @Test
    public void checkSingularFull() {
        LinearSolver<DenseMatrix64F> solver =
                new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),false);
        GenericSolvePseudoInverseChecks checks = new GenericSolvePseudoInverseChecks(solver);

        checks.all();
    }
View Full Code Here
34
35
36
37
38
39
40
         shouldFailSingular = false;
    }

    @Override
    protected LinearSolver<DenseMatrix64F> createSolver( DenseMatrix64F A ) {
        return new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),true);
    }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
    }

    @Test
    public void checkSingularBasic() {
        LinearSolver<DenseMatrix64F> solver =
                new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),true);
        GenericSolvePseudoInverseChecks checks = new GenericSolvePseudoInverseChecks(solver);

        checks.all();
    }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
    }

    @Test
    public void checkSingularFull() {
        LinearSolver<DenseMatrix64F> solver =
                new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),false);
        GenericSolvePseudoInverseChecks checks = new GenericSolvePseudoInverseChecks(solver);

        checks.all();
    }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
     * @param computeNorm2 true to compute the minimum 2-norm solution for singular systems. Try true.
     * @param computeQ Should it precompute Q or use house holder.  Try false;
     * @return Pseudo inverse type solver using QR with column pivots.
     */
    public static LinearSolver<DenseMatrix64F> leastSquaresQrPivot( boolean computeNorm2 , boolean computeQ ) {
        QRColPivDecompositionHouseholderColumn decomposition =
                new QRColPivDecompositionHouseholderColumn();

        if( computeQ )
            return new SolvePseudoInverseQrp(decomposition,computeNorm2);
        else
            return new LinearSolverQrpHouseCol(decomposition,computeNorm2);
View Full Code Here
145
146
147
148
149
150
151
     * @param numRows Number of rows the returned decomposition is optimized for.
     * @param numCols Number of columns that the returned decomposition is optimized for.
     * @return QRPDecomposition
     */
    public static QRPDecomposition<DenseMatrix64F> qrp( int numRows , int numCols ) {
        return new QRColPivDecompositionHouseholderColumn();
    }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
    private static void runAlgorithms( int numTrials )
    {
//        System.out.println("solve SVD            = "+ solveBenchmark(
//                new SolvePseudoInverseSvd(),numTrials));
        System.out.println("solve Gen QRP Basic  = "+ solveBenchmark(
                new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),false),numTrials));
        System.out.println("solve Gen QRP        = "+ solveBenchmark(
                new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),true),numTrials));
        System.out.println("solve QRP Col Basic  = "+ solveBenchmark(
                new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),false),numTrials));
        System.out.println("solve QRP Col        = "+ solveBenchmark(
                new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),true),numTrials));
    }
View Full Code Here
TOP

Related Classes of org.ejml.alg.dense.decomposition.qr.QRColPivDecompositionHouseholderColumn

  • org.ejml.alg.dense.linsol.BenchmarkSolvePseudoInverse
  • org.ejml.alg.dense.linsol.qr.TestSolveLinearSolverQrpHouseCol
  • org.ejml.alg.dense.linsol.qr.TestSolvePseudoInverseQrp
  • org.ejml.data.DenseMatrix64F
  • org.ejml.factory.DecompositionFactory
  • org.ejml.factory.LinearSolverFactory
    • Copyright © 2018 www.massapicom. 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.