NAG FL Interfacef06paf (dgemv)

▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

1Purpose

f06paf computes the matrix-vector product for a real general matrix or its transpose.

2Specification

Fortran Interface
 Subroutine f06paf ( m, n, a, lda, x, incx, beta, y, incy)
 Integer, Intent (In) :: m, n, lda, incx, incy Real (Kind=nag_wp), Intent (In) :: alpha, a(lda,*), x(*), beta Real (Kind=nag_wp), Intent (Inout) :: y(*) Character (1), Intent (In) :: trans
#include <nag.h>
 void f06paf_ (const char *trans, const Integer *m, const Integer *n, const double *alpha, const double a[], const Integer *lda, const double x[], const Integer *incx, const double *beta, double y[], const Integer *incy, const Charlen length_trans)
The routine may be called by the names f06paf, nagf_blas_dgemv or its BLAS name dgemv.

3Description

f06paf performs one of the matrix-vector operations
 $y←αAx + βy , or y←αATx + βy ,$
where $A$ is an $m×n$ real matrix, $x$ and $y$ are real vectors, and $\alpha$ and $\beta$ are real scalars.
If $m=0$ or $n=0$, no operation is performed.

None.

5Arguments

1: $\mathbf{trans}$Character(1) Input
On entry: specifies the operation to be performed.
${\mathbf{trans}}=\text{'N'}$
$y←\alpha Ax+\beta y$.
${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$
$y←\alpha {A}^{\mathrm{T}}x+\beta y$.
Constraint: ${\mathbf{trans}}=\text{'N'}$, $\text{'T'}$ or $\text{'C'}$.
2: $\mathbf{m}$Integer Input
On entry: $m$, the number of rows of the matrix $A$.
Constraint: ${\mathbf{m}}\ge 0$.
3: $\mathbf{n}$Integer Input
On entry: $n$, the number of columns of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
4: $\mathbf{alpha}$Real (Kind=nag_wp) Input
On entry: the scalar $\alpha$.
5: $\mathbf{a}\left({\mathbf{lda}},*\right)$Real (Kind=nag_wp) array Input
Note: the second dimension of the array a must be at least ${\mathbf{n}}$.
On entry: the $m×n$ matrix $A$.
6: $\mathbf{lda}$Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f06paf is called.
Constraint: ${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{m}}\right)$.
7: $\mathbf{x}\left(*\right)$Real (Kind=nag_wp) array Input
Note: the dimension of the array x must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{n}}-1\right)×|{\mathbf{incx}}|\right)$ if ${\mathbf{trans}}=\text{'N'}$ and at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{m}}-1\right)×|{\mathbf{incx}}|\right)$ if ${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$.
On entry: the vector $x$.
If ${\mathbf{trans}}=\text{'N'}$,
• if ${\mathbf{incx}}>0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{x}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{incx}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$;
• if ${\mathbf{incx}}<0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{x}}\left(1-\left({\mathbf{n}}-\mathit{i}\right)×{\mathbf{incx}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
If ${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$,
• if ${\mathbf{incx}}>0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{x}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{incx}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{m}}$;
• if ${\mathbf{incx}}<0$, ${x}_{\mathit{i}}$ must be stored in ${\mathbf{x}}\left(1-\left({\mathbf{m}}-\mathit{i}\right)×{\mathbf{incx}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{m}}$.
8: $\mathbf{incx}$Integer Input
On entry: the increment in the subscripts of x between successive elements of $x$.
Constraint: ${\mathbf{incx}}\ne 0$.
9: $\mathbf{beta}$Real (Kind=nag_wp) Input
On entry: the scalar $\beta$.
10: $\mathbf{y}\left(*\right)$Real (Kind=nag_wp) array Input/Output
Note: the dimension of the array y must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{m}}-1\right)×|{\mathbf{incy}}|\right)$ if ${\mathbf{trans}}=\text{'N'}$ and at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{n}}-1\right)×|{\mathbf{incy}}|\right)$ if ${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$.
On entry: the vector $y$, if ${\mathbf{beta}}=0.0$, y need not be set.
If ${\mathbf{trans}}=\text{'N'}$,
• if ${\mathbf{incy}}>0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{y}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{incy}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{m}}$;
• if ${\mathbf{incy}}<0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{y}}\left(1-\left({\mathbf{m}}-\mathit{i}\right)×{\mathbf{incy}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{m}}$.
If ${\mathbf{trans}}=\text{'T'}$ or $\text{'C'}$,
• if ${\mathbf{incy}}>0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{y}}\left(1+\left(\mathit{i}-1\right)×{\mathbf{incy}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$;
• if ${\mathbf{incy}}<0$, ${y}_{\mathit{i}}$ must be stored in ${\mathbf{y}}\left(1-\left({\mathbf{n}}-\mathit{i}\right)×{\mathbf{incy}}\right)$, for $\mathit{i}=1,2,\dots ,{\mathbf{n}}$.
On exit: the updated vector $y$ stored in the array elements used to supply the original vector $y$.
11: $\mathbf{incy}$Integer Input
On entry: the increment in the subscripts of y between successive elements of $y$.
Constraint: ${\mathbf{incy}}\ne 0$.

None.

Not applicable.