⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 dcsrvml.c

📁 用于求解大型稀疏线性方程组Ax=b的数值计算库.
💻 C
📖 第 1 页 / 共 2 页
字号:
        }        c-=ind_base;        c[index] -=  b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] +=  b[index] * (*pval++);        b+=ind_base;      }    }}void CSR_VecMult_CaABC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,                   double *c,                   const int ind_base){  double t;  const double *pval;  int i,j,jb,je;  b-=ind_base;  indx-=ind_base;    pval = val;    for (i=0;i!=m;i++) {      t = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j!=je;j++)        t += alpha * b[indx[j]] * (*pval++);      c[i] += t;    }}void CSRsymm_VecMult_CaABC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,                   double *c,                   const int ind_base){  const double *pval;  int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;          pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          c[j] += alpha * b[j] * (*pval++);          continue;        }        c-=ind_base;        c[index] += alpha * b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] += alpha * b[index] * (*pval++);        b+=ind_base;      }    }}void CSRskew_VecMult_CaABC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,                   double *c,                   const int ind_base){  const double *pval;  int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;            pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          *pval++;          continue;        }        c-=ind_base;        c[index] -= alpha * b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] += alpha * b[index] * (*pval++);        b+=ind_base;      }    }}void CSR_VecMult_CABbC_double(                 const int m,  const int k,                  const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  double t;  const double *pval;  double *pc=c;                                         int i,j,jb,je;  b-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pc++ *= beta;                     pval = val;    for (i=0;i!=m;i++) {      t = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j!=je;j++)        t +=  b[indx[j]] * (*pval++);      c[i] += t;    }}void CSRsymm_VecMult_CABbC_double(                 const int m,  const int k,                  const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  const double *pval;  double *pc=c;                                         int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;          for (i=0;i!=m;i++) *pc++ *= beta;                     pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          c[j] +=  b[j] * (*pval++);          continue;        }        c-=ind_base;        c[index] +=  b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] +=  b[index] * (*pval++);        b+=ind_base;      }    }}void CSRskew_VecMult_CABbC_double(                 const int m,  const int k,                  const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  const double *pval;  double *pc=c;                                         int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;          for (i=0;i!=m;i++) *pc++ *= beta;                       pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          *pval++;          continue;        }        c-=ind_base;        c[index] -=  b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] +=  b[index] * (*pval++);        b+=ind_base;      }    }}void CSR_VecMult_CaABbC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  double t;  const double *pval;  double *pc=c;                                         int i,j,jb,je;  b-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pc++ *= beta;                     pval = val;    for (i=0;i!=m;i++) {      t = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j!=je;j++)        t += alpha * b[indx[j]] * (*pval++);      c[i] += t;    }}void CSRsymm_VecMult_CaABbC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  const double *pval;  double *pc=c;                                         int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;          for (i=0;i!=m;i++) *pc++ *= beta;                     pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          c[j] += alpha * b[j] * (*pval++);          continue;        }        c-=ind_base;        c[index] += alpha * b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] += alpha * b[index] * (*pval++);        b+=ind_base;      }    }}void CSRskew_VecMult_CaABbC_double(                 const int m,  const int k, const double alpha,                 const double *val, const int *indx,                  const int *pntrb, const int *pntre,                  const double *b,  const double beta,                 double *c,                   const int ind_base){  const double *pval;  double *pc=c;                                         int i,j;  int jj;  int rpntrb, rpntre;  int index, nvals;  indx-=ind_base;          for (i=0;i!=m;i++) *pc++ *= beta;                       pval = val;    for (j=0;j!=k;j++){      rpntrb = pntrb[j];      rpntre = pntre[j];      for (jj=rpntrb;jj!=rpntre;jj++) {        index = indx[jj];        if ( index == j+ind_base ) {          *pval++;          continue;        }        c-=ind_base;        c[index] -= alpha * b[j] * (*pval);        c+=ind_base;        b-=ind_base;        c[j] += alpha * b[index] * (*pval++);        b+=ind_base;      }    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -