f11jsf solves a complex sparse Hermitian system of linear equations, represented in symmetric coordinate storage format, using a conjugate gradient or Lanczos method, without preconditioning, with Jacobi or with SSOR preconditioning.

2 Specification

Fortran Interface

Subroutine f11jsf (

method, precon, n, nnz, a, irow, icol, omega, b, tol, maxitn, x, rnorm, itn, rdiag, work, lwork, iwork, ifail)

Integer, Intent (In)	::	n, nnz, irow(nnz), icol(nnz), maxitn, lwork
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	itn, iwork(n+1)
Real (Kind=nag_wp), Intent (In)	::	omega, tol
Real (Kind=nag_wp), Intent (Out)	::	rnorm, rdiag(n)
Complex (Kind=nag_wp), Intent (In)	::	a(nnz), b(n)
Complex (Kind=nag_wp), Intent (Inout)	::	x(n)
Complex (Kind=nag_wp), Intent (Out)	::	work(lwork)
Character (*), Intent (In)	::	method
Character (1), Intent (In)	::	precon

C Header Interface

#include <nag.h>

void

f11jsf_ (const char *method, const char *precon, const Integer *n, const Integer *nnz, const Complex a[], const Integer irow[], const Integer icol[], const double *omega, const Complex b[], const double *tol, const Integer *maxitn, Complex x[], double *rnorm, Integer *itn, double rdiag[], Complex work[], const Integer *lwork, Integer iwork[], Integer *ifail, const Charlen length_method, const Charlen length_precon)

The routine may be called by the names f11jsf or nagf_sparse_complex_herm_solve_jacssor.

3 Description

f11jsf solves a complex sparse Hermitian linear system of equations

A x = b,

using a preconditioned conjugate gradient method (see Barrett et al. (1994)), or a preconditioned Lanczos method based on the algorithm SYMMLQ (see Paige and Saunders (1975)). The conjugate gradient method is more efficient if

A

is positive definite, but may fail to converge for indefinite matrices. In this case the Lanczos method should be used instead. For further details see Barrett et al. (1994).

f11jsf allows the following choices for the preconditioner:

–no preconditioning;
–Jacobi preconditioning (see Young (1971));
–symmetric successive-over-relaxation (SSOR) preconditioning (see Young (1971)).

For incomplete Cholesky (IC) preconditioning see f11jqf.

The matrix

A

is represented in symmetric coordinate storage (SCS) format (see Section 2.1.2 in the F11 Chapter Introduction) in the arrays a, irow and icol. The array a holds the nonzero entries in the lower triangular part of the matrix, while irow and icol hold the corresponding row and column indices.

4 References

Barrett R, Berry M, Chan T F, Demmel J, Donato J, Dongarra J, Eijkhout V, Pozo R, Romine C and Van der Vorst H (1994) Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods SIAM, Philadelphia

Paige C C and Saunders M A (1975) Solution of sparse indefinite systems of linear equations SIAM J. Numer. Anal. 12 617–629

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

5 Arguments

1: $method$ – Character(*) Input

On entry: specifies the iterative method to be used.

$method ='CG'$: Conjugate gradient method.
$method ='SYMMLQ'$: Lanczos method (SYMMLQ).

Constraint:

method ='CG'

'SYMMLQ'

2: $precon$ – Character(1) Input

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

$precon ='N'$: No preconditioning.
$precon ='J'$: Jacobi.
$precon ='S'$: Symmetric successive-over-relaxation (SSOR).

Constraint:

precon ='N'

'J'

'S'

3: $n$ – Integer Input

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 1

4: $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

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

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: $irow (nnz)$ – Integer array Input

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

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

On entry: if

precon ='S'

, omega is the relaxation parameter

ω

to be used in the SSOR method. Otherwise omega need not be initialized.

Constraint:

0.0 < omega < 2.0

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

On entry: the right-hand side vector

b

10: $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

{‖r_{k}‖}_{\infty} \leq τ \times ({‖b‖}_{\infty} + {‖A‖}_{\infty} {‖x_{k}‖}_{\infty}) .

tol \leq 0.0

τ = \max \sqrt{ε}, 10 ε, \sqrt{n} ε

