1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
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
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
|
/*
* Copyright (c) 2009-2020, Peter Abeles. All Rights Reserved.
*
* This file is part of Efficient Java Matrix Library (EJML).
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.ejml.sparse.csc.decomposition;
import org.ejml.EjmlUnitTests;
import org.ejml.UtilEjml;
import org.ejml.data.DMatrixSparseCSC;
import org.ejml.interfaces.decomposition.DecompositionSparseInterface;
import org.junit.jupiter.api.Test;
import java.util.List;
import java.util.Random;
import static org.junit.jupiter.api.Assertions.*;
/**
* Generic tests for sparse decomposition interface
*
* @author Peter Abeles
*/
public abstract class GenericDecompositionTests_DSCC {
protected Random rand = new Random(0x45478);
protected boolean canLockStructure = true;
/**
* Create a matrix which can be decomposed.
*/
public abstract DMatrixSparseCSC createMatrix( int N );
/**
* Create a decomposition
*/
public abstract DecompositionSparseInterface<DMatrixSparseCSC> createDecomposition();
/**
* Decompose the matrix and store the results in a list
*/
public abstract List<DMatrixSparseCSC> decompose( DecompositionSparseInterface<DMatrixSparseCSC> d ,
DMatrixSparseCSC A );
@Test
public void ifCanNotLockThrowException() {
DecompositionSparseInterface<DMatrixSparseCSC> d = createDecomposition();
if( canLockStructure ) {
d.setStructureLocked(true);
} else {
try {
d.setStructureLocked(true);
fail("RuntimeException should have been thrown");
} catch (RuntimeException ignore) {
}
}
}
@Test
public void checkUnLockStructure() {
if( !canLockStructure )
return;
DecompositionSparseInterface<DMatrixSparseCSC> d = createDecomposition();
DMatrixSparseCSC A = createMatrix(10);
DMatrixSparseCSC B = createMatrix(10);
assertTrue(d.decompose(A));
List<DMatrixSparseCSC> sol1 = decompose(d,A);
assertTrue(d.decompose(B));
d.setStructureLocked(true);
assertTrue(d.decompose(B));
d.setStructureLocked(false);
assertTrue(d.decompose(A));
List<DMatrixSparseCSC> sol2 = decompose(d,A);
// if the structure wasn't recomputed then the solution should be different or an exception thrown
for (int i = 0; i < sol1.size(); i++) {
EjmlUnitTests.assertEquals(sol1.get(i),sol2.get(i), UtilEjml.TEST_F64);
}
}
@Test
public void lockingDoesNotChangeSolution() {
if( !canLockStructure )
return;
DecompositionSparseInterface<DMatrixSparseCSC> d = createDecomposition();
DMatrixSparseCSC A = createMatrix(10);
List<DMatrixSparseCSC> sol0 = decompose(d,(DMatrixSparseCSC)A.copy());
assertFalse(d.isStructureLocked());
d.setStructureLocked(true);
assertTrue(d.isStructureLocked());
List<DMatrixSparseCSC> sol1 = decompose(d,A);
assertEquals(sol0.size(),sol1.size());
for (int i = 0; i < sol0.size(); i++) {
EjmlUnitTests.assertEquals(sol0.get(i),sol1.get(i), UtilEjml.TEST_F64);
}
}
}
|
