NAG Library Routine Document

F07HSF (ZPBTRS)

+− 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

1 Purpose

F07HSF (ZPBTRS) solves a complex Hermitian positive definite band system of linear equations with multiple right-hand sides,

A X = B,

where

A

has been factorized by F07HRF (ZPBTRF).

2 Specification

SUBROUTINE F07HSF (

UPLO, N, KD, NRHS, AB, LDAB, B, LDB, INFO)

INTEGER	N, KD, NRHS, LDAB, LDB, INFO
COMPLEX (KIND=nag_wp)	AB(LDAB,), B(LDB,)
CHARACTER(1)	UPLO

The routine may be called by its LAPACK name zpbtrs.

3 Description

F07HSF (ZPBTRS) is used to solve a complex Hermitian positive definite band system of linear equations

A X = B

, the routine must be preceded by a call to F07HRF (ZPBTRF) which computes the Cholesky factorization of

A

. The solution

X

is computed by forward and backward substitution.

UPLO ='U'

A = U^{H} U

, where

U

is upper triangular; the solution

X

is computed by solving

U^{H} Y = B

and then

U X = Y

UPLO ='L'

A = L L^{H}

, where

L

is lower triangular; the solution

X

is computed by solving

L Y = B

and then

L^{H} X = Y

4 References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Parameters

1: UPLO – CHARACTER(1)Input

On entry: specifies how

A

has been factorized.

$UPLO ='U'$: $A = U^{H} U$ , where $U$ is upper triangular.
$UPLO ='L'$: $A = L L^{H}$ , where $L$ is lower triangular.

Constraint:

UPLO ='U'

'L'

2: N – INTEGERInput

On entry:

n

, the order of the matrix

A

Constraint:

N \geq 0

3: KD – INTEGERInput

On entry:

k_{d}

, the number of superdiagonals or subdiagonals of the matrix

A

Constraint:

KD \geq 0

4: NRHS – INTEGERInput

On entry:

r

, the number of right-hand sides.

Constraint:

NRHS \geq 0

5: AB(LDAB, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput

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

\max (1, N)

On entry: the Cholesky factor of

A

, as returned by F07HRF (ZPBTRF).

6: LDAB – INTEGERInput

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

Constraint:

LDAB \geq KD + 1

7: B(LDB, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput/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 – INTEGERInput

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

Constraint:

LDB \geq \max (1, N)

9: 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 parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.

7 Accuracy

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

if $UPLO ='U'$ , $|E| \leq c (k + 1) ε |U^{H}| |U|$ ;
if $UPLO ='L'$ , $|E| \leq c (k + 1) ε |L| |L^{H}|$ ,

c (k + 1)

is a modest linear function of

k + 1

, 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 (k + 1) cond (A, x) ε

where

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

. Note that

cond (A, x)

can be much smaller than

cond (A)

Forward and backward error bounds can be computed by calling F07HVF (ZPBRFS), and an estimate for

κ_{\infty} (A)

(

= κ_{1} (A)

) can be obtained by calling F07HUF (ZPBCON).

8 Further Comments

The total number of real floating point operations is approximately

16 n k r

, assuming

n ≫ k

This routine may be followed by a call to F07HVF (ZPBRFS) to refine the solution and return an error estimate.

The real analogue of this routine is F07HEF (DPBTRS).

9 Example

This example solves the system of equations

A X = B

, where

A = (\begin{array}{r} 9.39 + 0.00 i & 1.08 - 1.73 i & 0.00 + 0.00 i & 0.00 + 0.00 i \\ 1.08 + 1.73 i & 1.69 + 0.00 i & - 0.04 + 0.29 i & 0.00 + 0.00 i \\ 0.00 + 0.00 i & - 0.04 - 0.29 i & 2.65 + 0.00 i & - 0.33 + 2.24 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & - 0.33 - 2.24 i & 2.17 + 0.00 i \end{array})

and

B = (\begin{array}{r} - 12.42 + 68.42 i & 54.30 - 56.56 i \\ - 9.93 + 0.88 i & 18.32 + 4.76 i \\ - 27.30 - 0.01 i & - 4.40 + 9.97 i \\ 5.31 + 23.63 i & 9.43 + 1.41 i \end{array}) .

Here

A

is Hermitian positive definite, and is treated as a band matrix, which must first be factorized by F07HRF (ZPBTRF).

NAG Library Routine DocumentF07HSF (ZPBTRS)

+− 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

F07HSF (ZPBTRS)