Integer, Intent (In)	::	m, n, store
Integer, Intent (Inout)	::	nnz, irow(nnz), icol(nnz), istc(n+1), ifail
Real (Kind=nag_wp), Intent (Inout)	::	a(nnz)
Character (1), Intent (In)	::	dup, zer

C Header Interface

#include <nag.h>

void	f11zcf_ (const Integer m, const Integer n, Integer nnz, double a[], Integer irow[], Integer icol[], Integer istc[], const Integer store, const char dup, const char zer, Integer *ifail, const Charlen length_dup, const Charlen length_zer)

The routine may be called by the names f11zcf or nagf_sparse_real_rect_sort.

3 Description

f11zcf takes a coordinate storage (CS) representation (see Section 2.1.1 in the F11 Chapter Introduction), or compressed column storage (CCS) representation (see Section 2.1.3 in the F11 Chapter Introduction) of a real

m \times n

sparse rectangular matrix

A

, and reorders the nonzero elements by increasing column index and increasing row index within each column.

Entries with duplicate row and column indices may be removed. Alternatively, duplicate entries may be summed, which facilitates sparse matrix addition (see Section 9). Any entries with zero values may optionally be removed.

Both CS and CCS representations of the resulting matrix are output, which allows f11zcf to be used to convert between the two formats (see Section 9).

4 References

None.

5 Arguments

1: $m$ – Integer Input

On entry:

m

, the number of rows in the matrix

A

Constraint:

m \geq 1

2: $n$ – Integer Input

On entry:

n

, the number of columns in the matrix

A

Constraint:

n \geq 1

3: $nnz$ – Integer Input/Output

On entry: the number of elements supplied in the array a.

Constraint:

nnz \geq 0

On exit: the number of elements with unique row and column indices.

4: $a (nnz)$ – Real (Kind=nag_wp) array Input/Output

On entry: the nonzero elements of the matrix

A

. If

store = 1

, the elements may be in any order. If

store = 2

, the elements must be ordered by increasing column index. There may be multiple nonzero elements with the same row and column indices.

On exit: the nonzero elements ordered by increasing column index, and by increasing row index within each column. Each nonzero element has a unique row and column index.

5: $irow (nnz)$ – Integer array Input/Output

On entry: the row indices corresponding to the elements supplied in the array a.

Constraint:

1 \leq irow (i) \leq m

, for

i = 1, 2, \dots, nnz

On exit: the first nnz elements contain the row indices corresponding to the elements returned in the array a.

6: $icol (nnz)$ – Integer array Input/Output

On entry: if

store = 1

, the column indices corresponding to the elements supplied in the array a.

store = 2

, icol need not be set.

Constraint: if

store = 1

1 \leq icol (i) \leq n

, for

i = 1, 2, \dots, nnz

On exit: the first nnz elements contain the column indices corresponding to the elements returned in the array a.

7: $istc (n + 1)$ – Integer array Input/Output

On entry: if

store = 2

, the starting address of each column, as supplied in the array a.

store = 1

, istc need not be set.

Constraints:

store = 2

$istc (1) = 1$ ;
$istc (n + 1) = nnz + 1$ ;
$istc (i) \leq istc (i + 1)$ , for $i = 1, 2, \dots, n$ .

On exit: the starting address of each column, as returned in the array a.

istc (n + 1)

is the address of the last element in a plus one.

8: $store$ – Integer Input

On entry: indicates which storage format the matrix

A

is represented with on entry.

$store = 1$: $A$ is represented in coordinate storage (CS) format using a, irow and icol.
$store = 2$: $A$ is represented in compressed column storage (CCS) format using a, irow and istc.

Constraint:

store = 1

2

9: $dup$ – Character(1) Input

On entry: indicates how elements in a with duplicate row and column indices are to be treated.

$dup ='R'$: Duplicate entries are removed, only the first entry is kept.
$dup ='S'$: The relevant values in a are summed.
$dup ='F'$: The routine fails with $ifail = 12$ on detecting a duplicate.

Constraint:

dup ='R'

'S'

'F'

10: $zer$ – Character(1) Input

