📄 dcsrmtsl.c
字号:
/*-------------------------------------------------------|| 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 "dcsrmtsl.h"void CSR_MatTriangSlvLD_CAB_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je, index; double *pc=c; int l; double z; double valtmp; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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; } c += ldc; b += ldb; } }void CSR_MatTriangSlvLU_CAB_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je; double *pc=c; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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; } c += ldc; b += ldb; } }void CSR_MatTriangSlvUD_CAB_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je, index; double *pc=c; double valtmp; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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]; } c += ldc; b += ldb; } }void CSR_MatTriangSlvUU_CAB_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je; double *pc=c; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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; } c += ldc; b += ldb; } }void CSR_MatTriangSlvLD_CaAB_double( const int m, const int n, const double alpha, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je, index; double *pc=c; int l; double z; double valtmp; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvLU_CaAB_double( const int m, const int n, const double alpha, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je; double *pc=c; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvUD_CaAB_double( const int m, const int n, const double alpha, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je, index; double *pc=c; double valtmp; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvUU_CaAB_double( const int m, const int n, const double alpha, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i, j, jb, je; double *pc=c; int l; double z; val-=ind_base; indx-=ind_base; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvLD_CABC_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, double *work, const int ind_base){ int i, j, jb, je, index; double *pc=c; double *pwork=work; int l; double z; double valtmp; val-=ind_base; indx-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pwork++ = (*pc++); pwork=work; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvLU_CABC_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, double *work, const int ind_base){ int i, j, jb, je; double *pc=c; double *pwork=work; int l; double z; val-=ind_base; indx-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pwork++ = (*pc++); pwork=work; c-=ind_base; for (l=0;l!=n;l++) { 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++; } c += ldc; b += ldb; } }void CSR_MatTriangSlvUD_CABC_double( const int m, const int n, const double *val, const int *indx, const int *pntrb, const int *pntre, const double *b, const int ldb, double *c, const int ldc, double *work, const int ind_base){ int i, j, jb, je, index; double *pc=c; double *pwork=work; double valtmp; int l; double z; val-=ind_base; indx-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pwork++ = (*pc++); pwork=work; c-=ind_base; for (l=0;l!=n;l++) { 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;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -