Examples of org.ejml.alg.dense.linsol.qr.LinearSolverQrHouseCol

org.ejml.alg.dense.linsol.qr.LinearSolverQrHouseCol

QR decomposition can be used to solve for systems. However, this is not as computationally efficient as LU decomposition and costs about 3n² flops.

It solve for x by first multiplying b by the transpose of Q then solving for the result.
QRx=b
Rx=Q^T b

A column major decomposition is used in this solver.
@author Peter Abeles

        System.out.println("Pseudo Inverse  = "+ solveBenchmark(
                new SolvePseudoInverseSvd(A.numRows,A.numCols),numTrials));
        System.out.println("QR house        = "+ solveBenchmark(
                new LinearSolverQrHouse(),numTrials));
        System.out.println("QR house Col    = "+ solveBenchmark(
                new LinearSolverQrHouseCol(),numTrials));
    }

View Full Code Here

        System.out.println("solve LU B            = "+ solveBenchmark(
                new LinearSolverLuKJI(new LUDecompositionAlt()),numTrials));
        System.out.println("solve QR house        = "+ solveBenchmark(
                new LinearSolverQrHouse(),numTrials));
        System.out.println("solve QR house Col    = "+ solveBenchmark(
                new LinearSolverQrHouseCol(),numTrials));
        System.out.println("solve PInv            = "+ solveBenchmark(
                new SolvePseudoInverseSvd(),numTrials));
//        System.out.println("solve SVD             = "+ solveBenchmark(
//                new LinearSolverSvd(new SvdNumericalRecipes(A.numRows,A.numCols)),numTrials/8));
    }

View Full Code Here

    private static void runAlgorithms( int numTrials )
    {
//        System.out.println("  solve QR house        = "+ solveBenchmark(
//                new LinearSolverQrHouse(),numTrials));
        System.out.println("  solve QR house Col    = "+ solveBenchmark(
                new LinearSolverQrHouseCol(),numTrials));
//        System.out.println("  solve QR tran        = "+ solveBenchmark(
//                new LinearSolverQrHouseTran(),numTrials));
//        System.out.println("  solve QR Block64      = "+ solveBenchmark(
//                new LinearSolverQrBlock64(),numTrials));
        System.out.println("  Selected              = "+ solveBenchmark(

View Full Code Here

//        names.add("LU NR");
//        solvers.add(new LinearSolverLuKJI(new LUDecompositionAlt()));
//        names.add("LU B");
//        solvers.add(new LinearSolverLu(new LUDecompositionAlt(),true));
//        names.add("LU A Imp");
        solvers.add(new LinearSolverQrHouseCol());
        names.add("QR");
//        solvers.add(new LinearSolverSvdNR(new SvdNumericalRecipes()));
//        names.add("SVD NR");
//        solvers.add(new LinearSolverUnrolled());
//        names.add("Unrolled");

View Full Code Here

TOP

Related Classes of org.ejml.alg.dense.linsol.qr.LinearSolverQrHouseCol

org.ejml.alg.dense.decomposition.qr.QRDecompositionHouseholderColumn

org.ejml.alg.dense.linsol.BenchmarkInverseStability

org.ejml.alg.dense.linsol.BenchmarkRectSolve

org.ejml.alg.dense.linsol.BenchmarkSolveEq

org.ejml.alg.dense.linsol.BenchmarkSolveOver

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.