F07FQF (ZCPOSV) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

NAG Library Routine DocumentF07FQF (ZCPOSV)

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

F07FQF (ZCPOSV) uses the Cholesky factorization
 $A=UHU or A=LLH$
to compute the solution to a complex system of linear equations
 $AX=B ,$
where $A$ is an $n$ by $n$ Hermitian positive definite matrix and $X$ and $B$ are $n$ by $r$ matrices.

2  Specification

 SUBROUTINE F07FQF ( UPLO, N, NRHS, A, LDA, B, LDB, X, LDX, WORK, SWORK, RWORK, ITER, INFO)
 INTEGER N, NRHS, LDA, LDB, LDX, ITER, INFO REAL (KIND=nag_wp) RWORK(N) COMPLEX (KIND=nag_wp) A(LDA,*), B(LDB,*), X(LDX,*), WORK(N,NRHS) COMPLEX (KIND=nag_rp) SWORK(N*(N+NRHS)) CHARACTER(1) UPLO
The routine may be called by its LAPACK name zcposv.

3  Description

F07FQF (ZCPOSV) first attempts to factorize the matrix in reduced precision and use this factorization within an iterative refinement procedure to produce a solution with full precision normwise backward error quality (see below). If the approach fails the method switches to a full precision factorization and solve.
The iterative refinement can be more efficient than the corresponding direct full precision algorithm. Since the strategy implemented by F07FQF (ZCPOSV) must perform iterative refinement on each right-hand side, any efficiency gains will reduce as the number of right-hand sides increases. Conversely, as the matrix size increases the cost of these iterative refinements become less significant relative to the cost of factorization. Thus, any efficiency gains will be greatest for a very small number of right-hand sides and for large matrix sizes. The cut-off values for the number of right-hand sides and matrix size, for which the iterative refinement strategy performs better, depends on the relative performance of the reduced and full precision factorization and back-substitution. F07FQF (ZCPOSV) always attempts the iterative refinement strategy first; you are advised to compare the performance of F07FQF (ZCPOSV) with that of its full precision counterpart F07FNF (ZPOSV) to determine whether this strategy is worthwhile for your particular problem dimensions.
The iterative refinement process is stopped if ${\mathbf{ITER}}>30$ where ITER is the number of iterations carried out thus far. The process is also stopped if for all right-hand sides we have
 $resid < N x A ε ,$
