private static void testDecompositionQR(double[][] in, double[][] out) {
Matrix mat = new Matrix(in.length, in[0].length - 1);
for (int i = 0; i < in.length; i++) {
for (int j = 0; j < in[i].length - 1; j++) {
mat.set(i, j, in[i][j]);
}
}
Matrix b = new Matrix(in.length, 1);
for (int i = 0; i < in.length; i++) {
b.set(i, 0, in[i][in.length]);
}
System.out.println("Initial matrix");
mat.print();
System.out.println("Initial vector");
b.print();
QRDecomposition matQR = new QRDecomposition(mat);
Matrix matSolved = matQR.solve(b);
for (int i = 0; i < out.length; i++) {
Assert.assertTrue(MathTools.isEquals(out[i][out.length], matSolved.get(i, 0)));
}
System.out.println("Solution matrix");
matSolved.print();
}
private static void testReduceMatrix(double[][] in, double[][] out) {
Matrix mat = new Matrix(in.length, in[0].length);
for (int i = 0; i < out.length; i++) {
for (int j = 0; j < out[i].length; j++) {
mat.set(i, j, in[i][j]);
}
}
System.out.println("Initial matrix");
mat.print();
mat.reducedRowEchelonForm();
for (int i = 0; i < out.length; i++) {
for (int j = 0; j < out[i].length; j++) {
Assert.assertTrue(MathTools.isEquals(out[i][j], mat.get(i, j)));
}
}
System.out.println("Solution matrix");
mat.print();
System.out.println(mat.showResult());
}