On entry: indicates how elements in a with zero values are to be treated.

$zer ='R'$: The entries are removed.
$zer ='K'$: The entries are kept.
$zer ='F'$: The routine fails with $ifail = 13$ on detecting a zero.

Constraint:

zer ='R'

'K'

'F'

11: $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, $m = ⟨ value ⟩$ .
Constraint: $m \geq 1$ .

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

$ifail = 3$: On entry, $nnz = ⟨ value ⟩$ .
Constraint: $nnz \geq 0$ .

$ifail = 4$: On entry, $store = ⟨ value ⟩$ .
Constraint: $store = 1$ or $2$ .

$ifail = 5$: On entry, $dup = ⟨ value ⟩$ .
Constraint: $dup ='R'$ , $'S'$ or $'F'$ .

$ifail = 6$: On entry, $zer = ⟨ value ⟩$ .
Constraint: $zer ='R'$ , $'K'$ or $'F'$ .

$ifail = 7$: On entry, $i = ⟨ value ⟩$ , $irow (i) = ⟨ value ⟩$ and $m = ⟨ value ⟩$ .
Constraint: $1 \leq irow (i) \leq m$ .

$ifail = 8$: On entry, $i = ⟨ value ⟩$ , $icol (i) = ⟨ value ⟩$ and $n = ⟨ value ⟩$ .
Constraint: if $store = 1$ , then $1 \leq icol (i) \leq n$ .

$ifail = 9$: On entry, $istc (1) = ⟨ value ⟩$ .
Constraint: $istc (1) = 1$ .

$ifail = 10$: On entry, $i = ⟨ value ⟩$ , $istc (i) = ⟨ value ⟩$ and $istc (i + 1) = ⟨ value ⟩$ .
Constraint: $istc (i) \leq istc (i + 1)$ , for $i = 1, 2, \dots, n$

$ifail = 11$: On entry, $n = ⟨ value ⟩$ , $istc (n + 1) = ⟨ value ⟩$ and $nnz = ⟨ value ⟩$ .
Constraint: $istc (n + 1) = nnz + 1$ .

$ifail = 12$: On entry, a duplicate entry has been found in row $⟨ value ⟩$ and column $⟨ value ⟩$ .

$ifail = 13$: On entry, a zero entry has been found in row $⟨ value ⟩$ and column $⟨ 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

Not applicable.

8 Parallelism and Performance

f11zcf is not threaded in any implementation.

9 Further Comments

Note that the resulting matrix may have either rows or columns with no entries. If column

i

has no entries then

istc (i) = istc (i + 1)

To transpose a matrix in CS format simply interchange irow and icol, and m and n. If you need the elements to be sorted, then pass these interchanged arrays to f11zcf.

Two sparse matrices can be added by concatenating the three pairs of CS format arrays, representing the two matrices, and passing these new arrays to f11zcf, specifying that duplicates should be summed. This functionality is illustrated in Section 10.

This routine can be used to convert between CS and CCS formats. Use either format to pass

A

into f11zcf, with the appropriate store set. The resulting matrix is output in both formats using a, irow, icol (for CS format) and istc (for CCS format). This is illustrated in Section 10.

10 Example

This example reads the CS representation of the real sparse matrices

B

and

C

, and finds their sum,

A

, displaying the ordered elements in both CS and CCS format. The order of rows within some columns of

A

are changed, and the matrix is input in CCS format to be re-sorted. The CS format is output to compare to the previous result. The matrix

A

is also sorted into row-major order by passing its transpose to f11zcf.

B = (\begin{matrix} 2.00 & 1.00 & 0 & 0 \\ 0 & 0 & 1.00 & - 1.00 \\ 4.00 & 0 & 1.00 & 0 \end{matrix}) and C = (\begin{matrix} 4.00 & 0 & 2.00 & 0 \\ 0 & - 1.00 & 0 & 1.00 \\ 0 & 0 & 0 & 2.00 \end{matrix}) .

f11zc: FL CL CPP AD

NAG FL Interfacef11zcf (real_​rect_​sort)

▸▿ 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
f11zcf (real_rect_sort)