where $‖\mathit{resid}‖$ is the $\infty$-norm of the residual, $‖x‖$ is the $\infty$-norm of the solution, $‖A‖$ is the $\infty$-norm of the matrix $A$ and $\epsilon$ is the machine precision returned by X02AJF.

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:     UPLO – CHARACTER(1)Input
On entry: specifies whether the upper or lower triangular part of $A$ is stored.
${\mathbf{UPLO}}=\text{'U'}$
The upper triangular part of $A$ is stored.
${\mathbf{UPLO}}=\text{'L'}$
The lower triangular part of $A$ is stored.
Constraint: ${\mathbf{UPLO}}=\text{'U'}$ or $\text{'L'}$.
2:     N – INTEGERInput
On entry: $n$, the number of linear equations, i.e., the order of the matrix $A$.
Constraint: ${\mathbf{N}}\ge 0$.
3:     NRHS – INTEGERInput
On entry: $r$, the number of right-hand sides, i.e., the number of columns of the matrix $B$.
Constraint: ${\mathbf{NRHS}}\ge 0$.
4:     A(LDA,$*$) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $n$ by $n$ Hermitian positive definite matrix $A$.
• If ${\mathbf{UPLO}}=\text{'U'}$, the upper triangular part of $A$ must be stored and the elements of the array below the diagonal are not referenced.
• If ${\mathbf{UPLO}}=\text{'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 iterative refinement has been successfully used (${\mathbf{INFO}}={\mathbf{0}}$ and ${\mathbf{ITER}}\ge 0$, see description below), then A is unchanged. If full precision factorization has been used (${\mathbf{INFO}}={\mathbf{0}}$ and ${\mathbf{ITER}}<0$, see description below), then the array $A$ contains the factor $U$ or $L$ from the Cholesky factorization $A={U}^{\mathrm{H}}U$ or $A=L{L}^{\mathrm{H}}$.
5:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F07FQF (ZCPOSV) is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
6:     B(LDB,$*$) – COMPLEX (KIND=nag_wp) arrayInput
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 right-hand side matrix $B$.
7:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F07FQF (ZCPOSV) is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
8:     X(LDX,$*$) – COMPLEX (KIND=nag_wp) arrayOutput
Note: the second dimension of the array X must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{NRHS}}\right)$.
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, the $n$ by $r$ solution matrix $X$.
9:     LDX – INTEGERInput
On entry: the first dimension of the array X as declared in the (sub)program from which F07FQF (ZCPOSV) is called.
Constraint: ${\mathbf{LDX}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
10:   WORK(${\mathbf{N}}$,${\mathbf{NRHS}}$) – COMPLEX (KIND=nag_wp) arrayWorkspace
11:   SWORK(${\mathbf{N}}×\left({\mathbf{N}}+{\mathbf{NRHS}}\right)$) – COMPLEX (KIND=nag_rp) arrayWorkspace
Note: this array is utilized in the reduced precision computation, consequently its type nag_rp reflects this usage.
12:   RWORK(N) – REAL (KIND=nag_wp) arrayWorkspace
13:   ITER – INTEGEROutput
On exit: information on the progress of the interative refinement process.
${\mathbf{ITER}}<0$
Iterative refinement has failed for one of the reasons given below, full precision factorization has been performed instead.
 $-1$ The routine fell back to full precision for implementation- or machine-specific reasons. $-2$ Narrowing the precision induced an overflow, the routine fell back to full precision. $-3$ An intermediate reduced precision factorization failed. $-31$ The maximum permitted number of iterations was exceeded.
${\mathbf{ITER}}>0$
Iterative refinement has been sucessfully used. ITER returns the number of iterations.
14:   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 argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
If ${\mathbf{INFO}}=i$, 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.

7  Accuracy

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
• if ${\mathbf{UPLO}}=\text{'U'}$, $\left|E\right|\le c\left(n\right)\epsilon \left|{U}^{\mathrm{H}}\right|\left|U\right|$;
• if ${\mathbf{UPLO}}=\text{'L'}$, $\left|E\right|\le c\left(n\right)\epsilon \left|L\right|\left|{L}^{\mathrm{H}}\right|$,
$c\left(n\right)$ is a modest linear function of $n$, and $\epsilon$ is the machine precision. See Section 10.1 of Higham (2002) for further details.
An approximate error bound for the computed solution is given by
 $x^ - x 1 x 1 ≤ κA E 1 A 1$
where $\kappa \left(A\right)={‖{A}^{-1}‖}_{1}{‖A‖}_{1}$, 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.

8  Further Comments

The real analogue of this routine is F07FCF (DSPOSV).

9  Example

This example solves the equations
 $AX=B ,$
where $A$ is the Hermitian positive definite matrix
 $A = 3.23i+0.00 1.51-1.92i 1.90+0.84i 0.42+2.50i 1.51+1.92i 3.58i+0.00 -0.23+1.11i -1.18+1.37i 1.90-0.84i -0.23-1.11i 4.09i+0.00 2.33-0.14i 0.42-2.50i -1.18-1.37i 2.33+0.14i 4.29i+0.00$
and
 $B = 3.93-06.14i 6.17+09.42i -7.17-21.83i 1.99-14.38i .$

9.1  Program Text

Program Text (f07fqfe.f90)

9.2  Program Data

Program Data (f07fqfe.d)

9.3  Program Results

Program Results (f07fqfe.r)

F07FQF (ZCPOSV) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual