NAG Library Routine Document

f11dqf  (complex_gen_solve_ilu)

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{'RGMRES'}$

Restarted generalized minimum residual method.

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

Conjugate gradient squared method.

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

Bi-conjugate gradient stabilized ($\ell$) method.

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

Transpose-free quasi-minimal residual method.

Constraint: $\mathbf{method}=\text{'RGMRES'}$, $\text{'CGS'}$, $\text{'BICGSTAB'}$ or $\text{'TFQMR'}$.

2:     $\mathbf{n}$ – IntegerInput

On entry: $n$, the order of the matrix $A$. This must be the same value as was supplied in the preceding call to f11dnf.

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

3:     $\mathbf{nnz}$ – IntegerInput

On entry: the number of nonzero elements in the matrix $A$. This must be the same value as was supplied in the preceding call to f11dnf.

Constraint: $1\le \mathbf{nnz}\le {\mathbf{n}}^2$.

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

On entry: the values returned in the array a by a previous call to f11dnf.

5:     $\mathbf{la}$ – IntegerInput

On entry: the dimension of the arrays a, irow and icol as declared in the (sub)program from which f11dqf is called. This must be the same value as was supplied in the preceding call to f11dnf.

Constraint: $\mathbf{la}\ge 2\times \mathbf{nnz}$.

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

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

8:     $\mathbf{ipivp}\left(\mathbf{n}\right)$ – Integer arrayInput

9:     $\mathbf{ipivq}\left(\mathbf{n}\right)$ – Integer arrayInput

10:   $\mathbf{istr}\left(\mathbf{n}+1\right)$ – Integer arrayInput

11:   $\mathbf{idiag}\left(\mathbf{n}\right)$ – Integer arrayInput

On entry: the values returned in arrays irow, icol, ipivp, ipivq, istr and idiag by a previous call to f11dnf.

ipivp and ipivq are restored on exit.

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

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

13:   $\mathbf{m}$ – IntegerInput

On entry: if $\mathbf{method}=\text{'RGMRES'}$, m is the dimension of the restart subspace.

If $\mathbf{method}=\text{'BICGSTAB'}$, m is the order $\ell$ of the polynomial Bi-CGSTAB method.

Otherwise, m is not referenced.

Constraints:

• if $\mathbf{method}=\text{'RGMRES'}$, $0<\mathbf{m}\le \min \left(\mathbf{n},50\right)$;
• if $\mathbf{method}=\text{'BICGSTAB'}$, $0<\mathbf{m}\le \min \left(\mathbf{n},10\right)$.

14:   $\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$.

15:   $\mathbf{maxitn}$ – IntegerInput

On entry: the maximum number of iterations allowed.

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

16:   $\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$.

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

On exit: the final value of the residual norm ${‖r_k‖}_{\infty }$, where $k$ is the output value of itn.

18:   $\mathbf{itn}$ – IntegerOutput

On exit: the number of iterations carried out.

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

20:   $\mathbf{lwork}$ – IntegerInput

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

Constraints:

• if $\mathbf{method}=\text{'RGMRES'}$, $\mathbf{lwork}\ge 4\times \mathbf{n}+\mathbf{m}\times \left(\mathbf{m}+\mathbf{n}+5\right)+121$;
• if $\mathbf{method}=\text{'CGS'}$, $\mathbf{lwork}\ge 8\times \mathbf{n}+120$;
• if $\mathbf{method}=\text{'BICGSTAB'}$, $\mathbf{lwork}\ge 2\times \mathbf{n}\times \left(\mathbf{m}+3\right)+\mathbf{m}\times \left(\mathbf{m}+2\right)+120$;
• if $\mathbf{method}=\text{'TFQMR'}$, $\mathbf{lwork}\ge 11\times \mathbf{n}+120$.

21:   $\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{'RGMRES'},\text{'CGS'},\text{'BICGSTAB'}$, or 'TFQMR',
or	$\mathbf{n}<1$,
or	$\mathbf{nnz}<1$,
or	$\mathbf{nnz}>{\mathbf{n}}^2$,
or	$\mathbf{la}<2\times \mathbf{nnz}$,
or	$\mathbf{m}<1$ and $\mathbf{method}=\text{'RGMRES'}$ or $\mathbf{method}=\text{'BICGSTAB'}$,
or	$\mathbf{m}>\min \left(\mathbf{n},50\right)$, with $\mathbf{method}=\text{'RGMRES'}$,
or	$\mathbf{m}>\min \left(\mathbf{n},10\right)$, with $\mathbf{method}=\text{'BICGSTAB'}$,
or	$\mathbf{tol}\ge 1.0$,
or	$\mathbf{maxitn}<1$,
or	lwork too small.

$\mathbf{ifail}=2$

On entry, the CS representation of $A$ is invalid. Further details are given in the error message. Check that the call to f11dqf has been preceded by a valid call to f11dnf, and that the arrays a, irow, and icol have not been corrupted between the two calls.

$\mathbf{ifail}=3$

On entry, the CS representation of the preconditioning matrix $M$ is invalid. Further details are given in the error message. Check that the call to f11dqf has been preceded by a valid call to f11dnf and that the arrays a, irow, icol, ipivp, ipivq, istr and idiag have not been corrupted between the two calls.

$\mathbf{ifail}=4$

The required accuracy could not be obtained. However, a reasonable accuracy may have been obtained, and further iterations could not improve the result. You should check the output value of rnorm for acceptability. This error code usually implies that your problem has been fully and satisfactorily solved to within or close to the accuracy available on your system. Further iterations are unlikely to improve on this situation.

$\mathbf{ifail}=5$

Required accuracy not obtained in maxitn iterations.

$\mathbf{ifail}=6$

Algorithmic breakdown. A solution is returned, although it is possible that it is completely inaccurate.

$\mathbf{ifail}=7$ (f11brf, f11bsf or f11btf)

A serious error has occurred in an internal call to one of the specified routines. Check all subroutine calls and array sizes. Seek expert help.

$\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 (f11dqfe.f90)

10.2

Program Data

Program Data (f11dqfe.d)

10.3

Program Results

Program Results (f11dqfe.r)