Examples of decompose()

Examples of org.ejml.alg.block.decomposition.qr.BlockMatrix64HouseholderQR.decompose()

65
66
67
68
69
70
71
72
73
74
75
        for( long i = 0; i < numTrials; i++ ) {
            if( alg.inputModified())
                B = A.copy();
            else
                B = A;
            if( !alg.decompose(B) ) {
                throw new RuntimeException("Bad matrix");
            }
        }

        return System.currentTimeMillis() - prev;
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.bidiagonal.BidiagonalDecompositionRow.decompose()

207
208
209
210
211
212
213
214
215
216
217
        }
    }

    public static SvdImplicitQrAlgorithm createHelper( DenseMatrix64F a ) {
        BidiagonalDecompositionRow bidiag = new BidiagonalDecompositionRow();
        assertTrue(bidiag.decompose(a.<DenseMatrix64F>copy()));
        double diag[] = new double[a.numRows];
        double off[] = new double[ diag.length-1 ];
        bidiag.getDiagonal(diag,off);

        return createHelper(a.numRows,a.numCols,diag,off);
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.chol.CholeskyDecompositionInner.decompose()

45
46
47
48
49
50
51
52
53
54
55
    public CovarianceRandomDraw( Random rand , DenseMatrix64F cov )
    {
        r = new DenseMatrix64F(cov.numRows,1);
        CholeskyDecompositionInner choleky = new CholeskyDecompositionInner( true);

        choleky.decompose(cov);

        A = choleky.getT();
        this.rand = rand;
    }
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.chol.CholeskyDecompositionInner.decompose()

112
113
114
115
116
117
118
119
120
121
122
        CholeskyDecompositionInner chol = new CholeskyDecompositionInner(true);
        if( chol.inputModified() )
            A = A.copy();

        return chol.decompose(A);
    }

    /**
     * <p>
     * Checks to see if the matrix is positive semidefinite:
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.hessenberg.TridiagonalDecompositionHouseholder.decompose()

107
108
109
110
111
112
113
114
115
116
117
    @Test
    public void multipleEigenvalues() {
        DenseMatrix64F A = new DenseMatrix64F(5,5, true, 2.191140, -0.098491, -0.397037, 0.367426, -0.208338, -0.098491, 2.776741, 0.623341, 0.624798, 0.401906, -0.397037, 0.623341, 3.571302, -0.239631, -0.264573, 0.367426, 0.624798, -0.239631, 3.625034, -0.162896, -0.208338, 0.401906, -0.264573, -0.162896, 3.835783);

        TridiagonalDecompositionHouseholder tridiag = new TridiagonalDecompositionHouseholder();
        tridiag.decompose(A);

        double diag[] = new double[5];
        double off[] = new double[4];

        tridiag.getDiagonal(diag,off);
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.hessenberg.TridiagonalDecompositionHouseholderOrig.decompose()

52
53
54
55
56
57
58
59
60
61
62
           
            DenseMatrix64F A = RandomMatrices.createSymmetric(width,-1,1,rand);
            BlockMatrix64F Ab = BlockMatrixOps.convert(A,r);

            TridiagonalDecompositionHouseholderOrig decomp = new TridiagonalDecompositionHouseholderOrig();
            decomp.decompose(A);

            DenseMatrix64F expected = decomp.getQT();

            TridiagonalDecompositionBlockHouseholder decompB = new TridiagonalDecompositionBlockHouseholder();
            assertTrue(decompB.decompose(Ab));
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.hessenberg.TridiagonalDecompositionHouseholderOrig.decompose()

59
60
61
62
63
64
65
66
67
68
69
            // create a random symmetric matrix
            SimpleMatrix A = SimpleMatrix.wrap(RandomMatrices.createSymmetric(width,-1,1,rand));

            TridiagonalDecompositionHouseholderOrig decomp = new TridiagonalDecompositionHouseholderOrig();
            decomp.decompose(A.getMatrix());

            D1Submatrix64F Ab = insertIntoBlock(offX,offY,A,r);
            D1Submatrix64F V = new D1Submatrix64F(new BlockMatrix64F(r,offX+A.numCols(),r));
            V.col0 = offX;
            V.row1 = Ab.row1-Ab.row0;
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.lu.LUDecompositionAlt.decompose()

42
43
44
45
46
47
48
49
50
51
52
        for( int N = 2; N <= UnrolledDeterminantFromMinor.MAX; N++ ) {
            DenseMatrix64F A = RandomMatrices.createRandom(N,N,rand);

            double unrolled = UnrolledDeterminantFromMinor.det(A);
            LUDecompositionAlt alg = new LUDecompositionAlt();
            assertTrue( alg.decompose(A) );
            double expected = alg.computeDeterminant();

            assertEquals(expected,unrolled,1e-8);
        }
    }
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.lu.LUDecompositionAlt.decompose()

88
89
90
91
92
93
94
95
96
97
98
        for( int width = 5; width < 12; width++ ) {
            DenseMatrix64F A = RandomMatrices.createRandom(width,width,rand);

            LUDecompositionAlt lu = new LUDecompositionAlt();
            lu.decompose(A);

            double luVal = lu.computeDeterminant();

            DeterminantFromMinor minor = new DeterminantFromMinor(width);
            double minorVal = minor.compute(new DenseMatrix64F(width,width, true, A.data));
View Full Code Here

Examples of org.ejml.alg.dense.decomposition.lu.LUDecompositionAlt.decompose()

629
630
631
632
633
634
635
636
637
638
639
            } else {
                return mat.get(0);
            }
        } else {
            LUDecompositionAlt alg = new LUDecompositionAlt();
            if( !alg.decompose(mat) )
                return 0.0;
            return alg.computeDeterminant();
        }
    }
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.