Examples of factor()

Examples of no.uib.cipr.matrix.DenseCholesky.factor()

117
118
119
120
121
122
123
124
125
126
    public void testUpperDenseCholeskyrcond() {
        int n = U.numRows();

        DenseCholesky c = new DenseCholesky(n, true);
        c.factor(U.copy());

        c.rcond(U);
    }
}
View Full Code Here

Examples of no.uib.cipr.matrix.DenseLU.factor()

64
65
66
67
68
69
70
71
72
73
74
  }

  public void testDenseLU() {
    int n = A.numRows();
    DenseLU lu = new DenseLU(n, n);
    lu.factor(A.copy());

    lu.solve(I);

    Matrix J = I.mult(A, new DenseMatrix(n, n));
    for (int i = 0; i < n; ++i)
View Full Code Here

Examples of no.uib.cipr.matrix.DenseLU.factor()

80
81
82
83
84
85
86
87
88
89
90
  }

  public void testDenseLUtranspose() {
    int n = A.numRows();
    DenseLU lu = new DenseLU(n, n);
    lu.factor(A.copy());

    lu.transSolve(I);

    Matrix J = I.transAmult(A, new DenseMatrix(n, n));
    for (int i = 0; i < n; ++i)
View Full Code Here

Examples of no.uib.cipr.matrix.DenseLU.factor()

96
97
98
99
100
101
102
103
104
105
106
  }

  public void testDenseLUrcond() {
    int n = A.numRows();
    DenseLU lu = new DenseLU(n, n);
    lu.factor(A.copy());

    lu.rcond(A, Matrix.Norm.One);
    lu.rcond(A, Matrix.Norm.Infinity);
  }
View Full Code Here

Examples of no.uib.cipr.matrix.LQ.factor()

42
43
44
45
46
47
48
49
50
51
52
        assertEquals(A, LQ.factorize(A));
    }

    public void testFactor() {
        LQ lq = new LQ(A.numRows(), A.numColumns());
        assertEquals(A, lq.factor(new DenseMatrix(A)));
    }

    public void testRepeatFactor() {
        LQ lq = new LQ(A.numRows(), A.numColumns());
        lq.factor(new DenseMatrix(A));
View Full Code Here

Examples of no.uib.cipr.matrix.PackCholesky.factor()

73
74
75
76
77
78
79
80
81
82
83
    public void testLowerPackCholesky() {
        int n = L.numRows();

        PackCholesky c = new PackCholesky(n, false);
        c.factor(L.copy());

        c.solve(I);

        Matrix J = I.mult(L, new DenseMatrix(n, n));
        for (int i = 0; i < n; ++i)
View Full Code Here

Examples of no.uib.cipr.matrix.PackCholesky.factor()

90
91
92
93
94
95
96
97
98
99
100
    public void testUpperPackCholesky() {
        int n = U.numRows();

        PackCholesky c = new PackCholesky(n, true);
        c.factor(U.copy());

        c.solve(I);

        Matrix J = I.mult(U, new DenseMatrix(n, n));
        for (int i = 0; i < n; ++i)
View Full Code Here

Examples of no.uib.cipr.matrix.PackCholesky.factor()

107
108
109
110
111
112
113
114
115
116
117
    public void testLowerPackCholeskyrcond() {
        int n = L.numRows();

        PackCholesky c = new PackCholesky(n, false);
        c.factor(L.copy());

        c.rcond(L);
    }

    public void testUpperPackCholeskyrcond() {
View Full Code Here

Examples of no.uib.cipr.matrix.PackCholesky.factor()

116
117
118
119
120
121
122
123
124
125
    public void testUpperPackCholeskyrcond() {
        int n = U.numRows();

        PackCholesky c = new PackCholesky(n, true);
        c.factor(U.copy());

        c.rcond(U);
    }
}
View Full Code Here

Examples of no.uib.cipr.matrix.QL.factor()

42
43
44
45
46
47
48
49
50
51
52
        assertEquals(A, QL.factorize(A));
    }

    public void testFactor() {
        QL ql = new QL(A.numRows(), A.numColumns());
        assertEquals(A, ql.factor(new DenseMatrix(A)));
    }

    public void testRepeatFactor() {
        QL ql = new QL(A.numRows(), A.numColumns());
        ql.factor(new DenseMatrix(A));
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.