F11XEF computes a matrix-vector product involving a real sparse symmetric matrix stored in symmetric coordinate storage format.
F11XEF computes the matrix-vector product
where
is an
by
symmetric 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 nonzero elements in the lower triangular part of
, while arrays
IROW and
ICOL store the corresponding row and column indices respectively.
It is envisaged that a common use of F11XEF will be to compute the matrix-vector product required in the application of
F11GEF to sparse symmetric linear systems. An illustration of this usage appears in
F11JDF.
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
where
is a modest linear function of
, and
is the
machine precision.
F11XEF is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
F11XEF 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.
The time taken for a call to F11XEF is proportional to
NNZ.
It is expected that a common use of F11XEF will be to compute the matrix-vector product required in the application of
F11GEF to sparse symmetric linear systems. In this situation F11XEF 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.