NAG Library Routine Document

f11def (real_gen_solve_jacssor)

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

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

On entry: 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{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.

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 matrix $A$.

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

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

On entry: the nonzero elements 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 f11zaf 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 a.

Constraints:

irow and icol must satisfy the following constraints (which may be imposed by a call to f11zaf):

• $1\le \mathbf{irow}\left(\mathit{i}\right)\le \mathbf{n}$ and $1\le \mathbf{icol}\left(\mathit{i}\right)\le \mathbf{n}$, 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 and is not referenced.

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

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

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

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

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

12:   $\mathbf{maxitn}$ – IntegerInput

On entry: the maximum number of iterations allowed.

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

13:   $\mathbf{x}\left(\mathbf{n}\right)$ – Real (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$.

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

15:   $\mathbf{itn}$ – IntegerOutput

On exit: the number of iterations carried out.

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

17:   $\mathbf{lwork}$ – IntegerInput

On entry: the dimension of the array work as declared in the (sub)program from which f11def 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)+\mathit{\nu }+101$;
• if $\mathbf{method}=\text{'CGS'}$, $\mathbf{lwork}\ge 8\times \mathbf{n}+\mathit{\nu }+100$;
• 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)+\mathit{\nu }+100$;
• if $\mathbf{method}=\text{'TFQMR'}$, $\mathbf{lwork}\ge 11\times \mathbf{n}+\mathit{\nu }+100$.

where $\mathit{\nu }=\mathbf{n}$ for $\mathbf{precon}=\text{'J'}$ or $\text{'S'}$, and $0$ otherwise

18:   $\mathbf{iwork}\left(2\times \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, lwork is too small: $\mathbf{lwork}=〈\mathit{\text{value}}〉$. Minimum required value of $\mathbf{lwork}=〈\mathit{\text{value}}〉$.

On entry, $\mathbf{m}=〈\mathit{\text{value}}〉$ and $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{m}\ge 1$ and $\mathbf{m}\le \mathrm{MIN}\left(\mathbf{n},〈\mathit{\text{value}}〉\right)$.

On entry, $\mathbf{maxitn}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{maxitn}\ge 1$.

On entry, $\mathbf{method}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{method}=\text{'RGMRES'}$, $\text{'CGS'}$ or $\text{'BICGSTAB'}$.

On entry, $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{n}\ge 1$.

On entry, $\mathbf{nnz}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{nnz}\ge 1$.

On entry, $\mathbf{nnz}=〈\mathit{\text{value}}〉$ and $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{nnz}\le {\mathbf{n}}^2$.

On entry, $\mathbf{omega}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{omega}>0.0$ and $\mathbf{omega}<2.0$.

On entry, $\mathbf{precon}\ne \text{'N'}$, $\text{'J'}$ or $\text{'S'}$: $\mathbf{precon}=〈\mathit{\text{value}}〉$.

On entry, $\mathbf{tol}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{tol}<1.0$.

$\mathbf{ifail}=2$

On entry, $\mathbf{a}\left(i\right)$ is out of order: $i=〈\mathit{\text{value}}〉$.

On entry, $i=〈\mathit{\text{value}}〉$, $\mathbf{icol}\left(i\right)=〈\mathit{\text{value}}〉$ and $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{icol}\left(i\right)\ge 1$ and $\mathbf{icol}\left(i\right)\le \mathbf{n}$.

On entry, $i=〈\mathit{\text{value}}〉$, $\mathbf{irow}\left(i\right)=〈\mathit{\text{value}}〉$ and $\mathbf{n}=〈\mathit{\text{value}}〉$.
Constraint: $\mathbf{irow}\left(i\right)\ge 1$ and $\mathbf{irow}\left(i\right)\le \mathbf{n}$.

On entry, the location ($\mathbf{irow}\left(\mathit{I}\right),\mathbf{icol}\left(\mathit{I}\right)$) is a duplicate: $\mathit{I}=〈\mathit{\text{value}}〉$.

$\mathbf{ifail}=3$

The matrix $A$ has a zero diagonal entry in row $〈\mathit{\text{value}}〉$.

The matrix $A$ has no diagonal entry in row $〈\mathit{\text{value}}〉$.

Jacobi and SSOR preconditioners are not appropriate for this problem.

$\mathbf{ifail}=4$

The required accuracy could not be obtained. However, a reasonable accuracy may have been achieved.

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$

The solution has not converged after $〈\mathit{\text{value}}〉$ iterations.

$\mathbf{ifail}=6$

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

$\mathbf{ifail}=7$

A serious error has occurred in an internal call: $\mathbf{ifail}=〈\mathit{\text{value}}〉$. Check all subroutine calls and array sizes. Seek expert help.

A serious error has occurred in an internal call: $\mathrm{IREVCM}=〈\mathit{\text{value}}〉$. 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 (f11defe.f90)

10.2

Program Data

Program Data (f11defe.d)

10.3

Program Results

Program Results (f11defe.r)