f11dxf computes the approximate solution of a complex, Hermitian or non-Hermitian, sparse system of linear equations applying a number of Jacobi iterations. It is expected that f11dxf will be used as a preconditioner for the iterative solution of complex sparse systems of equations.

2

Specification

Fortran Interface

Subroutine f11dxf (

store, trans, init, niter, n, nnz, a, irow, icol, check, b, x, diag, work, ifail)

Integer, Intent (In)	::	niter, n, nnz, irow(nnz), icol(nnz)
Integer, Intent (Inout)	::	ifail
Complex (Kind=nag_wp), Intent (In)	::	a(nnz), b(n)
Complex (Kind=nag_wp), Intent (Inout)	::	diag(n)
Complex (Kind=nag_wp), Intent (Out)	::	x(n), work(n)
Character (1), Intent (In)	::	store, trans, init, check

C Header Interface

#include nagmk26.h

void

f11dxf_ ( const char *store, const char *trans, const char *init, const Integer *niter, const Integer *n, const Integer *nnz, const Complex a[], const Integer irow[], const Integer icol[], const char *check, const Complex b[], Complex x[], Complex diag[], Complex work[], Integer *ifail, const Charlen length_store, const Charlen length_trans, const Charlen length_init, const Charlen length_check)

3

Description

f11dxf computes the approximate solution of the complex sparse system of linear equations

A x = b

using niter iterations of the Jacobi algorithm (see also Golub and Van Loan (1996) and Young (1971)):

x_{k + 1} = x_{k} + D^{- 1} (b - A x_{k})

(1)

where

k = 1, 2, \dots, niter

and

x_{0} = 0

f11dxf can be used both for non-Hermitian and Hermitian systems of equations. For Hermitian matrices, either all nonzero elements of the matrix

A

can be supplied using coordinate storage (CS), or only the nonzero elements of the lower triangle of

A

, using symmetric coordinate storage (SCS) (see the F11 Chapter Introduction).

It is expected that f11dxf will be used as a preconditioner for the iterative solution of complex sparse systems of equations, using either the suite comprising the routines f11grf, f11gsf and f11gtf, for Hermitian systems, or the suite comprising the routines f11brf, f11bsf and f11btf, for non-Hermitian systems of equations.

4

References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

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

5

Arguments

1: $store$ – Character(1)Input

On entry: specifies whether the matrix

A

is stored using symmetric coordinate storage (SCS) (applicable only to a Hermitian matrix

A

) or coordinate storage (CS) (applicable to both Hermitian and non-Hermitian matrices).

$store ='N'$: The complete matrix $A$ is stored in CS format.
$store ='S'$: The lower triangle of the Hermitian matrix $A$ is stored in SCS format.

Constraint:

store ='N'

'S'

2: $trans$ – Character(1)Input

On entry: if

store ='N'

, specifies whether the approximate solution of

A x = b

or of

A^{H} x = b

is required.

$trans ='N'$: The approximate solution of $A x = b$ is calculated.
$trans ='T'$: The approximate solution of $A^{H} x = b$ is calculated.

Suggested value: if the matrix

A

is Hermitian and stored in CS format, it is recommended that

trans ='N'

for reasons of efficiency.

Constraint:

trans ='N'

'T'

3: $init$ – Character(1)Input

On entry: on first entry, init should be set to 'I', unless the diagonal elements of

A

are already stored in the array diag. If diag already contains the diagonal of

A

, it must be set to 'N'.

$init ='N'$: diag must contain the diagonal of $A$ .
$init ='I'$: diag will store the diagonal of $A$ on exit.

Suggested value:

init ='I'

on first entry;

init ='N'

, subsequently, unless diag has been overwritten.

Constraint:

init ='N'

'I'

4: $niter$ – IntegerInput

On entry: the number of Jacobi iterations requested.

Constraint:

niter \geq 1

5: $n$ – IntegerInput

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 1

6: $nnz$ – IntegerInput

On entry: if

store ='N'

, the number of nonzero elements in the matrix

A

store ='S'

, the number of nonzero elements in the lower triangle of the matrix

A

Constraints:

if $store ='N'$ , $1 \leq nnz \leq n^{2}$ ;
if $store ='S'$ , $1 \leq nnz \leq n \times (n + 1) / 2$ .

