Package mikera.matrixx

Examples of mikera.matrixx.AMatrix

46
47
48
49
50
51
52
53
54
    validateCholesky(a,r);   
  }
 
  @Test
  public void testSpecial() {
    AMatrix a = Matrix.create(new double[][] {{0,1},{0,0}});
    ICholeskyResult r=Cholesky.decompose(a);
    assertNull(r); 
  }
View Full Code Here
53
54
55
56
57
58
59
60
61
    assertNull(r); 
  }
 
  @Test
  public void testNegative() {
    AMatrix a = Matrix.create(new double[][] {{-1}});
    ICholeskyResult r=Cholesky.decompose(a);
    assertNull(r);   
  }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
70
71
72
    ICholeskyResult r=Cholesky.decompose(a);
    assertNull(r);   
  }
 
  public void validateCholesky(AMatrix a, ICholeskyResult r) {
    AMatrix l=r.getL();
    AMatrix u=r.getU();
   
    assertTrue("l and u and not transposes!",l.epsilonEquals(u.getTranspose()));
    assertTrue(l.isLowerTriangular());
    assertTrue(u.isUpperTriangular());
   
    assertTrue("product not valid",l.innerProduct(u).epsilonEquals(a));
  }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
        I.sub(temp1);
        Matrix expected = Multiplications.multiply(I, A_sub);

        qr.updateA(w,U.asDoubleArray(),gamma,tau);

        AMatrix found = qr.getQR();

        assertEquals(-tau,found.get(w,w),1e-8);

        for( int i = w+1; i < width; i++ ) {
            assertEquals(U.get(i,0),found.get(i,w),1e-8);
        }

        // the right should be the same
        for( int i = w; i < width; i++ ) {
            for( int j = w+1; j < width; j++ ) {
                double a = expected.get(i-w,j-w);
                double b = found.get(i,j);

                assertEquals(a,b,1e-6);
            }
        }
    }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
    assertEquals(1,m.lowerBandwidth());
  }
 
  @Test
  public void testBandedBandwidth() {
    AMatrix m=BandedMatrix.create(6, 6, -6, 6);
   
    assertEquals(0,m.upperBandwidth());
    assertEquals(5,m.upperBandwidthLimit());
    assertEquals(0,m.lowerBandwidth());
    assertEquals(5,m.lowerBandwidthLimit());
   
    m.getBand(-1).fill(1.0);
    assertEquals(0,m.upperBandwidth());
    assertEquals(1,m.lowerBandwidth());
  }
View Full Code Here
15
16
17
18
19
20
21
22
23
24
   
    mb.append(Vector3.of(1,0,0));
    mb.append(new double[] {0,1,0});
    mb.append(Vector.of(0,0).join(Vector.of(1)));
   
    AMatrix m= mb.toMatrix();
   
    assertEquals(3,m.rowCount());
    assertTrue(m.isIdentity());
  }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
    assertEquals(0.0,m.elementMax(),0.0);
    assertEquals(0.0,m.elementMin(),0.0);   
  }
 
  @Test public void testBigMatrix() {
    AMatrix m=Matrixx.createSparse(2000000,2000000);
    testBigStats(m);
    testBigStats(m.getTranspose());
   
    m.set(3,4,7.0);
    assertEquals(m,m.exactClone());
   
    AMatrix mt=m.getTranspose();
    assertEquals(m.getTranspose(),mt);
   
    assertTrue(m.density()<0.0001);
  }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
   
    assertTrue(m.density()<0.0001);
  }
 
  @Test public void testBigMultiply() {
    AMatrix m=Matrixx.createSparse(2000000,2000000);
    m.set(3,4,7.0);
   
    AMatrix r=m.innerProduct(m.getTranspose());
    assertEquals(49.0,r.get(3,3),0.0);
    assertEquals(49.0,r.elementSum(),0.0);
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
    assertEquals(49.0,r.get(3,3),0.0);
    assertEquals(49.0,r.elementSum(),0.0);
  }
 
  @Test public void testSparseAdd() {
    AMatrix m=Matrixx.createSparse(20000,20000);
    m.add(ZeroMatrix.create(20000, 20000));
   
    assertTrue(m.isZero());
   
    AMatrix mz=m.addCopy(Matrixx.createSparse(20000,20000));
    assertTrue(mz.isZero());
  }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
    AMatrix mz=m.addCopy(Matrixx.createSparse(20000,20000));
    assertTrue(mz.isZero());
  }
 
  @Test public void testSparseInnerProduct() {
    AMatrix m=Matrixx.createSparse(200000,200000);
   
    AMatrix mt=m.getTranspose();
    AMatrix mmt = m.innerProduct(mt);
   
    assertTrue(mmt.isSameShape(m));
  }
View Full Code Here
TOP

Related Classes of mikera.matrixx.AMatrix

  • example.BasicMatrixUsage
  • example.SparseArrays
  • example.SparseMatrix
  • mikera.arrayz.INDArray
  • mikera.arrayz.TestMiscArrayOps
  • mikera.matrixx.algo.TestCholesky
  • mikera.matrixx.algo.TestLinear
  • mikera.matrixx.algo.TestQR
  • mikera.matrixx.decompose.impl.chol.SimpleCholesky
  • mikera.matrixx.decompose.impl.eigen.SymmetricQRAlgorithmDecomposition
    • 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.