z_csc_ilu z_csc_ilu0 z_csc_ilu_solve z_csc_ssor_solve z_csr_ilu z_csr_ilu0 z_csr_ilu_solve z_csr_ssor_solve z_csx_ds z_csx_ds_solve z_csx_ssor z_ssc_ssor_solve z_ssr_ssor_solve

z_csr_ilu_solve() void z_csr_ilu_solve ( char  trans, int  n, const doublecomplex  val[], const int  rowptr[], const int  colind[], int  base, const doublecomplex  d[], const doublecomplex  b[], doublecomplex  x[], int *  info  ) Incomplete LU decomposition preconditioner (ILU) (Complex matrices) (CSR) Purpose This routine is the incomplete LU decomposition preconditioner (ILU) for the sparse linear equations. It solves the equation M*x = b, M^T*x = b or M^H*x = b, where M is the preconditioner matrix. Parameters [in] trans = 'N': solve M*x = b. = 'T': solve M^T*x = b. = 'C': solve M^H*x = b. [in] n Dimension of preconditioner matrix. (n >= 0) (If n = 0, returns without computation) [in] val[] Array val[lval] (lval >= nnz) (nnz is number of non-zero elements) Values of non-zero elements of preconditioner matrix (lower triangular matrix L and upper triangular matrix U). [in] rowptr[] Array rowptr[lrowptr] (lrowptr >= n + 1) Row pointers of preconditioner matrix. [in] colind[] Array colind[lcolind] (lcolind >= nnz) Column indices of preconditioner matrix. [in] base Indexing of rowptr[] and colind[]. = 0: Zero-based (C style) indexing: Starting index is 0. = 1: One-based (Fortran style) indexing: Starting index is 1. [in] d[] Array d[ld] (ld >= n) The diagonal elements of upper triangular matrix U. [in] b[] Array b[lb] (lb >= n) Right hand side vector b. [out] x[] Array x[lx] (lx >= n) Solution vector x. [out] info = 0: Successful exit. = i < 0: The (-i)-th argument is invalid.