f11xaf computes either the matrix-vector product
, or the transposed matrix-vector product
, according to the value of the argument
trans, where
is an
sparse nonsymmetric 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 nonzero elements of
, while arrays
irow and
icol store the corresponding row and column indices respectively.
It is envisaged that a common use of
f11xaf will be to compute the matrix-vector product required in the application of
f11bef to sparse linear systems. An illustration of this usage appears in
Section 10 in
f11ddf.
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.
Background information to multithreading can be found in the
Multithreading documentation.
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.
The time taken for a call to
f11xaf is proportional to
nnz.
It is expected that a common use of
f11xaf will be to compute the matrix-vector product required in the application of
f11bef to sparse linear systems. In this situation
f11xaf 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.