Package no.uib.cipr.matrix

Examples of no.uib.cipr.matrix.DenseMatrix

85
86
87
88
89
90
91
92
93
94
95
        this.comm = A.getCommunicator();
        rank = comm.rank();
        size = comm.size();

        A0 = new DenseMatrix(size, size);
        b0 = new DenseVector(size);
        lu = new DenseLU(size, size);

        Ai = new double[size];
        if (rank == root) {
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
        this.comm = A.getCommunicator();
        rank = comm.rank();
        size = comm.size();

        A0 = new DenseMatrix(size, size);
        b0 = new DenseVector(size);
        lu = new DenseLU(size, size);

        Ai = new double[size];
        if (rank == root) {
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
218
219
    private void solveCoarseSystem(boolean transpose) {
        for (int i = 0; i < size; ++i)
            b0.set(i, zi0[i][0]);

        if (transpose)
            lu.transSolve(new DenseMatrix(b0, false));
        else
            lu.solve(new DenseMatrix(b0, false));

        double[] data = b0.getData();
        for (int i = 0; i < size; ++i)
            zi0[i][0] = data[i];
    }
View Full Code Here
333
334
335
336
337
338
339
340
341
342
        @Override
        protected Matrix createMatrix(Communicator comm) {
            int n = x.size();

            Matrix Al = new DenseMatrix(localLength[rank], localLength[rank]);
            Matrix Bl = new DenseMatrix(localLength[rank], n);

            return new DistRowMatrix(n, n, comm, Al, Bl);
        }
View Full Code Here
361
362
363
364
365
366
367
368
369
370
        @Override
        protected Matrix createMatrix(Communicator comm) {
            int n = x.size();

            Matrix Al = new DenseMatrix(localLength[rank], localLength[rank]);
            Matrix Bl = new DenseMatrix(n, localLength[rank]);

            return new DistColMatrix(n, n, comm, Al, Bl);
        }
View Full Code Here
33
34
35
36
37
38
39
40
    @Override
    protected void createPrimary() throws Exception {
        int n = Utilities.getInt(1, max);
        int m = Utilities.getInt(1, max);
        A = new DenseMatrix(n, m);
        Ad = Utilities.populate(A);
    }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
  }

  @Override
  protected void setUp() throws Exception {
    int n = Utilities.getInt(1, max);
    A = new DenseMatrix(n, n);
    Utilities.populate(A);
    Utilities.addDiagonal(A, 1);
    while (Utilities.singular(A))
      Utilities.addDiagonal(A, 1);
View Full Code Here
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
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
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
TOP

Related Classes of no.uib.cipr.matrix.DenseMatrix

  • cc.mallet.grmm.test.TestNormalFactor
  • gov.sandia.dfgleic.TSQR$TSQRIteration
  • no.uib.cipr.matrix.BandCholeskyTest
  • no.uib.cipr.matrix.BandLUTest
  • no.uib.cipr.matrix.DenseCholeskyTest
  • no.uib.cipr.matrix.DenseLUTest
  • no.uib.cipr.matrix.DenseMatrixTest
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest$ColumnDistIterativeSolver
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest$RowDistIterativeSolver
    • Copyright © 2018 www.massapicom. 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.