Integer, Intent (In)	::	n, nrhs, ldb
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (In)	::	ap(*)
Complex (Kind=nag_wp), Intent (Inout)	::	b(ldb,*)
Character (1), Intent (In)	::	uplo, trans, diag

C Header Interface

#include <nag.h>

void	f07usf_ (const char uplo, const char trans, const char diag, const Integer n, const Integer nrhs, const Complex ap[], Complex b[], const Integer ldb, Integer *info, const Charlen length_uplo, const Charlen length_trans, const Charlen length_diag)

The routine may be called by the names f07usf, nagf_lapacklin_ztptrs or its LAPACK name ztptrs.

3 Description

f07usf solves a complex triangular system of linear equations

A X = B

A^{T} X = B

A^{H} 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 Arguments

1: $uplo$ – Character(1) Input

On entry: specifies whether

A

is upper or lower triangular.

$uplo ='U'$: $A$ is upper triangular.
$uplo ='L'$: $A$ is lower triangular.

Constraint:

uplo ='U'

'L'

2: $trans$ – Character(1) Input

On entry: indicates the form of the equations.

$trans ='N'$: The equations are of the form $A X = B$ .
$trans ='T'$: The equations are of the form $A^{T} X = B$ .
$trans ='C'$: The equations are of the form $A^{H} X = B$ .

Constraint:

trans ='N'

'T'

'C'

3: $diag$ – Character(1) Input

On entry: indicates whether

A

is a nonunit or unit triangular matrix.

$diag ='N'$: $A$ is a nonunit triangular matrix.
$diag ='U'$: $A$ is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be $1$ .

Constraint:

diag ='N'

'U'

4: $n$ – Integer Input

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 0

5: $nrhs$ – Integer Input

On entry:

r

, the number of right-hand sides.

Constraint:

nrhs \geq 0

6: $ap (*)$ – Complex (Kind=nag_wp) array Input

Note: the dimension of the array ap must be at least

\max (1, n \times (n + 1) / 2)

On entry: the

n

n

triangular matrix

A

, packed by columns.

More precisely,

if $uplo ='U'$ , the upper triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + j (j - 1) / 2)$ for $i \leq j$ ;
if $uplo ='L'$ , the lower triangle of $A$ must be stored with element $A_{i j}$ in $ap (i + (2 n - j) (j - 1) / 2)$ for $i \geq j$ .

diag ='U'

, the diagonal elements of

A

are assumed to be

1

, and are not referenced; the same storage scheme is used whether

diag ='N'

or ‘U’.

7: $b (ldb *)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array b must be at least

\max (1, nrhs)

On entry: the

n

r

right-hand side matrix

B

On exit: the

n

r

solution matrix

X

8: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which f07usf is called.

Constraint:

ldb \geq \max (1, n)

9: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$info < 0$: If $info = - i$ , argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$info > 0$: Element $〈value〉$ of the diagonal 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

(A + E) x = b

, where

|E| \leq c (n) ε |A|,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

\hat{x}

is the true solution, then the computed solution

x

satisfies a forward error bound of the form

\frac{{‖x - \hat{x}‖}_{\infty}}{{‖x‖}_{\infty}} \leq c (n) cond (A, x) ε,   provided c (n) cond (A, x) ε < 1,

where

cond (A, x) = {‖|A^{- 1}| |A| |x|‖}_{\infty} / {‖x‖}_{\infty}

Note that

cond (A, x) \leq cond (A) = {‖|A^{- 1}| |A|‖}_{\infty} \leq κ_{\infty} (A)

;

cond (A, x)

can be much smaller than

cond (A)

and it is also possible for

cond (A^{H})

, which is the same as

cond (A^{T})

, to be much larger (or smaller) than

cond (A)

Forward and backward error bounds can be computed by calling f07uvf, and an estimate for

κ_{\infty} (A)

can be obtained by calling f07uuf with

norm ='I'

8 Parallelism and Performance

f07usf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f07usf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of real floating-point operations is approximately

4 n^{2} r

The real analogue of this routine is f07uef.

10 Example

This example solves the system of equations

A X = B

, where

A = (\begin{array}{r} 4.78 + 4.56 i & 0.00 + 0.00 i & 0.00 + 0.00 i & 0.00 + 0.00 i \\ 2.00 - 0.30 i & - 4.11 + 1.25 i & 0.00 + 0.00 i & 0.00 + 0.00 i \\ 2.89 - 1.34 i & 2.36 - 4.25 i & 4.15 + 0.80 i & 0.00 + 0.00 i \\ - 1.89 + 1.15 i & 0.04 - 3.69 i & - 0.02 + 0.46 i & 0.33 - 0.26 i \end{array})

and

B = (\begin{array}{r} - 14.78 - 32.36 i & - 18.02 + 28.46 i \\ 2.98 - 2.14 i & 14.22 + 15.42 i \\ - 20.96 + 17.06 i & 5.62 + 35.89 i \\ 9.54 + 9.91 i & - 16.46 - 1.73 i \end{array}),

using packed storage for

A

f07us: FL CL CPP AD

NAG FL Interfacef07usf (ztptrs)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f07usf (ztptrs)