NAG Library Routine Document

F07CVF (ZGTRFS)

factorization returned by F07CRF (ZGTTRF) and an initial solution returned by F07CSF (ZGTTRS). Iterative refinement is used to reduce the backward error as much as possible.

2 Specification

SUBROUTINE F07CVF (

TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)

INTEGER	N, NRHS, IPIV(*), LDB, LDX, INFO
REAL (KIND=nag_wp)	FERR(NRHS), BERR(NRHS), RWORK(N)
COMPLEX (KIND=nag_wp)	DL(), D(), DU(), DLF(), DF(), DUF(), DU2(), B(LDB,), X(LDX,), WORK(2N)
CHARACTER(1)	TRANS

The routine may be called by its LAPACK name zgtrfs.

3 Description

F07CVF (ZGTRFS) should normally be preceded by calls to F07CRF (ZGTTRF) and F07CSF (ZGTTRS). F07CRF (ZGTTRF) uses Gaussian elimination with partial pivoting and row interchanges to factorize the matrix

A

A = P L U,

where

P

is a permutation matrix,

L

is unit lower triangular with at most one nonzero subdiagonal element in each column, and

U

is an upper triangular band matrix, with two superdiagonals. F07CSF (ZGTTRS) then utilizes the factorization to compute a solution,

\hat{X}

, to the required equations. Letting

\hat{x}

denote a column of

\hat{X}

, F07CVF (ZGTRFS) computes a component-wise backward error,

β

, the smallest relative perturbation in each element of

A

and

b

such that

\hat{x}

is the exact solution of a perturbed system

(A + E) \hat{x} = b + f, with |e_{i j}| \leq β |a_{i j}|, and |f_{j}| \leq β |b_{j}| .

The routine also estimates a bound for the component-wise forward error in the computed solution defined by

\max |x_{i} - \hat{x_{i}}| / \max |\hat{x_{i}}|

, where

x

is the corresponding column of the exact solution,

X

4 References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug

5 Parameters

1: TRANS – CHARACTER(1)Input

On entry: specifies the equations to be solved as follows:

$TRANS ='N'$: Solve $A X = B$ for $X$ .
$TRANS ='T'$: Solve $A^{T} X = B$ for $X$ .
$TRANS ='C'$: Solve $A^{H} X = B$ for $X$ .

Constraint:

TRANS ='N'

'T'

'C'

2: N – INTEGERInput

On entry:

n

, the order of the matrix

A

Constraint:

N \geq 0

3: NRHS – INTEGERInput

On entry:

r

, the number of right-hand sides, i.e., the number of columns of the matrix

B

Constraint:

NRHS \geq 0

4: DL( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N - 1)

On entry: must contain the

(n - 1)

subdiagonal elements of the matrix

A

5: D( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N)

On entry: must contain the

n

diagonal elements of the matrix

A

6: DU( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N - 1)

On entry: must contain the

(n - 1)

superdiagonal elements of the matrix

A

7: DLF( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N - 1)

On entry: must contain the

(n - 1)

multipliers that define the matrix

L

of the

L U

factorization of

A

8: DF( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N)

On entry: must contain the

n

diagonal elements of the upper triangular matrix

U

from the

L U

factorization of

A

9: DUF( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N - 1)

On entry: must contain the

(n - 1)

elements of the first superdiagonal of

U

10: DU2( $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N - 2)

On entry: must contain the

(n - 2)

elements of the second superdiagonal of

U

11: IPIV( $*$ ) – INTEGER arrayInput

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

\max (1, N)

On entry: must contain the

n

pivot indices that define the permutation matrix

P

. At the

i

th step, row

i

of the matrix was interchanged with row

IPIV (i)

, and

IPIV (i)

must always be either

i

(i + 1)

IPIV (i) = i

indicating that a row interchange was not performed.

12: B(LDB, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, NRHS)

On entry: the

n

r

matrix of right-hand sides

B

13: LDB – INTEGERInput

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

