# NAG Library Function Document

## 1Purpose

nag_dtpmv (f16phc) performs matrix-vector multiplication for a real triangular matrix stored in packed form.

## 2Specification

 #include #include
 void nag_dtpmv (Nag_OrderType order, Nag_UploType uplo, Nag_TransType trans, Nag_DiagType diag, Integer n, double alpha, const double ap[], double x[], Integer incx, NagError *fail)

## 3Description

nag_dtpmv (f16phc) performs one of the matrix-vector operations
 $x←αAx or x←αATx ,$
where $A$ is an $n$ by $n$ real triangular matrix, stored in packed form, $x$ is an $n$-element real vector and $\alpha$ is a real scalar.

## 4References

Basic Linear Algebra Subprograms Technical (BLAST) Forum (2001) Basic Linear Algebra Subprograms Technical (BLAST) Forum Standard University of Tennessee, Knoxville, Tennessee http://www.netlib.org/blas/blast-forum/blas-report.pdf

## 5Arguments

1:    $\mathbf{order}$Nag_OrderTypeInput
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by ${\mathbf{order}}=\mathrm{Nag_RowMajor}$. See Section 3.3.1.3 in How to Use the NAG Library and its Documentation for a more detailed explanation of the use of this argument.
Constraint: ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ or $\mathrm{Nag_ColMajor}$.
2:    $\mathbf{uplo}$Nag_UploTypeInput
On entry: specifies whether $A$ is upper or lower triangular.
${\mathbf{uplo}}=\mathrm{Nag_Upper}$
$A$ is upper triangular.
${\mathbf{uplo}}=\mathrm{Nag_Lower}$
$A$ is lower triangular.
Constraint: ${\mathbf{uplo}}=\mathrm{Nag_Upper}$ or $\mathrm{Nag_Lower}$.
3:    $\mathbf{trans}$Nag_TransTypeInput
On entry: specifies the operation to be performed.
${\mathbf{trans}}=\mathrm{Nag_NoTrans}$
$x←\alpha Ax$.
${\mathbf{trans}}=\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$
$x←\alpha {A}^{\mathrm{T}}x$.
Constraint: ${\mathbf{trans}}=\mathrm{Nag_NoTrans}$, $\mathrm{Nag_Trans}$ or $\mathrm{Nag_ConjTrans}$.
4:    $\mathbf{diag}$Nag_DiagTypeInput
On entry: specifies whether $A$ has nonunit or unit diagonal elements.
${\mathbf{diag}}=\mathrm{Nag_NonUnitDiag}$
The diagonal elements are stored explicitly.
${\mathbf{diag}}=\mathrm{Nag_UnitDiag}$
The diagonal elements are assumed to be $1$ and are not referenced.
Constraint: ${\mathbf{diag}}=\mathrm{Nag_NonUnitDiag}$ or $\mathrm{Nag_UnitDiag}$.
5:    $\mathbf{n}$IntegerInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
6:    $\mathbf{alpha}$doubleInput
On entry: the scalar $\alpha$.
7:    $\mathbf{ap}\left[\mathit{dim}\right]$const doubleInput
Note: the dimension, dim, of the array ap must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}×\left({\mathbf{n}}+1\right)/2\right)$.
On entry: the $n$ by $n$ triangular matrix $A$, packed by rows or columns.
The storage of elements ${A}_{ij}$ depends on the order and uplo arguments as follows:
• if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(j-1\right)×j/2+i-1\right]$, for $i\le j$;
• if ${\mathbf{order}}=\mathrm{Nag_ColMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-j\right)×\left(j-1\right)/2+i-1\right]$, for $i\ge j$;
• if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Upper}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(2n-i\right)×\left(i-1\right)/2+j-1\right]$, for $i\le j$;
• if ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ and ${\mathbf{uplo}}=\mathrm{Nag_Lower}$,
${A}_{ij}$ is stored in ${\mathbf{ap}}\left[\left(i-1\right)×i/2+j-1\right]$, for $i\ge j$.
8:    $\mathbf{x}\left[\mathit{dim}\right]$doubleInput/Output
Note: the dimension, dim, of the array x must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,1+\left({\mathbf{n}}-1\right)\left|{\mathbf{incx}}\right|\right)$.
On entry: the right-hand side vector $b$.
On exit: the solution vector $x$.
9:    $\mathbf{incx}$IntegerInput
On entry: the increment in the subscripts of x between successive elements of $x$.
Constraint: ${\mathbf{incx}}\ne 0$.
10:  $\mathbf{fail}$NagError *Input/Output
The NAG error argument (see Section 3.7 in How to Use the NAG Library and its Documentation).

## 6Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 2.3.1.2 in How to Use the NAG Library and its Documentation for further information.
On entry, argument $〈\mathit{\text{value}}〉$ had an illegal value.
NE_INT
On entry, ${\mathbf{incx}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{incx}}\ne 0$.
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 0$.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 2.7.5 in How to Use the NAG Library and its Documentation for further information.

## 7Accuracy

The BLAS standard requires accurate implementations which avoid unnecessary over/underflow (see Section 2.7 of Basic Linear Algebra Subprograms Technical (BLAST) Forum (2001)).

## 8Parallelism and Performance

nag_dtpmv (f16phc) is not threaded in any implementation.

None.

## 10Example

This example computes the matrix-vector product
 $y=αAx$
where
 $A = 1.0 0.0 0.0 0.0 2.0 2.0 0.0 0.0 3.0 3.0 3.0 0.0 4.0 4.0 4.0 4.0 ,$
 $x = 1.0 -2.0 3.0 -1.0$
and
 $α=1.5 .$

### 10.1Program Text

Program Text (f16phce.c)

### 10.2Program Data

Program Data (f16phce.d)

### 10.3Program Results

Program Results (f16phce.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017