@@ -88,19 +88,19 @@ <N extends Number> void testBuilder(DArrayManager tm, DType<N> dt) {
88
88
}
89
89
}
90
90
91
- <N extends Number > void testDimension (DArrayManager tm , DType <N > dt ) {
92
- var e = assertThrows (IllegalArgumentException .class , () -> tm .random (dt , Shape .of (10 , 50 ), random ).svd ());
91
+ <N extends Number > void testDimension (DArrayManager dm , DType <N > dt ) {
92
+ var e = assertThrows (IllegalArgumentException .class , () -> dm .random (dt , Shape .of (10 , 50 ), random ).svd ());
93
93
assertEquals ("This SVD implementation only works for m >= n" , e .getMessage ());
94
94
}
95
95
96
- <N extends Number > void testConditionNumber (DArrayManager tm , DType <N > dt ) {
96
+ <N extends Number > void testConditionNumber (DArrayManager dm , DType <N > dt ) {
97
97
98
98
// for random matrices we expect a low condition number
99
99
100
100
for (int i = 0 ; i < ROUNDS ; i ++) {
101
- var svd = tm .random (dt , Shape .of (10 , 10 ), random ).svd ();
101
+ var svd = dm .random (dt , Shape .of (10 , 10 ), random ).svd ();
102
102
double c = svd .conditionNumber ();
103
- assertTrue (Math .log10 (c ) < 4 );
103
+ assertTrue (Math .log10 (c ) < 7 );
104
104
assertEquals (1 / c , svd .inverseConditionNumber (), 1e-12 );
105
105
}
106
106
@@ -109,7 +109,7 @@ <N extends Number> void testConditionNumber(DArrayManager tm, DType<N> dt) {
109
109
Normal norm = Normal .of (0 , 0.000001 );
110
110
111
111
for (int i = 0 ; i < ROUNDS ; i ++) {
112
- var a = tm .random (dt , Shape .of (10 , 10 ), random );
112
+ var a = dm .random (dt , Shape .of (10 , 10 ), random );
113
113
114
114
// we create the first column as a slightly modified
115
115
// version of the second column, thus we have linearity
0 commit comments