Constraint:

LDB \geq \max (1, N)

14: X(LDX, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput/Output

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

\max (1, NRHS)

On entry: the

n

r

initial solution matrix

X

On exit: the

n

r

refined solution matrix

X

15: LDX – INTEGERInput

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

Constraint:

LDX \geq \max (1, N)

16: FERR(NRHS) – REAL (KIND=nag_wp) arrayOutput

On exit: estimate of the forward error bound for each computed solution vector, such that

{‖{\hat{x}}_{j} - x_{j}‖}_{\infty} / {‖{\hat{x}}_{j}‖}_{\infty} \leq FERR (j)

, where

{\hat{x}}_{j}

is the

j

th column of the computed solution returned in the array X and

x_{j}

is the corresponding column of the exact solution

X

. The estimate is almost always a slight overestimate of the true error.

17: BERR(NRHS) – REAL (KIND=nag_wp) arrayOutput

On exit: estimate of the component-wise relative backward error of each computed solution vector

{\hat{x}}_{j}

(i.e., the smallest relative change in any element of

A

B

that makes

{\hat{x}}_{j}

an exact solution).

18: WORK( $2 \times N$ ) – COMPLEX (KIND=nag_wp) arrayWorkspace

19: RWORK(N) – REAL (KIND=nag_wp) arrayWorkspace

20: INFO – INTEGEROutput

On exit:

INFO = 0

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

6 Error Indicators and Warnings

Errors or warnings detected by the routine:

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

7 Accuracy

The computed solution for a single right-hand side,

\hat{x}

, satisfies an equation of the form

(A + E) \hat{x} = b,

where

{‖E‖}_{\infty} = O (ε) {‖A‖}_{\infty}

and

ε

is the machine precision. An approximate error bound for the computed solution is given by

\frac{{‖\hat{x} - x‖}_{\infty}}{{‖x‖}_{\infty}} \leq κ (A) \frac{{‖E‖}_{\infty}}{{‖A‖}_{\infty}},

where

κ (A) = {‖A^{- 1}‖}_{\infty} {‖A‖}_{\infty}

, the condition number of

A

with respect to the solution of the linear equations. See Section 4.4 of Anderson et al. (1999) for further details.

Routine F07CUF (ZGTCON) can be used to estimate the condition number of

A

8 Further Comments

The total number of floating point operations required to solve the equations

A X = B

A^{T} X = B

A^{H} X = B

is proportional to

n r

. At most five steps of iterative refinement are performed, but usually only one or two steps are required.

The real analogue of this routine is F07CHF (DGTRFS).

9 Example

This example solves the equations

A X = B,

where

A

is the tridiagonal matrix

A = (\begin{array}{r} - 1.3 + 1.3 i & 2.0 - 1.0 i & 0 & 0 & 0 \\ 1.0 - 2.0 i & - 1.3 + 1.3 i & 2.0 + 1.0 i & 0 & 0 \\ 0 & 1.0 + 1.0 i & - 1.3 + 3.3 i & - 1.0 + 1.0 i & 0 \\ 0 & 0 & 2.0 - 3.0 i & - 0.3 + 4.3 i & 1.0 - 1.0 i \\ 0 & 0 & 0 & 1.0 + 1.0 i & - 3.3 + 1.3 i \end{array})

and

B = (\begin{array}{r} 2.4 - 5.0 i & 2.7 + 6.9 i \\ 3.4 + 18.2 i & - 6.9 - 5.3 i \\ - 14.7 + 9.7 i & - 6.0 - 0.6 i \\ 31.9 - 7.7 i & - 3.9 + 9.3 i \\ - 1.0 + 1.6 i & - 3.0 + 12.2 i \end{array}) .

Estimates for the backward errors and forward errors are also output.

NAG Library Routine DocumentF07CVF (ZGTRFS)

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

9.1 Program Text

9.2 Program Data

9.3 Program Results

NAG Library Routine Document

F07CVF (ZGTRFS)