Computes a rank-1 update of a general matrix.
void ger(queue &exec_queue, std::int64_t m, std::int64_t n, T alpha, buffer<T,1> &x, std::int64_t incx, buffer<T,1> &y, std::int64_t incy, buffer<T,1> &a, std::int64_t lda);
ger supports the following precisions and devices.
T | Devices Supported |
---|---|
float | Host, CPU, and GPU |
double | Host, CPU, and GPU |
The ger routines compute a scalar-vector-vector product and add the result to a general matrix. The operation is defined as
A <- alpha*x*yT + A
where:
alpha is scalar,
A is an m-by-n matrix,
x is a vector length m,
y is a vector length n.
The queue where the routine should be executed.
Number of rows of A. Must be at least zero.
Number of columns of A. Must be at least zero.
Scaling factor for the matrix-vector product.
Buffer holding input vector x. The buffer must be of size at least (1 + (m - 1)*abs(incx)). See Matrix and Vector Storage for more details.
Stride of vector x.
Buffer holding input/output vector y. The buffer must be of size at least (1 + (n - 1)*abs(incy)). See Matrix and Vector Storage for more details.
Stride of vector y.
The array holding input matrix A must have size at least lda*n if column major layout is used, or at least lda*m if row major layout is used.
Leading dimension of matrix A. It must be positive and at least m if column major layout is used or at least n if row major layout is used.
Buffer holding the updated matrix A.