dcoomml.c
来自「用于求解大型稀疏线性方程组Ax=b的数值计算库.」· C语言 代码 · 共 562 行 · 第 1/2 页
C
562 行
/*-------------------------------------------------------|| 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:27:59 EDT 1996 */#include "dcoomml.h"void COO_MatMult_CAB_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i,j; double *pc=c; int l; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) c[indx[j]] += b[jndx[j]] * val[j]; c += ldc; b += ldb; } }void COOsymm_MatMult_CAB_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) { rowi = indx[j]; coli = jndx[j]; if ( rowi == coli ) c[rowi] += b[coli] * val[j]; else { c[rowi] += b[coli] * val[j]; c[coli] += b[rowi] * val[j]; } } c += ldc; b += ldb; } }void COOskew_MatMult_CAB_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) { rowi = indx[j]; coli = jndx[j]; if ( rowi != coli ) { c[rowi] += b[coli] * val[j]; c[coli] -= b[rowi] * val[j]; } } c += ldc; b += ldb; } }void COO_MatMult_CaAB_double( const int m, const int n, const int k, const double alpha, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i,j; double *pc=c; int l; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) c[indx[j]] += alpha * b[jndx[j]] * val[j]; c += ldc; b += ldb; } }void COOsymm_MatMult_CaAB_double( const int m, const int n, const int k, const double alpha, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) { rowi = indx[j]; coli = jndx[j]; if ( rowi == coli ) c[rowi] += alpha * b[coli] * val[j]; else { c[rowi] += alpha * b[coli] * val[j]; c[coli] += alpha * b[rowi] * val[j]; } } c += ldc; b += ldb; } }void COOskew_MatMult_CaAB_double( const int m, const int n, const int k, const double alpha, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) for (i=0;i!=m;i++) *pc++ = 0; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) { rowi = indx[j]; coli = jndx[j]; if ( rowi != coli ) { c[rowi] += alpha * b[coli] * val[j]; c[coli] -= alpha * b[rowi] * val[j]; } } c += ldc; b += ldb; } }void COO_MatMult_CABC_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ int i,j; double *pc=c; int l; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) c[indx[j]] += b[jndx[j]] * val[j]; c += ldc; b += ldb; } }void COOsymm_MatMult_CABC_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) { rowi = indx[j]; coli = jndx[j]; if ( rowi == coli ) c[rowi] += b[coli] * val[j]; else { c[rowi] += b[coli] * val[j]; c[coli] += b[rowi] * val[j]; } } c += ldc; b += ldb; } }void COOskew_MatMult_CABC_double( const int m, const int n, const int k, const double *val, const int *indx, const int *jndx, const int nnz, const double *b, const int ldb, double *c, const int ldc, const int ind_base){ double *pc=c; int l; int i,j; int rowi,coli; c-=ind_base; b-=ind_base; for (l=0;l!=n;l++) { for (j=0;j!=nnz;j++) {
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?