F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF07UEF (DTPTRS)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F07UEF (DTPTRS) solves a real triangular system of linear equations with multiple right-hand sides, $AX=B$ or ${A}^{\mathrm{T}}X=B$, using packed storage.

## 2  Specification

 SUBROUTINE F07UEF ( UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO)
 INTEGER N, NRHS, LDB, INFO REAL (KIND=nag_wp) AP(*), B(LDB,*) CHARACTER(1) UPLO, TRANS, DIAG
The routine may be called by its LAPACK name dtptrs.

## 3  Description

F07UEF (DTPTRS) solves a real triangular system of linear equations $AX=B$ or ${A}^{\mathrm{T}}X=B$, using packed storage.

## 4  References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Higham N J (1989) The accuracy of solutions to triangular systems SIAM J. Numer. Anal. 26 1252–1265

## 5  Parameters

1:     UPLO – CHARACTER(1)Input
On entry: specifies whether $A$ is upper or lower triangular.
${\mathbf{UPLO}}=\text{'U'}$
$A$ is upper triangular.
${\mathbf{UPLO}}=\text{'L'}$
$A$ is lower triangular.
Constraint: ${\mathbf{UPLO}}=\text{'U'}$ or $\text{'L'}$.
2:     TRANS – CHARACTER(1)Input
On entry: indicates the form of the equations.
${\mathbf{TRANS}}=\text{'N'}$
The equations are of the form $AX=B$.
${\mathbf{TRANS}}=\text{'T'}$ or $\text{'C'}$
The equations are of the form ${A}^{\mathrm{T}}X=B$.
Constraint: ${\mathbf{TRANS}}=\text{'N'}$, $\text{'T'}$ or $\text{'C'}$.
3:     DIAG – CHARACTER(1)Input
On entry: indicates whether $A$ is a nonunit or unit triangular matrix.
${\mathbf{DIAG}}=\text{'N'}$
$A$ is a nonunit triangular matrix.
${\mathbf{DIAG}}=\text{'U'}$
$A$ is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be $1$.
Constraint: ${\mathbf{DIAG}}=\text{'N'}$ or $\text{'U'}$.
4:     N – INTEGERInput
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
5:     NRHS – INTEGERInput
On entry: $r$, the number of right-hand sides.
Constraint: ${\mathbf{NRHS}}\ge 0$.
6:     AP($*$) – REAL (KIND=nag_wp) arrayInput
Note: the dimension 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 columns.
More precisely,
• if ${\mathbf{UPLO}}=\text{'U'}$, the upper triangle of $A$ must be stored with element ${A}_{ij}$ in ${\mathbf{AP}}\left(i+j\left(j-1\right)/2\right)$ for $i\le j$;
• if ${\mathbf{UPLO}}=\text{'L'}$, the lower triangle of $A$ must be stored with element ${A}_{ij}$ in ${\mathbf{AP}}\left(i+\left(2n-j\right)\left(j-1\right)/2\right)$ for $i\ge j$.
If ${\mathbf{DIAG}}=\text{'U'}$, the diagonal elements of $A$ are assumed to be $1$, and are not referenced; the same storage scheme is used whether ${\mathbf{DIAG}}=\text{'N'}$ or ‘U’.
7:     B(LDB,$*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array B must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{NRHS}}\right)$.
On entry: the $n$ by $r$ right-hand side matrix $B$.
On exit: the $n$ by $r$ solution matrix $X$.
8:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F07UEF (DTPTRS) is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
9:     INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, the $i$th parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.
${\mathbf{INFO}}>0$
If ${\mathbf{INFO}}=i$, $a\left(i,i\right)$ is exactly zero; $A$ is singular and the solution has not been computed.

## 7  Accuracy

The solutions of triangular systems of equations are usually computed to high accuracy. See Higham (1989).
For each right-hand side vector $b$, the computed solution $x$ is the exact solution of a perturbed system of equations $\left(A+E\right)x=b$, where
 $E≤cnεA ,$
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision.
If $\stackrel{^}{x}$ is the true solution, then the computed solution $x$ satisfies a forward error bound of the form
 $x-x^∞ x∞ ≤ cncondA,xε , provided cncondA,xε<1 ,$
where $\mathrm{cond}\left(A,x\right)={‖\left|{A}^{-1}\right|\left|A\right|\left|x\right|‖}_{\infty }/{‖x‖}_{\infty }$.
Note that $\mathrm{cond}\left(A,x\right)\le \mathrm{cond}\left(A\right)={‖\left|{A}^{-1}\right|\left|A\right|‖}_{\infty }\le {\kappa }_{\infty }\left(A\right)$; $\mathrm{cond}\left(A,x\right)$ can be much smaller than $\mathrm{cond}\left(A\right)$ and it is also possible for $\mathrm{cond}\left({A}^{\mathrm{T}}\right)$ to be much larger (or smaller) than $\mathrm{cond}\left(A\right)$.
Forward and backward error bounds can be computed by calling F07UHF (DTPRFS), and an estimate for ${\kappa }_{\infty }\left(A\right)$ can be obtained by calling F07UGF (DTPCON) with ${\mathbf{NORM}}=\text{'I'}$.

The total number of floating point operations is approximately ${n}^{2}r$.
The complex analogue of this routine is F07USF (ZTPTRS).

## 9  Example

This example solves the system of equations $AX=B$, where
 $A= 4.30 0.00 0.00 0.00 -3.96 -4.87 0.00 0.00 0.40 0.31 -8.02 0.00 -0.27 0.07 -5.95 0.12 and B= -12.90 -21.50 16.75 14.93 -17.55 6.33 -11.04 8.09 ,$
using packed storage for $A$.

### 9.1  Program Text

Program Text (f07uefe.f90)

### 9.2  Program Data

Program Data (f07uefe.d)

### 9.3  Program Results

Program Results (f07uefe.r)