Examples of epsilonEquals()

Examples of mikera.arrayz.INDArray.epsilonEquals()

93
94
95
96
97
98
99
100
101
102
103
    } else {
      int sc=sliceCount();
      if (a.sliceCount()!=sc) return false;
      for (int i=0; i<sc; i++) {
        INDArray s=slice(i);
        if (!s.epsilonEquals(a.slice(i),epsilon)) return false;
      }     
      return true;
    }
  }
 
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

130
131
132
133
134
135
136
137
138
139
140
   
   
        // ----------------------------------------------------------------------
    // Check equality from D.
    startTimer();
    eq = D.epsilonEquals(M, 0.000001);
    printTime("epsilonEquals check result (" + eq + ", should be true): ");
   
   
        // ----------------------------------------------------------------------
    // Change sparse matrix and test equality again (shouldn't be equal)
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

42
43
44
45
46
47
48
49
50
51
52
        Matrix B = Matrix.createRandom(4,2);
        Matrix B_orig = B.copy();

        solver.solve(B);

        assertTrue(B_orig.epsilonEquals(B));
    }

    /**
     * See if a matrix that is more singular has a lower quality.
     */
 
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

115
116
117
118
119
120
121
122
123
124
125
        AMatrix x = solver.solve(b);


        Matrix x_expected = Matrix.create(new double[][] {{1}, {2}, {3}});

        assertTrue(x_expected.epsilonEquals(x,1e-8));
    }

    /**
     * This test checks to see if it can solve a system that will require some algorithms to
     * perform a pivot.  Pivots can change the data structure and can cause solve to fail if not
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

135
136
137
138
139
140
141
142
        assertNotNull(solver.setA(A));
        Matrix x = solver.solve(b).toMatrix();

        Matrix x_expected = Matrix.create(new double[][] {{1}, {2}, {3}});

        assertTrue(x_expected.epsilonEquals(x,1e-6));
    }
}
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

65
66
67
68
69
70
71
72
73
74
75
        Matrix B = Matrix.createRandom(4,2);
        Matrix B_orig = B.copy();

        solver.solve(B);

        assertTrue(B_orig.epsilonEquals(B));
    }

    /**
     * See if a matrix that is more singular has a lower quality.
     */
 
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

136
137
138
139
140
141
142
143
144
145
146
        AMatrix x = solver.solve(b);


        Matrix x_expected = Matrix.create(new double[][] {{1}, {2}, {3}});

        assertTrue(x_expected.epsilonEquals(x,1e-8));
    }

    /**
     * This test checks to see if it can solve a system that will require some algorithms to
     * perform a pivot.  Pivots can change the data structure and can cause solve to fail if not
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

155
156
157
158
159
160
161
162
163
164
165
        assertTrue(solver.setA(A));
        Matrix x = solver.solve(b).toMatrix();

        Matrix x_expected = Matrix.create(new double[][] {{1}, {2}, {3}});

        assertTrue(x_expected.epsilonEquals(x,1e-6));
    }

    /**
     * Have it solve for the coefficients in a polynomial
     */
 
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

76
77
78
79
80
81
82
83
84
85
86
        I.sub(temp1);
        Matrix Q = I;


        // check the expected properties of Q
        assertTrue(Q.epsilonEquals(Q.getTranspose(),1e-6));
        assertTrue(Q.epsilonEquals(Q.inverse(),1e-6));

//        SimpleMatrix result = Q.mult(A.extractMatrix(w,width,w,width));
        AStridedMatrix result = Multiplications.multiply(Q, A.subMatrix(w,width-w,w,width-w));
View Full Code Here

Examples of mikera.matrixx.Matrix.epsilonEquals()

77
78
79
80
81
82
83
84
85
86
87
        Matrix Q = I;


        // check the expected properties of Q
        assertTrue(Q.epsilonEquals(Q.getTranspose(),1e-6));
        assertTrue(Q.epsilonEquals(Q.inverse(),1e-6));

//        SimpleMatrix result = Q.mult(A.extractMatrix(w,width,w,width));
        AStridedMatrix result = Multiplications.multiply(Q, A.subMatrix(w,width-w,w,width-w));

        for( int i = 1; i < width-w; i++ ) {
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.