/// Program to Perform Cholesky Decomposition on a Square Positive Complex Hermitian Matrix #include #include #include #include #include #include #include #include #include using namespace std; int signum(double x) { return (0 size_t len(M type) { stringstream ss; ss< Root() { double a=Modulus(); Complex x1, x2; x1.real=sqrt((a+real)/2); x1.imag=signum(imag)* sqrt((-real+a)/2); x2.real=-(sqrt((a+real)/2)); x2.imag=-(signum(imag)* sqrt((-real+a)/2)); return make_pair(x1,x2); } friend ostream& operator<< (ostream& os, Complex c) { stringstream ss; ss.precision(3); if(c.real!=0||c.imag==0) ss<0?(c.real==0?"":"+"):"-") < class Matrix { size_t r,c; vector> mat; public: Matrix(unsigned short row=1, unsigned short col=1):r(row),c(col) { vector temp; temp.assign(c,0); for (int i = 0; i < r; ++i) { mat.push_back(temp); } } Matrix(initializer_list< initializer_list> lst) { r = lst.size()?lst.size():1; c = lst.begin()->size()?lst. begin()->size():1; mat.assign(lst.begin(),lst.end()); } void Reset(int rr, int cc) { mat.clear(); mat.resize(rr); for(int i=0;iReset(kk.c,kk.r); for (int i=0; imax) max=len(mat.at(i).at(j)); return max; } friend ostream& operator<< (ostream& os,Matrix matrix) { size_t d = matrix.Max_Len(); for (int i = 0; i CTranspose(); pair,Matrix> Cholesky_Decomposition(); }; template<> void Matrix::Conjugate() { for(int i=0;i Matrix Matrix::CTranspose() { Matrix res(c,r); res|(*this); res.Conjugate(); return res; } template<> pair,Matrix> Matrix::Cholesky_Decomposition() { Matrix L1(r,c), L2(r,c); Complex sum = 0; for(int i=0;i M1 = {{{5,0} ,{2,3} ,{0,5} }, {{2,-3},{7,0} ,{1,7} }, {{0,-5},{1,-7},{12,0}}}; cout<

Cholesky Decomposition Function