F11XNF computes a matrix-vector or conjugate transposed matrix-vector product involving a complex sparse non-Hermitian matrix stored in coordinate storage format.
F11XNF computes either the matrix-vector product
, or the conjugate transposed matrix-vector product
, according to the value of the argument
TRANS, where
is a complex
by
sparse non-Hermitian matrix, of arbitrary sparsity pattern. The matrix
is stored in coordinate storage (CS) format (see
Section 2.1.1 in the F11 Chapter Introduction). The array
A stores all the nonzero elements of
, while arrays
IROW and
ICOL store the corresponding row and column indices respectively.
It is envisaged that a common use of F11XNF will be to compute the matrix-vector product required in the application of
F11BSF to sparse complex linear systems. This is illustrated in
Section 9 in F11DRF.
None.
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
The computed vector
satisfies the error bound:
- , if , or
- ,
if ,
where
is a modest linear function of
, and
is the
machine precision.
The time taken for a call to F11XNF is proportional to
NNZ.
It is expected that a common use of F11XNF will be to compute the matrix-vector product required in the application of
F11BSF to sparse complex linear systems. In this situation F11XNF is likely to be called many times with the same matrix
. In the interests of both reliability and efficiency you are recommended to set
for the first of such calls, and to set
for all subsequent calls.