dgefmm_mem.c

C++编写的高性能矩阵乘法的Stranssen算法

/*============================================================================
Fast matrix multiply.  This routine has a Fortran style interface.  
All arrays are column oriented storage (Fortran style).
This routine calls the C routine fmm which does the work.

Inputs
  c_transa,c_transb : characters specifying form of A or B (transpose or not)
  p_m,p_n,p_k       : matrix dimensions
  p_alpha,p_beta    : scalars
  A                 : m x k matrix
  B                 : k x n matrix
  p_ldb,p_lda,p_ldc : matrix leading dimensions
  d_aux             : temporary work space
  p_i_naux          : amount of temporay work space in double precision words
Outputs
  C                 : m x n matrix, C = alpha*A*B+beta*C
============================================================================*/
#include "matrix.h"

void DGEFMM_MEM(char *c_transa, char *c_transb, int *p_m, int *p_n, int *p_k,
		double *p_alpha, double *a, int *p_lda, double *b, int *p_ldb,
		double *p_beta, double *c, int *p_ldc, double *d_aux, int *p_i_naux)
{

  /* call the C routine */

  fmm(*c_transa, *c_transb, *p_m, *p_n, *p_k, *p_alpha, a, *p_lda, b, *p_ldb,
      *p_beta, c, *p_ldc, d_aux, *p_i_naux);
}