NAG Library Routine Document

f11jsf  (complex_herm_solve_jacssor)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

1:     $\mathbf{method}$ – Character(*)Input

On entry: specifies the iterative method to be used.

$\mathbf{method}=\text{'CG'}$

Conjugate gradient method.

$\mathbf{method}=\text{'SYMMLQ'}$

Lanczos method (SYMMLQ).

Constraint: $\mathbf{method}=\text{'CG'}$ or $\text{'SYMMLQ'}$.

2:     $\mathbf{precon}$ – Character(1)Input

On entry: specifies the type of preconditioning to be used.

$\mathbf{precon}=\text{'N'}$

No preconditioning.

$\mathbf{precon}=\text{'J'}$

Jacobi.

$\mathbf{precon}=\text{'S'}$

Symmetric successive-over-relaxation (SSOR).

Constraint: $\mathbf{precon}=\text{'N'}$, $\text{'J'}$ or $\text{'S'}$.

3:     $\mathbf{n}$ – IntegerInput

On entry: $n$, the order of the matrix $A$.

Constraint: $\mathbf{n}\ge 1$.

4:     $\mathbf{nnz}$ – IntegerInput

On entry: the number of nonzero elements in the lower triangular part of the matrix $A$.

Constraint: $1\le \mathbf{nnz}\le \mathbf{n}\times \left(\mathbf{n}+1\right)/2$.

5:     $\mathbf{a}\left(\mathbf{nnz}\right)$ – Complex (Kind=nag_wp) arrayInput

On entry: the nonzero elements of the lower triangular part of the matrix $A$, ordered by increasing row index, and by increasing column index within each row. Multiple entries for the same row and column indices are not permitted. The routine f11zpf may be used to order the elements in this way.

6:     $\mathbf{irow}\left(\mathbf{nnz}\right)$ – Integer arrayInput

7:     $\mathbf{icol}\left(\mathbf{nnz}\right)$ – Integer arrayInput

On entry: the row and column indices of the nonzero elements supplied in array a.

Constraints:

irow and icol must satisfy these constraints (which may be imposed by a call to f11zpf):

• $1\le \mathbf{irow}\left(\mathit{i}\right)\le \mathbf{n}$ and $1\le \mathbf{icol}\left(\mathit{i}\right)\le \mathbf{irow}\left(\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,\mathbf{nnz}$;
• $\mathbf{irow}\left(\mathit{i}-1\right)<\mathbf{irow}\left(\mathit{i}\right)$ or $\mathbf{irow}\left(\mathit{i}-1\right)=\mathbf{irow}\left(\mathit{i}\right)$ and $\mathbf{icol}\left(\mathit{i}-1\right)<\mathbf{icol}\left(\mathit{i}\right)$, for $\mathit{i}=2,3,\dots ,\mathbf{nnz}$.

8:     $\mathbf{omega}$ – Real (Kind=nag_wp)Input

On entry: if $\mathbf{precon}=\text{'S'}$, omega is the relaxation parameter $\omega$ to be used in the SSOR method. Otherwise omega need not be initialized.

Constraint: $0.0<\mathbf{omega}<2.0$.

9:     $\mathbf{b}\left(\mathbf{n}\right)$ – Complex (Kind=nag_wp) arrayInput

On entry: the right-hand side vector $b$.

10:   $\mathbf{tol}$ – Real (Kind=nag_wp)Input

On entry: the required tolerance. Let $x_k$ denote the approximate solution at iteration $k$, and $r_k$ the corresponding residual. The algorithm is considered to have converged at iteration $k$ if

$${‖r_k‖}_{\infty }\le \tau \times \left({‖b‖}_{\infty }+{‖A‖}_{\infty }{‖x_k‖}_{\infty }\right)\text{.}$$

If $\mathbf{tol}\le 0.0$, $\tau =\max \sqrt{\epsilon },10\epsilon ,\sqrt{n}\epsilon$ is used, where $\epsilon$ is the machine precision. Otherwise $\tau =\max \left(\mathbf{tol},10\epsilon ,\sqrt{n}\epsilon \right)$ is used.

Constraint: $\mathbf{tol}<1.0$.

11:   $\mathbf{maxitn}$ – IntegerInput

On entry: the maximum number of iterations allowed.

Constraint: $\mathbf{maxitn}\ge 1$.

12:   $\mathbf{x}\left(\mathbf{n}\right)$ – Complex (Kind=nag_wp) arrayInput/Output

On entry: an initial approximation to the solution vector $x$.

On exit: an improved approximation to the solution vector $x$.

13:   $\mathbf{rnorm}$ – Real (Kind=nag_wp)Output

On exit: the final value of the residual norm $‖r_k‖$, where $k$ is the output value of itn.

14:   $\mathbf{itn}$ – IntegerOutput

On exit: the number of iterations carried out.

15:   $\mathbf{rdiag}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) arrayOutput

