f11jrf solves a system of linear equations involving the preconditioning matrix corresponding to SSOR applied to a complex sparse Hermitian matrix, represented in symmetric coordinate storage format.

2 Specification

Fortran Interface

Subroutine f11jrf (

n, nnz, a, irow, icol, rdiag, omega, check, y, x, iwork, ifail)

Integer, Intent (In)	::	n, nnz, irow(nnz), icol(nnz)
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	iwork(n+1)
Real (Kind=nag_wp), Intent (In)	::	rdiag(n), omega
Complex (Kind=nag_wp), Intent (In)	::	a(nnz), y(n)
Complex (Kind=nag_wp), Intent (Out)	::	x(n)
Character (1), Intent (In)	::	check

C Header Interface

#include <nag.h>

void	f11jrf_ (const Integer n, const Integer nnz, const Complex a[], const Integer irow[], const Integer icol[], const double rdiag[], const double omega, const char check, const Complex y[], Complex x[], Integer iwork[], Integer *ifail, const Charlen length_check)

The routine may be called by the names f11jrf or nagf_sparse_complex_herm_precon_ssor_solve.

3 Description

f11jrf solves a system of equations

M x = y

involving the preconditioning matrix

M = \frac{1}{ω (2 - ω)} (D + ω L) D^{- 1} {(D + ω L)}^{H}

corresponding to symmetric successive-over-relaxation (SSOR) (see Young (1971)) on a linear system

A x = b

, where

A

is a sparse complex Hermitian matrix stored in symmetric coordinate storage (SCS) format (see Section 2.1.2 in the F11 Chapter Introduction).

In the definition of

M

given above

D

is the diagonal part of

A

L

is the strictly lower triangular part of

A

and

ω

is a user-defined relaxation parameter. Note that since

A

is Hermitian the matrix

D

is necessarily real.

4 References

Young D (1971) Iterative Solution of Large Linear Systems Academic Press, New York

5 Arguments

1: $n$ – Integer Input

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 1

2: $nnz$ – Integer Input

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

A

Constraint:

1 \leq nnz \leq n \times (n + 1) / 2

3: $a (nnz)$ – Complex (Kind=nag_wp) array Input

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

4: $irow (nnz)$ – Integer array Input

5: $icol (nnz)$ – Integer array Input

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

Constraints:

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

$1 \leq irow (i) \leq n$ and $1 \leq icol (i) \leq irow (i)$ , for $i = 1, 2, \dots, nnz$ ;
$irow (i - 1) < irow (i)$ or $irow (i - 1) = irow (i)$ and $icol (i - 1) < icol (i)$ , for $i = 2, 3, \dots, nnz$ .

6: $rdiag (n)$ – Real (Kind=nag_wp) array Input

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

7: $omega$ – Real (Kind=nag_wp) Input

On entry: the relaxation parameter

ω

Constraint:

0.0 < omega < 2.0

8: $check$ – Character(1) Input

On entry: specifies whether or not the input data should be checked.

$check ='C'$: Checks are carried out on the values of n, nnz, irow, icol and omega.
$check ='N'$: None of these checks are carried out.

Constraint:

check ='C'

'N'

9: $y (n)$ – Complex (Kind=nag_wp) array Input

On entry: the right-hand side vector

y

10: $x (n)$ – Complex (Kind=nag_wp) array Output

On exit: the solution vector

x

11: $iwork (n + 1)$ – Integer array Workspace

12: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

−1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $check = ⟨ value ⟩$ .
Constraint: $check ='C'$ or $'N'$ .

$ifail = 2$: On entry, $n = ⟨ value ⟩$ .
Constraint: $n \geq 1$ .

On entry, $nnz = ⟨ value ⟩$ .
Constraint: $nnz \geq 1$ .

On entry, $nnz = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $nnz \leq n \times (n + 1) / 2$ .

On entry, $omega = ⟨ value ⟩$ .
Constraint: $0.0 < omega < 2.0$ .

$ifail = 3$: On entry, $a (i)$ is out of order: $i = ⟨ value ⟩$ .

On entry, $I = ⟨ value ⟩$ , $icol (I) = ⟨ value ⟩$ , $irow (I) = ⟨ value ⟩$ .
Constraint: $1 \leq icol (i) \leq irow (i)$ .

On entry, $I = ⟨ value ⟩$ , $irow (I) = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: $1 \leq irow (i) \leq n$ .

On entry, the location ( $irow (I), icol (I)$ ) is a duplicate: $I = ⟨ value ⟩$ .
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. Consider calling f11zpf to reorder and sum or remove duplicates.

$ifail = 4$: The matrix $A$ has no diagonal entry in row $⟨ value ⟩$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

The computed solution

x

is the exact solution of a perturbed system of equations

(M + δ M) x = y

, where

| δ M | \leq c (n) ε | D + ω L | | D^{- 1} | | {(D + ω L)}^{T} |,

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

f11jrf is not threaded in any implementation.

9 Further Comments

9.1 Timing

The time taken for a call to f11jrf is proportional to nnz.

10 Example

This example program solves the preconditioning equation

M x = y

for a

9 \times 9

sparse complex Hermitian matrix

A

, given in symmetric coordinate storage (SCS) format.

f11jr: FL CL CPP AD PY MB

NAG FL Interfacef11jrf (complex_​herm_​precon_​ssor_​solve)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

9.1 Timing

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f11jrf (complex_herm_precon_ssor_solve)