NAG Library Routine Document

F07FPF (ZPOSVX)

INTEGER	N, NRHS, LDA, LDAF, LDB, LDX, INFO
REAL (KIND=nag_wp)	S(*), RCOND, FERR(NRHS), BERR(NRHS), RWORK(N)
COMPLEX (KIND=nag_wp)	A(LDA,), AF(LDAF,), B(LDB,), X(LDX,), WORK(2*N)
CHARACTER(1)	FACT, UPLO, EQUED

The routine may be called by its LAPACK name zposvx.

3 Description

F07FPF (ZPOSVX) performs the following steps:

If $FACT ='E'$ , real diagonal scaling factors, $D_{S}$ , are computed to equilibrate the system:
$(D_{S} A D_{S}) (D_{S}^{- 1} X) = D_{S} B .$
Whether or not the system will be equilibrated depends on the scaling of the matrix $A$ , but if equilibration is used, $A$ is overwritten by $D_{S} A D_{S}$ and $B$ by $D_{S} B$ .
If $FACT ='N'$ or $'E'$ , the Cholesky decomposition is used to factor the matrix $A$ (after equilibration if $FACT ='E'$ ) as $A = U^{H} U$ if $UPLO ='U'$ or $A = L L^{H}$ if $UPLO ='L'$ , where $U$ is an upper triangular matrix and $L$ is a lower triangular matrix.
If the leading $i$ by $i$ principal minor of $A$ is not positive definite, then the routine returns with $INFO = i$ . Otherwise, the factored form of $A$ is used to estimate the condition number of the matrix $A$ . If the reciprocal of the condition number is less than machine precision, $INFO = N + 1$ is returned as a warning, but the routine still goes on to solve for $X$ and compute error bounds as described below.
The system of equations is solved for $X$ using the factored form of $A$ .
Iterative refinement is applied to improve the computed solution matrix and to calculate error bounds and backward error estimates for it.
If equilibration was used, the matrix $X$ is premultiplied by $D_{S}$ so that it solves the original system before equilibration.

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

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

Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

5 Parameters

1: FACT – CHARACTER(1)Input

On entry: specifies whether or not the factorized form of the matrix

A

is supplied on entry, and if not, whether the matrix

A

should be equilibrated before it is factorized.

$FACT ='F'$: AF contains the factorized form of $A$ . If $EQUED ='Y'$ , the matrix $A$ has been equilibrated with scaling factors given by S. A and AF will not be modified.
$FACT ='N'$: The matrix $A$ will be copied to AF and factorized.
$FACT ='E'$: The matrix $A$ will be equilibrated if necessary, then copied to AF and factorized.

Constraint:

FACT ='F'

'N'

'E'

2: UPLO – CHARACTER(1)Input

On entry: if

UPLO ='U'

, the upper triangle of

A

is stored.

UPLO ='L'

, the lower triangle of

A

is stored.

Constraint:

UPLO ='U'

'L'

3: N – INTEGERInput

On entry:

n

, the number of linear equations, i.e., the order of the matrix

A

Constraint:

N \geq 0

4: 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

