Examples of DenseMatrix

Examples of no.uib.cipr.matrix.DenseMatrix

68
69
70
71
72
73
74
75
76
77
78
    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)
      for (int j = 0; j < n; ++j)
        if (i != j)
          assertEquals(J.get(i, j), 0, 1e-10);
        else
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

84
85
86
87
88
89
90
91
92
93
94
    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)
      for (int j = 0; j < n; ++j)
        if (i != j)
          assertEquals(J.get(i, j), 0, 1e-10);
        else
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
  }

  public void testDenseLUToInput() {
    // MTJ bug in DenseLU code

    Matrix m = new DenseMatrix(3, 3);

    // -2 2 -3
    // -1 1 3
    // 2 0 -1
    m.set(0, 0, -2);
    m.set(0, 1, 2);
    m.set(0, 2, -3);
    m.set(1, 0, -1);
    m.set(1, 1, 1);
    m.set(1, 2, 3);
    m.set(2, 0, 2);
    m.set(2, 1, 0);
    m.set(2, 2, -1);

    // SHOULD BE:
    // L:
    // 1.000 0.000 0.000
    // -1.000 1.000 0.000
    // 0.500 0.000 1.000
    //
    // U:
    // -2.000 2.000 -3.000
    // 0.000 2.000 -4.000
    // 0.000 0.000 4.500
    //
    // Permutation matrix:
    // 1.000 0.000 0.000
    // 0.000 0.000 1.000
    // 0.000 1.000 0.000

    DenseLU dlu = DenseLU.factorize(m);

    // check that m = L . U
    Matrix lTimesU = new DenseMatrix(3, 3);
    dlu.getL().mult(dlu.getU(), lTimesU);
    int[] pivots = dlu.getPivots();
    for (MatrixEntry entry : m) {
      int row = entry.row();
      int col = entry.column();
      double val = entry.get();
      double valLU = pivots[row] * lTimesU.get(row, col);
      assert val == valLU : "Row " + row + ", Col " + col
          + " wasn't equal! " + val + " " + valLU;
    }

    Matrix lu = dlu.getLU();
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

58
59
60
61
62
63
64
65
66
67
68
    protected void setUp() throws Exception {
        int size = Utilities.getInt(1, 8);
        coll = new CollectiveCommunications(size);

        int n = Utilities.getInt(size, 250);
        A_unsymm = new DenseMatrix(n, n);
        A_symm = new UpperSymmDenseMatrix(n);

        Utilities.populate(A_unsymm);
        Utilities.upperPopulate(A_unsymm);
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

114
115
116
117
118
119
120
121
122
123
124
        if (restart <= 0)
            throw new IllegalArgumentException(
                    "restart must be a positive integer");

        s = new DenseVector(restart + 1);
        H = new DenseMatrix(restart + 1, restart);
        rotation = new GivensRotation[restart + 1];

        v = new Vector[restart + 1];
        for (int i = 0; i < v.length; ++i)
            v[i] = r.copy().zero();
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

264
265
266
267
268
269
270
271
272
273
274
275
        Il.toArray(I);
        for (int i = 0; i < Al.size() - 1; ++i)
            this.A[i] = Al.get(i);

        // Create a LU decomposition of the smallest Galerkin matrix
        DenseMatrix Ac = new DenseMatrix(Al.get(Al.size() - 1));
        lu = new DenseLU(Ac.numRows(), Ac.numColumns());
        lu.factor(Ac);

        // Allocate vectors at each level
        u = new DenseVector[m];
        f = new DenseVector[m];
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

331
332
333
334
335
336
337
338
339
340
341
     * Solves directly at the coarsest level
     */
    private void directSolve() {
        int k = m - 1;
        u[k].set(f[k]);
        DenseMatrix U = new DenseMatrix(u[k], false);

        if (transpose)
            lu.transSolve(U);
        else
            lu.solve(U);
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
        // Allocate space for the decomposition
        Wr = new double[n];
        Wi = new double[n];

        if (left)
            Vl = new DenseMatrix(n, n);
        else
            Vl = null;

        if (right)
            Vr = new DenseMatrix(n, n);
        else
            Vr = null;

        // Find the needed workspace
        double[] worksize = new double[1];
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

105
106
107
108
109
110
111
     *            Matrix to factorize. Not modified
     * @return Newly allocated decomposition
     * @throws NotConvergedException
     */
    public static NativeEVD factorize(DenseMatrix A) throws NotConvergedException {
        return new NativeEVD(A.numRows()). factor(new DenseMatrix(A));
    }
View Full Code Here

Examples of no.uib.cipr.matrix.DenseMatrix

32
33
34
35
36
37
38
39
40
41
42
    Variable v1 = new Variable (Variable.CONTINUOUS);
    Variable v2 = new Variable (Variable.CONTINUOUS);
    Randoms r = new Randoms (2343);

    Vector mu = new DenseVector (new double[] { 1.0, 2.0 });
    Matrix var = new DenseMatrix (new double[][] {{ 0.5, 2.0 }, { 0, 1 }});
//    Matrix var = new DenseMatrix (new double[][] {{ 0.5, 2.0 }, { 2.0, 0.75 }});

    VarSet vars = new HashVarSet (new Variable[] { v1, v2 });
    Factor f = new NormalFactor (vars, mu, var);
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.