On exit: the elements of the diagonal matrix $D^{-1}$, where $D$ is the diagonal part of $A$. Note that since $A$ is Hermitian the elements of $D^{-1}$ are necessarily real.

16:   $\mathbf{work}\left(\mathbf{lwork}\right)$ – Complex (Kind=nag_wp) arrayWorkspace

17:   $\mathbf{lwork}$ – IntegerInput

On entry: the dimension of the array work as declared in the (sub)program from which f11jsf is called.

Constraints:

• if $\mathbf{method}=\text{'CG'}$, $\mathbf{lwork}\ge 6\times \mathbf{n}+120$;
• if $\mathbf{method}=\text{'SYMMLQ'}$, $\mathbf{lwork}\ge 7\times \mathbf{n}+120$.

18:   $\mathbf{iwork}\left(\mathbf{n}+1\right)$ – Integer arrayWorkspace

19:   $\mathbf{ifail}$ – IntegerInput/Output

On entry: ifail must be set to $0$, $-1\text{ or }1$. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{ or }1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, if you are not familiar with this argument, the recommended value is $0$. When the value $-\mathbf{1}\text{ or }\mathbf{1}$ is used it is essential to test the value of ifail on exit.

On exit: $\mathbf{ifail}=\mathbf{0}$ unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

$\mathbf{ifail}=1$

On entry,	$\mathbf{method}\ne \text{'CG'}$ or $\text{'SYMMLQ'}$,
or	$\mathbf{precon}\ne \text{'N'}$, $\text{'J'}$ or $\text{'S'}$,
or	$\mathbf{n}<1$,
or	$\mathbf{nnz}<1$,
or	$\mathbf{nnz}>\mathbf{n}\times \left(\mathbf{n}+1\right)/2$,
or	omega lies outside the interval $\left(0.0,2.0\right)$,
or	$\mathbf{tol}\ge 1.0$,
or	$\mathbf{maxitn}<1$,
or	lwork is too small.

$\mathbf{ifail}=2$

On entry, the arrays irow and icol fail to satisfy the following constraints:

• $1\le \mathbf{irow}\left(i\right)\le \mathbf{n}$ and $1\le \mathbf{icol}\left(i\right)\le \mathbf{irow}\left(i\right)$, for $i=1,2,\dots ,\mathbf{nnz}$;
• $\mathbf{irow}\left(i-1\right)<\mathbf{irow}\left(i\right)$, or $\mathbf{irow}\left(i-1\right)=\mathbf{irow}\left(i\right)$ and $\mathbf{icol}\left(i-1\right)<\mathbf{icol}\left(i\right)$, for $i=2,3,\dots ,\mathbf{nnz}$.

Therefore a nonzero element has been supplied which does not lie in the lower triangular part of $A$, is out of order, or has duplicate row and column indices. Call f11zpf to reorder and sum or remove duplicates.

$\mathbf{ifail}=3$

On entry, the matrix $A$ has a zero diagonal element. Jacobi and SSOR preconditioners are not appropriate for this problem.

$\mathbf{ifail}=4$

The required accuracy could not be obtained. However, a reasonable accuracy has been obtained and further iterations could not improve the result.

$\mathbf{ifail}=5$

Required accuracy not obtained in maxitn iterations.

$\mathbf{ifail}=6$

The preconditioner appears not to be positive definite.

$\mathbf{ifail}=7$

The matrix of the coefficients appears not to be positive definite (conjugate gradient method only).

$\mathbf{ifail}=8$

A serious error has occurred in an internal call to an auxiliary routine. Check all subroutine calls and array sizes. Seek expert help.

$\mathbf{ifail}=9$

The matrix of the coefficients has a non-real diagonal entry, and is therefore not Hermitian.

$\mathbf{ifail}=-99$

An unexpected error has been triggered by this routine. Please contact NAG.

See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$\mathbf{ifail}=-399$

Your licence key may have expired or may not have been installed correctly.

See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$\mathbf{ifail}=-999$

Dynamic memory allocation failed.

See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

Program Text (f11jsfe.f90)

10.2

Program Data

Program Data (f11jsfe.d)

10.3

Program Results

Program Results (f11jsfe.r)