7: $a (nnz)$ – Complex (Kind=nag_wp) arrayInput

On entry: if

store ='N'

, the nonzero elements in the matrix

A

(CS format).

store ='S'

, the nonzero elements in the lower triangle of the matrix

A

(SCS format).

In both cases, the elements of either

A

or of its lower triangle must be ordered by increasing row index and by increasing column index within each row. Multiple entries for the same row and columns indices are not permitted. The routine f11znf or f11zpf may be used to reorder the elements in this way for CS and SCS storage, respectively.

8: $irow (nnz)$ – Integer arrayInput

9: $icol (nnz)$ – Integer arrayInput

On entry: if

store ='N'

, the row and column indices of the nonzero elements supplied in a.

store ='S'

, the row and column indices of the nonzero elements of the lower triangle of the matrix

A

supplied in a.

Constraints:

$1 \leq irow (i) \leq n$ , for $i = 1, 2, \dots, nnz$ ;
if $store ='N'$ , $1 \leq icol (i) \leq n$ , for $i = 1, 2, \dots, nnz$ ;
if $store ='S'$ , $1 \leq icol (i) \leq irow (i)$ , for $i = 1, 2, \dots, nnz$ ;
either $irow (i - 1) < irow (i)$ or both $irow (i - 1) = irow (i)$ and $icol (i - 1) < icol (i)$ , for $i = 2, 3, \dots, nnz$ .

10: $check$ – Character(1)Input

On entry: specifies whether or not the CS or SCS representation of the matrix

A

should be checked.

$check ='C'$: Checks are carried out on the values of n, nnz, irow, icol; if $init ='N'$ , diag is also checked.
$check ='N'$: None of these checks are carried out.

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,	$store \neq'N'$ or $'S'$ ,
or	$trans \neq'N'$ or $'T'$ ,
or	$init \neq'N'$ or $'I'$ ,
or	$check \neq'C'$ or $'N'$ ,
or	$niter \leq 0$ .

$ifail = 2$

On entry,	$n < 1$ ,
or	$nnz < 1$ ,
or	$nnz > n^{2}$ , if $store ='N'$ ,
or	$1 \leq nnz \leq [n (n + 1)] / 2$ , if $store ='S'$ .

$ifail = 3$

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

1≤irowi≤n and
- if $store ='N'$ then $1 \leq icol (i) \leq n$ , or
- if $store ='S'$ then $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$ .

Therefore a nonzero element has been supplied which does not lie within the matrix

A

, is out of order, or has duplicate row and column indices. Call either f11zaf or f11zbf to reorder and sum or remove duplicates when

store ='N'

store ='S'

, respectively.

$ifail = 4$: On entry, $init ='N'$ and some diagonal elements of $A$ stored in diag are zero.

$ifail = 5$: On entry, $init ='I'$ and some diagonal elements of $A$ are zero.

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

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

$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

In general, the Jacobi method cannot be used on its own to solve systems of linear equations. The rate of convergence is bound by its spectral properties (see, for example, Golub and Van Loan (1996)) and as a solver, the Jacobi method can only be applied to a limited set of matrices. One condition that guarantees convergence is strict diagonal dominance.

However, the Jacobi method can be used successfully as a preconditioner to a wider class of systems of equations. The Jacobi method has good vector/parallel properties, hence it can be applied very efficiently. Unfortunately, it is not possible to provide criteria which define the applicability of the Jacobi method as a preconditioner, and its usefulness must be judged for each case.

8

Parallelism and Performance

f11dxf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f11dxf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

9.1

Timing

The time taken for a call to f11dxf is proportional to

niter \times nnz

9.2

Use of check

It is expected that a common use of f11dxf will be as preconditioner for the iterative solution of complex, Hermitian or non-Hermitian, linear systems. In this situation, f11dxf is likely to be called many times. In the interests of both reliability and efficiency, you are recommended to set

check ='C'

for the first of such calls, and to set

check ='N'

for all subsequent calls.

10

Example

This example solves the complex sparse non-Hermitian system of equations

A x = b

iteratively using f11dxf as a preconditioner.

NAG Library Routine Document

f11dxf (complex_gen_precon_jacobi)

▸▿ 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

9.2 Use of check

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

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

9.2

Use of check

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results