Package mikera.vectorz

Examples of mikera.vectorz.Vector

28
29
30
31
32
33
34
35
36
37
38
39
40
41
      v.scale(2.0);
    }   
  }
 
  public void timeImmutable(int runs) {
    Vector v=Vector.createLength(8388608);
    Vectorz.fillGaussian(v);
   
    for (int i=0; i<runs; i++) {
      Vector a=(Vector) v.addCopy(0.375);
      a=(Vector) a.sqrtCopy();
      a=(Vector) a.scaleCopy(2.0);
    }   
  }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
    }   
  }
 
  @SuppressWarnings("unused")
  public void timeOpsImmutable(int runs) {
    Vector v=Vector.createLength(8388608);
    Vectorz.fillGaussian(v);

    Op op = Ops.compose(Linear.create(2.0,0.0), Ops.compose(Ops.SQRT, Linear.create(0.0,0.375)));
    for (int i=0; i<runs; i++) {
      Vector a=(Vector) v.applyOpCopy(op);
    }   
  }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
      Vector a=(Vector) v.applyOpCopy(op);
    }   
  }
 
  public void timeOpsMutable(int runs) {
    Vector v=Vector.createLength(8388608);
    Vectorz.fillGaussian(v);

    Op op = Ops.compose(Linear.create(2.0,0.0), Ops.compose(Ops.SQRT, Linear.create(0.0,0.375)));
    for (int i=0; i<runs; i++) {
      v.applyOp(op);
    }   
  }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
72
      v.applyOp(op);
    }   
  }
 
  public void timeOptimised(int runs) {
    Vector v=Vector.createLength(8388608);
    Vectorz.fillGaussian(v);

    for (int i=0; i<runs; i++) {
      v.scaleAdd(4.0, 1.5); // combine scaling and addition
      v.sqrt();
    }   
  }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
public class TestSparseColumnMatrix {

  @Test public void testReplace() {
    SparseColumnMatrix m=SparseColumnMatrix.create(3, 3);
   
    Vector v=Vector.of(1,2,3);
   
    m.replaceColumn(1, v);
    assertTrue(v==m.getColumn(1)); // identical objects
    assertEquals(Vector.of(0,2,0),m.getRow(1));
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
  }

