///////////////////////////////////////////////////////////////
// Zadanie 6												 //
// Autor: Wojciech Kopeć				     				 //
///////////////////////////////////////////////////////////////

#include <iostream>
#include <math.h>
#include <tnt/jama_svd.h>

using namespace std;
using namespace JAMA;
using namespace TNT;
const int size=5;		//wieklosc macierzy
const int p=8;			//dokladnosc wynikow

int main()
{
	Array2D<double> matrix[5][5]={{-116.66654, 583.33346, -333.33308, 100.00012, 100.00012},
						{583.33346, -116.66654, -333.33308, 100.00012, 100.00012},
						{-333.33308, -333.33308, 133.33383, 200.00025, 200.00025},
						{100.00012, 100.00012, 200.00025, 50.000125, -649.99988,},
						{100.00012, 100.00012, 200.00025, -649.99988, 50.000125}};
	Array2D<double> b1[5]={-0.33388066, 1.08033290, -0.98559856, 1.31947922, -0.09473435};
	Array2D<double> b2[5]={-0.33388066, 1.08033290, -0.98559855, 1.32655028, -0.10180541};
	Array2D<double> b3[5]={0.72677951, 0.72677951, -0.27849178, 0.96592583, 0.96592583};
	Array2D<double> b4[5]={0.73031505, 0.73031505, -0.27142071, 0.96946136, 0.96946136};
	Array2D<double> z1[5], z2[5], z3[5], z4[5], b1_b2[5], b3_b4[5], z1_z2[5], z3_z4[5]={0, 0, 0, 0, 0};
	Array2D<double> L;
	Array2D<double> U;
	Array1D<double> X;

	LU<double> lu(A);

	L = lu.getL();
	U = lu.getU();

	cout.precision(p);
	z1=lu.solve(b1);

	return 0;
}