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

C Header Interface

#include nagmk26.h

void	f11xsf_ ( const Integer n, const Integer nnz, const Complex a[], const Integer irow[], const Integer icol[], const char check, const Complex x[], Complex y[], Integer ifail, const Charlen length_check)

3

Description

f11xsf computes the matrix-vector product

y = A x

where

A

is an

n

n

complex Hermitian sparse matrix, of arbitrary sparsity pattern, stored in symmetric coordinate storage (SCS) format (see Section 2.1.2 in the F11 Chapter Introduction). The array a stores all the nonzero elements in the lower triangular part of

A

, while arrays irow and icol store the corresponding row and column indices respectively.

4

References

None.

5

Arguments

1: $n$ – IntegerInput

On entry:

n

, the order of the matrix

A

Constraint:

n \geq 1

2: $nnz$ – IntegerInput

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) arrayInput

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 arrayInput

5: $icol (nnz)$ – Integer arrayInput

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: $check$ – Character(1)Input

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

A

, values of n, nnz, irow and icol should be checked.

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

Constraint:

check ='C'

'N'

7: $x (n)$ – Complex (Kind=nag_wp) arrayInput

On entry: the vector

x

8: $y (n)$ – Complex (Kind=nag_wp) arrayOutput

On exit: the vector

y

9: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ 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 ​ 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,

check \neq'C'

'N'

$ifail = 2$

On entry,	$n < 1$ ,
or	$nnz < 1$ ,
or	$nnz > n \times (n + 1) / 2$ .

$ifail = 3$

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

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

Therefore 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. Call f11zpf to reorder and sum or remove duplicates.

$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

The computed vector

y

satisfies the error bound

{‖y - A x‖}_{\infty} \leq c (n) ε {‖A‖}_{\infty} {‖x‖}_{\infty},

where

c (n)

is a modest linear function of

n

, and

ε

is the machine precision.

8

Parallelism and Performance

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

f11xsf 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 f11xsf is proportional to nnz.

10

Example

This example reads in a complex sparse Hermitian positive definite matrix

A

and a vector

x

. It then calls f11xsf to compute the matrix-vector product

y = A x

NAG Library Routine Document

f11xsf (complex_herm_matvec)

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

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