(Taking the title of the question literally...)
Yes it can be done with BLAS alone (though it is probably not the most efficient way.)
The trick is to treat one of the input vectors as a diagonal matrix:
?a ? ?x? ?ax?
? b ? ?y? = ?by?
? c? ?z? ?cz?
You can then use one of the matrix-vector multiply functions that can take a diagonal matrix as input without padding, e.g. SBMV
Example:
void ebeMultiply(const int n, const double *a, const double *x, double *y)
{
extern void dsbmv_(const char *uplo,
const int *n,
const int *k,
const double *alpha,
const double *a,
const int *lda,
const double *x,
const int *incx,
const double *beta,
double *y,
const int *incy);
static const int k = 0; // Just the diagonal; 0 super-diagonal bands
static const double alpha = 1.0;
static const int lda = 1;
static const int incx = 1;
static const double beta = 0.0;
static const int incy = 1;
dsbmv_("L", &n, &k, &alpha, a, &lda, x, &incx, &beta, y, &incy);
}
// Test
#define N 3
static const double a[N] = {1,3,5};
static const double b[N] = {1,10,100};
static double c[N];
int main(int argc, char **argv)
{
ebeMultiply(N, a, b, c);
printf("Result: [%f %f %f]
", c[0], c[1], c[2]);
return 0;
}
Result: [1.000000 30.000000 500.000000]
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…