5: A(LDA, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput/Output

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

\max (1, N)

On entry: the

n

n

Hermitian matrix

A

FACT ='F'

and

EQUED ='Y'

, A must have been equilibrated by the scaling factor in S as

D_{S} A D_{S}

If $UPLO ='U'$ , the upper triangular part of $A$ must be stored and the elements of the array below the diagonal are not referenced.
If $UPLO ='L'$ , the lower triangular part of $A$ must be stored and the elements of the array above the diagonal are not referenced.

On exit: if

FACT ='F'

'N'

, or if

FACT ='E'

and

EQUED ='N'

, A is not modified.

FACT ='E'

and

EQUED ='Y'

, A is overwritten by

D_{S} A D_{S}

6: LDA – INTEGERInput

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

Constraint:

LDA \geq \max (1, N)

7: AF(LDAF, $*$ ) – COMPLEX (KIND=nag_wp) arrayInput/Output

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

\max (1, N)

On entry: if

FACT ='F'

, AF contains the triangular factor

U

L

from the Cholesky factorization

A = U^{H} U

A = L L^{H}

, in the same storage format as A. If

EQUED \neq'N'

, AF is the factorized form of the equilibrated matrix

D_{S} A D_{S}

On exit: if

FACT ='N'

, AF returns the triangular factor

U

L

from the Cholesky factorization

A = U^{H} U

A = L L^{H}

of the original matrix

A

FACT ='E'

, AF returns the triangular factor

U

L

from the Cholesky factorization

A = U^{H} U

A = L L^{H}

of the equilibrated matrix

A

(see the description of A for the form of the equilibrated matrix).

8: LDAF – INTEGERInput

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

Constraint:

LDAF \geq \max (1, N)

9: EQUED – CHARACTER(1)Input/Output

On entry: if

FACT ='N'

'E'

, EQUED need not be set.

FACT ='F'

, EQUED must specify the form of the equilibration that was performed as follows:

if $EQUED ='N'$ , no equilibration;
if $EQUED ='Y'$ , equilibration was performed, i.e., $A$ has been replaced by $D_{S} A D_{S}$ .

On exit: if

FACT ='F'

, EQUED is unchanged from entry.

Otherwise, if no constraints are violated, EQUED specifies the form of the equilibration that was performed as specified above.

Constraint: if

FACT ='F'

EQUED ='N'

'Y'

10: S( $*$ ) – REAL (KIND=nag_wp) arrayInput/Output

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

\max (1, N)

On entry: if

FACT ='N'

'E'

, S need not be set.

FACT ='F'

and

EQUED ='Y'

, S must contain the scale factors,

D_{S}

, for

A

; each element of S must be positive.

On exit: if

FACT ='F'

, S is unchanged from entry.

Otherwise, if no constraints are violated and

EQUED ='Y'

, S contains the scale factors,

D_{S}

, for

A

; each element of S is positive.

11: 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: if

EQUED ='N'

, B is not modified.

EQUED ='Y'

, B is overwritten by

D_{S} B

12: LDB – INTEGERInput

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

Constraint:

LDB \geq \max (1, N)

13: X(LDX, $*$ ) – COMPLEX (KIND=nag_wp) arrayOutput

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

\max (1, NRHS)

On exit: if

INFO = 0

N + 1

, the

n

r

solution matrix

X

to the original system of equations. Note that the arrays

A

and

B

are modified on exit if

EQUED ='Y'

, and the solution to the equilibrated system is

D_{S}^{- 1} X

14: LDX – INTEGERInput

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

Constraint:

LDX \geq \max (1, N)

15: RCOND – REAL (KIND=nag_wp)Output

On exit: if no constraints are violated, an estimate of the reciprocal condition number of the matrix

A

(after equilibration if that is performed), computed as

RCOND = 1.0 / ({‖A‖}_{1} {‖A^{- 1}‖}_{1})

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

On exit: if

INFO = 0

N + 1

, an estimate of the forward error bound for each computed solution vector, such that

{‖{\hat{x}}_{j} - x_{j}‖}_{\infty} / {‖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 as reliable as the estimate for RCOND, and is almost always a slight overestimate of the true error.

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

On exit: if

INFO = 0

N + 1

, an 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.

$INFO > 0 and INFO \leq N$: If $INFO = i$ and $i \leq N$ , the leading minor of order $i$ of $A$ is not positive definite, so the factorization could not be completed, and the solution has not been computed. $RCOND = 0.0$ is returned.

$INFO = N + 1$: The triangular matrix $U$ (or $L$ ) is nonsingular, but RCOND is less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value of RCOND would suggest.

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 (n) ε |U^{H}| |U|$ ;
if $UPLO ='L'$ , $|E| \leq c (n) ε |L| |L^{H}|$ ,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision. See Section 10.1 of Higham (2002) for further details.

\hat{x}

is the true solution, then the computed solution

x

satisfies a forward error bound of the form

\frac{{‖x - \hat{x}‖}_{\infty}}{{‖\hat{x}‖}_{\infty}} \leq w_{c} cond (A, \hat{x}, b)

where

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

. If

\hat{x}

is the

j

th column of

X

, then

w_{c}

is returned in

BERR (j)

and a bound on

{‖x - \hat{x}‖}_{\infty} / {‖\hat{x}‖}_{\infty}

is returned in

FERR (j)

. See Section 4.4 of Anderson et al. (1999) for further details.

8 Further Comments

The factorization of

A

requires approximately

\frac{4}{3} n^{3}

floating point operations.

For each right-hand side, computation of the backward error involves a minimum of

16 n^{2}

floating point operations. Each step of iterative refinement involves an additional

24 n^{2}

operations. At most five steps of iterative refinement are performed, but usually only one or two steps are required. Estimating the forward error involves solving a number of systems of equations of the form

A x = b

; the number is usually

4

5

and never more than

11

. Each solution involves approximately

8 n^{2}

operations.

The real analogue of this routine is F07FBF (DPOSVX).

9 Example

This example solves the equations

A X = B,

where

A

is the Hermitian positive definite matrix

A = (\begin{array}{r} 3.23 & 1.51 - 1.92 i & 1.90 + 0.84 i & 0.42 + 2.50 i \\ 1.51 + 1.92 i & 3.58 & - 0.23 + 1.11 i & - 1.18 + 1.37 i \\ 1.90 - 0.84 i & - 0.23 - 1.11 i & 4.09 & 2.33 - 0.14 i \\ 0.42 - 2.50 i & - 1.18 - 1.37 i & 2.33 + 0.14 i & 4.29 \end{array})

and

B = (\begin{array}{r} 3.93 - 6.14 i & 1.48 + 6.58 i \\ 6.17 + 9.42 i & 4.64 - 4.75 i \\ - 7.17 - 21.83 i & - 4.91 + 2.29 i \\ 1.99 - 14.38 i & 7.64 - 10.79 i \end{array}) .

Error estimates for the solutions, information on equilibration and an estimate of the reciprocal of the condition number of the scaled matrix

A

are also output.

NAG Library Routine DocumentF07FPF (ZPOSVX)

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

F07FPF (ZPOSVX)