Examples of QRColPivDecompositionHouseholderColumn


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

         shouldFailSingular = false;
    }

    @Override
    protected LinearSolver<DenseMatrix64F> createSolver( DenseMatrix64F A ) {
        return new SolvePseudoInverseQrp(new QRColPivDecompositionHouseholderColumn(),true);
    }
View Full Code Here

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

    }

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

        checks.all();
    }
View Full Code Here

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

    }

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

        checks.all();
    }
View Full Code Here

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

         shouldFailSingular = false;
    }

    @Override
    protected LinearSolver<DenseMatrix64F> createSolver( DenseMatrix64F A ) {
        return new LinearSolverQrpHouseCol(new QRColPivDecompositionHouseholderColumn(),true);
    }
View Full Code Here

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

    }

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

        checks.all();
    }
View Full Code Here

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

    }

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

        checks.all();
    }
View Full Code Here

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

     * @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

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

     * @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

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

    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
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.