forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLUDecompositionTest.java
More file actions
40 lines (32 loc) · 1.11 KB
/
LUDecompositionTest.java
File metadata and controls
40 lines (32 loc) · 1.11 KB
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
package com.thealgorithms.matrix;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import org.junit.jupiter.api.Test;
public class LUDecompositionTest {
@Test
public void testLUDecomposition() {
double[][] a = {{4, 3}, {6, 3}};
// Perform LU decomposition
LUDecomposition.LU lu = LUDecomposition.decompose(a);
double[][] l = lu.l;
double[][] u = lu.u;
// Reconstruct a from l and u
double[][] reconstructed = multiplyMatrices(l, u);
// Assert that reconstructed matrix matches original a
for (int i = 0; i < a.length; i++) {
assertArrayEquals(a[i], reconstructed[i], 1e-9);
}
}
// Helper method to multiply two matrices
private double[][] multiplyMatrices(double[][] a, double[][] b) {
int n = a.length;
double[][] c = new double[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
c[i][j] += a[i][k] * b[k][j];
}
}
}
return c;
}
}