is used, where

ε

is the machine precision. Otherwise

τ = \max (tol, 10 ε, \sqrt{n} ε)

is used.

Constraint:

tol < 1.0

11: $maxitn$ – Integer Input

On entry: the maximum number of iterations allowed.

Constraint:

maxitn \geq 1

12: $x (n)$ – Complex (Kind=nag_wp) array Input/Output

On entry: an initial approximation to the solution vector

x

On exit: an improved approximation to the solution vector

x

13: $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: $itn$ – Integer Output

On exit: the number of iterations carried out.

15: $rdiag (n)$ – Real (Kind=nag_wp) array Output

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: $work (lwork)$ – Complex (Kind=nag_wp) array Workspace

17: $lwork$ – Integer Input

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

Constraints:

if $method ='CG'$ , $lwork \geq 6 \times n + 120$ ;
if $method ='SYMMLQ'$ , $lwork \geq 7 \times n + 120$ .

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

19: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

- 1 or 1

. If you are unfamiliar with this argument you should refer to Section 4 in the Introduction to the NAG Library FL Interface for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 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 $- 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, lwork is too small: $lwork = 〈value〉$ . Minimum required value of $lwork = 〈value〉$ .

On entry, $maxitn = 〈value〉$ .
Constraint: $maxitn \geq 1$ .

On entry, $method \neq'CG'$ or $'SYMMLQ'$ : $method = 〈value〉$ .

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

On entry, $precon \neq'N'$ , $'J'$ or $'S'$ : $precon = 〈value〉$ .

On entry, $tol = 〈value〉$ .
Constraint: $tol < 1.0$ .

$ifail = 2$: On entry, $a (i)$ is out of order: $i = 〈value〉$ .

On entry, $I = 〈value〉$ , $icol (I) = 〈value〉$ and $irow (I) = 〈value〉$ .
Constraint: $icol (I) \geq 1$ and $icol (I) \leq irow (I)$ .

On entry, $i = 〈value〉$ , $irow (i) = 〈value〉$ and $n = 〈value〉$ .
Constraint: $irow (i) \geq 1$ and $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 = 3$: The matrix $A$ has a zero diagonal entry in row $〈value〉$ .

The matrix $A$ has no diagonal entry in row $〈value〉$ .

$ifail = 4$: The required accuracy could not be obtained. However, a reasonable accuracy has been achieved and further iterations could not improve the result.

$ifail = 5$: The solution has not converged after $〈value〉$ iterations.

$ifail = 6$: The preconditioner appears not to be positive definite. The computation cannot continue.

$ifail = 7$: The matrix of the coefficients a appears not to be positive definite. The computation cannot continue.

$ifail = 8$: A serious error, code $〈value〉$ , has occurred in an internal call. Check all subroutine calls and array sizes. Seek expert help.

$ifail = 9$: The matrix $A$ has a non-real 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

On successful termination, the final residual

r_{k} = b - A x_{k}

, where

k = itn

, satisfies the termination criterion

{‖r_{k}‖}_{\infty} \leq τ \times ({‖b‖}_{\infty} + {‖A‖}_{\infty} {‖x_{k}‖}_{\infty}) .

The value of the final residual norm is returned in rnorm.

8 Parallelism and Performance

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

f11jsf 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

The time taken by f11jsf for each iteration is roughly proportional to nnz. One iteration with the Lanczos method (SYMMLQ) requires a slightly larger number of operations than one iteration with the conjugate gradient method.

The number of iterations required to achieve a prescribed accuracy cannot easily be determined a priori, as it can depend dramatically on the conditioning and spectrum of the preconditioned matrix of the coefficients

\bar{A} = M^{- 1} A

10 Example

This example solves a complex sparse Hermitian positive definite system of equations using the conjugate gradient method, with SSOR preconditioning.

Interfaces: FL CL AD

NAG FL Interface Introduction

F11 (Sparse) Chapter Contents

F11 (Sparse) Chapter Introduction

f11js: FL CL AD

NAG FL Interfacef11jsf (complex_​herm_​solve_​jacssor)

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

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f11jsf (complex_herm_solve_jacssor)