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

📄 dcsrvtsl.c

📁 用于求解大型稀疏线性方程组Ax=b的数值计算库.
💻 C
📖 第 1 页 / 共 5 页
字号:
/*-------------------------------------------------------||  NIST SPARSE BLAS v. 0.9 (Sat Jul 6 14:27:21 EDT 1996) ||                                                        ||  Authors:                                              ||     Karin A. Remington and Roldan Pozo                 ||     National Institute of Standards and Technology     ||                                                        ||  Based on the interface standard proposed in:          | |   "A Revised Proposal for a Sparse BLAS Toolkit" by    ||    S. Carney and K. Wu -- University of Minnesota      ||    M. Heroux and G. Li -- Cray Research                |  |    R. Pozo and K.A. Remington -- NIST                  ||                                                        ||  Contact:                                              ||     Karin A. Remington, email: kremington@nist.gov     |--------------------------------------------------------*//* Created:  Sat Jul 6 14:28:33 EDT 1996 */#include "dcsrvtsl.h"void CSR_VecTriangSlvLD_CAB_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double z;   double valtmp;  val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        index = indx[j];        if ( index == i+ind_base ) {          valtmp = val[j];        } else {          z += c[index] * val[j];        }      }      pc[i] = (b[i] - z) / valtmp;    }}void CSR_VecTriangSlvLU_CAB_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je;  double *pc=c;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }}void CSR_VecTriangSlvUD_CAB_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double valtmp;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1; i--) {      z = 0;      jb = pntrb[i];      je =  pntre[i];      for (j=jb+1; j<je; j++) {        z += c[indx[j]] * val[j];      }      pc[i] = (b[i] - z) / val[jb];    }}void CSR_VecTriangSlvUU_CAB_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je;  double *pc=c;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1;i--) {      z = 0;      jb =  pntrb[i];      je =  pntre[i];      for (j=jb; j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }}void CSR_VecTriangSlvLD_CaAB_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double z;   double valtmp;  val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        index = indx[j];        if ( index == i+ind_base ) {          valtmp = val[j];        } else {          z += c[index] * val[j];        }      }      pc[i] = (b[i] - z) / valtmp;    }    for (i=0;i!=m;i++) {                          *pc *= alpha ;                    pc++;                                 }                                     }void CSR_VecTriangSlvLU_CaAB_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je;  double *pc=c;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }    for (i=0;i!=m;i++) {                          *pc *= alpha ;                    pc++;                                 }                                     }void CSR_VecTriangSlvUD_CaAB_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double valtmp;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1; i--) {      z = 0;      jb = pntrb[i];      je =  pntre[i];      for (j=jb+1; j<je; j++) {        z += c[indx[j]] * val[j];      }      pc[i] = (b[i] - z) / val[jb];    }    for (i=0;i!=m;i++) {                          *pc *= alpha ;                    pc++;                                 }                                     }void CSR_VecTriangSlvUU_CaAB_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,   const int ind_base){  int i, j, jb, je;  double *pc=c;  double z;   val-=ind_base;  indx-=ind_base;  c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1;i--) {      z = 0;      jb =  pntrb[i];      je =  pntre[i];      for (j=jb; j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }    for (i=0;i!=m;i++) {                          *pc *= alpha ;                    pc++;                                 }                                     }void CSR_VecTriangSlvLD_CABC_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double *pwork=work;                               double z;   double valtmp;  val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);   pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        index = indx[j];        if ( index == i+ind_base ) {          valtmp = val[j];        } else {          z += c[index] * val[j];        }      }      pc[i] = (b[i] - z) / valtmp;    }    for (i=0;i!=m;i++) {                          *pc += *pwork;                            pwork++;                                  pc++;                                 }                                     }void CSR_VecTriangSlvLU_CABC_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je;  double *pc=c;  double *pwork=work;                                  double z;   val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);      pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }    for (i=0;i!=m;i++) {                          *pc += *pwork;                            pwork++;                                  pc++;                                 }                                     }void CSR_VecTriangSlvUD_CABC_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double *pwork=work;                                  double valtmp;  double z;   val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);      pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1; i--) {      z = 0;      jb = pntrb[i];      je =  pntre[i];      for (j=jb+1; j<je; j++) {        z += c[indx[j]] * val[j];      }      pc[i] = (b[i] - z) / val[jb];    }    for (i=0;i!=m;i++) {                          *pc += *pwork;                            pwork++;                                  pc++;                                 }                                     }void CSR_VecTriangSlvUU_CABC_double(                 const int m,                      const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je;  double *pc=c;  double *pwork=work;                                  double z;   val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);      pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=m-1;i!=-1;i--) {      z = 0;      jb =  pntrb[i];      je =  pntre[i];      for (j=jb; j<je;j++) {        z += c[indx[j]] * val[j];      }      pc[i] = b[i] - z;    }    for (i=0;i!=m;i++) {                          *pc += *pwork;                            pwork++;                                  pc++;                                 }                                     }void CSR_VecTriangSlvLD_CaABC_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je, index;  double *pc=c;  double *pwork=work;                               double z;   double valtmp;  val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);   pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];      je = pntre[i];      for (j=jb;j<je;j++) {        index = indx[j];        if ( index == i+ind_base ) {          valtmp = val[j];        } else {          z += c[index] * val[j];        }      }      pc[i] = (b[i] - z) / valtmp;    }    for (i=0;i!=m;i++) {                          *pc *= alpha ;                    *pc += *pwork;                            pwork++;                                  pc++;                                 }                                     }void CSR_VecTriangSlvLU_CaABC_double(                 const int m,                     const double alpha, const double *val,                  const int *indx, const int *pntrb, const int *pntre,                  const double *b,                    double *c,  double *work, const int ind_base){  int i, j, jb, je;  double *pc=c;  double *pwork=work;                                  double z;   val-=ind_base;  indx-=ind_base;    for (i=0;i!=m;i++) *pwork++ =  (*pc++);      pwork=work;                                          c-=ind_base;    pc=c+ind_base;    for (i=0;i!=m;i++) {      z = 0;      jb = pntrb[i];

⌨️ 快捷键说明

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