    @Test public void testSetColumn() {
        SparseColumnMatrix m=SparseColumnMatrix.create(3, 3);
       
        Vector v=Vector.of(1,2,3);
       
        m.setColumn(0, v);
        assertEquals(v,m.getColumn(0));
        assertEquals(1,m.getColumn(0).get(0),0.0);
    }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
    assertEquals(m,m2);
  }

  @Test public void testArithmetic() {
    SparseColumnMatrix M=SparseColumnMatrix.create(3, 3);
    Vector v=Vector.of(-1,2,3);
    M.replaceColumn(1, v);

    assertEquals(4, M.elementSum(), 0.01);
    assertEquals(14, M.elementSquaredSum(), 0.01);
    assertEquals(-1, M.elementMin(), 0.01);
    assertEquals(3, M.elementMax(), 0.01);
    assertEquals(3, M.nonZeroCount());

    SparseRowMatrix N = SparseRowMatrix.create(3,3);
    v=Vector.of(4,5,6);
    N.replaceRow(1, v);
        M.add(N);           // test add
        M.swapColumns(0,1);      // test swapColumns
    assertEquals(7, M.get(1,0), 0.01);

    SparseColumnMatrix M1 = SparseColumnMatrix.create(3, 3);
    Vector v1=Vector.of(-1,2,3);
    M1.replaceColumn(1, v1);

        int[] index = {0,2};
        double[] data = {7,8};
    SparseColumnMatrix M2 = SparseColumnMatrix.create(Vector.of(0,1,2),SparseIndexedVector.wrap(3, index, data),null);
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
    assertEquals(2, M1.get(1,1), 0.01);
  }

  @Test public void testSparseRowMultiply() {
    SparseColumnMatrix M=SparseColumnMatrix.create(3, 3);
    Vector v=Vector.of(1,2,3);
    M.replaceColumn(1, v);

    SparseRowMatrix N = SparseRowMatrix.create(3,3);
    v=Vector.of(4,5,6);
    N.replaceRow(1, v);
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
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
157
158
159
160
161
    // TODO: confirm this is a "Thin SVD"
    // as per Wikipedia
    int n = Math.min(rc, cc); // this should always be cc??

    Matrix u = Matrix.create(rc, n);
    Vector s = Vector.createLength(cc);
    Matrix v = Matrix.create(cc, cc);

    Vector e = Vector.createLength(cc);
    Vector work = Vector.createLength(rc);

    int nct = Math.min(rc - 1, cc);
    int nrt = Math.max(0, Math.min(cc - 2, rc));

    for (int k = 0; k < Math.max(nct, nrt); k++) {

      if (k < nct) {

        for (int i = k; i < rc; i++) {
          s.set(k, Math.hypot(s.get(k), a.get(i, k)));
        }

        if (Math.abs(s.get(k)) > Constants.EPS) {

          if (a.get(k, k) < 0.0) {
            s.set(k, -s.get(k));
          }

          for (int i = k; i < rc; i++) {
            a.set(i, k, a.get(i, k) / (s.get(k)));
          }

          a.addAt(k, k, 1.0);
        }

        s.set(k, -s.get(k));
      }

      for (int j = k + 1; j < cc; j++) {

        if ((k < nct) && (Math.abs(s.get(k)) > Constants.EPS)) {

          double t = 0;

          for (int i = k; i < rc; i++) {
            t += a.get(i, k) * a.get(i, j);
          }

          t = -t / a.get(k, k);

          for (int i = k; i < rc; i++) {
            a.addAt(i, j, (t * a.get(i, k)));
          }
        }

        e.set(j, a.get(k, j));
      }

      if (k < nct) {

        for (int i = k; i < rc; i++) {
          u.set(i, k, a.get(i, k));
        }

      }

      if (k < nrt) {

        e.set(k, 0);

        for (int i = k + 1; i < cc; i++) {
          e.set(k, Math.hypot(e.get(k), e.get(i)));
        }

        if (Math.abs(e.get(k)) > Constants.EPS) {

          if (e.get(k + 1) < 0.0) {

            e.set(k, -e.get(k));
          }

          for (int i = k + 1; i < cc; i++) {
            e.set(i, e.get(i) / (e.get(k)));
          }

          e.addAt(k + 1, 1.0);
        }

        e.set(k, -e.get(k));

        if ((k + 1 < rc) && (Math.abs(e.get(k)) > Constants.EPS)) {

          for (int j = k + 1; j < cc; j++) {
            for (int i = k + 1; i < rc; i++) {
              work.addAt(i, (e.get(j) * a.get(i, j)));
            }
          }

          for (int j = k + 1; j < cc; j++) {

            double t = -e.get(j) / e.get(k + 1);

            for (int i = k + 1; i < rc; i++) {
              a.addAt(i, j, (t * work.get(i)));
            }
          }
        }

        for (int i = k + 1; i < cc; i++) {
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
    PermutationMatrix p = PermutationMatrix.createIdentity(n);

    for (int j = 0; j < n; j++) {

      Vector jcolumn = m.getColumn(j).toVector();

      for (int i = 0; i < n; i++) {

        int kmax = Math.min(i, j);

        double s = 0.0;
        for (int k = 0; k < kmax; k++) {
          s += m.get(i, k) * jcolumn.unsafeGet(k);
        }

        jcolumn.set(i, jcolumn.unsafeGet(i) - s);
        m.set(i, j, jcolumn.unsafeGet(i));
      }

      int biggest = j;

      for (int i = j + 1; i < n; i++) {
        if (Math.abs(jcolumn.unsafeGet(i)) > Math.abs(jcolumn.unsafeGet(biggest)))
          biggest = i;
      }

      if (biggest != j) {
        m.swapRows(biggest, j);
View Full Code Here
TOP

Related Classes of mikera.vectorz.Vector

  • mikera.arrayz.TestNDArray
  • mikera.matrixx.AMatrix
  • mikera.matrixx.decompose.impl.hessenberg.TestHessenbergSimilarDecomposition
  • mikera.matrixx.decompose.impl.lu.SimpleLUP
  • mikera.matrixx.decompose.impl.svd.ThinSVD
  • mikera.matrixx.impl.AVectorMatrix
  • mikera.matrixx.impl.BandedMatrix
  • mikera.matrixx.impl.ColumnMatrix
  • mikera.matrixx.impl.SparseColumnMatrix
  • mikera.matrixx.impl.TestSparseColumnMatrix
    • 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.