C语言GMRES算法,线性方程组迭代算法 fgmres+ilut预调件子

//

// Solve sparse equation using GMRES iterative

method.

// Coefficient matrix with CSR format

//

// Currently fgmres/ilut supported in MKL only in

sequential mode.

//

// 2013-May-1

//

template

bool EquationSparse::solv_MKL_gmres(double

relativeErr){

MKL_INT ia[5] = { 1, 4, 7, 10, 13 }, ibilut[5];

MKL_INT ja[12] = { 1, 2, 3, 1, 2, 4, 1, 3, 4, 2, 3,

4 }, jbilut[16];

double A[12] = { 4., -1., -1., -1., 4., -1., -1.,

4., -1., -1., -1., 4. };

MKL_INT ipar[size];

double dpar[size], tmp[N * (2 * N + 1) + (N * (N +

9)) / 2 + 1];

double trvec[N], bilut[12];

double expected_solution[N] = { 1.0, 1.0, 1.0, 1.0

};

double rhs[N], b[N];

double computed_solution[N];

double residual[N];

M