This manual relates to an old release of the Library.
The documentation for the current release is also available on this site.

NAG FL Interface
f06evf (dgthrz)

Settings help

FL Name Style:


FL Specification Language:


1 Purpose

f06evf gathers specified (usually nonzero) elements of a real vector y in full storage form into a sparse real vector x in compressed form. The specified elements of y are set to zero.

2 Specification

Fortran Interface
Subroutine f06evf ( nz, y, x, indx)
Integer, Intent (In) :: nz, indx(*)
Real (Kind=nag_wp), Intent (Inout) :: y(*), x(*)
C Header Interface
#include <nag.h>
void  f06evf_ (const Integer *nz, double y[], double x[], const Integer indx[])
The routine may be called by the names f06evf, nagf_blas_dgthrz or its BLAS name dgthrz.

3 Description

f06evf gathers the specified elements of a vector, y, in full storage form, into the equivalent sparse vector compressed form. The gathered elements of y are set to zero.

4 References

Dodson D S, Grimes R G and Lewis J G (1991) Sparse extensions to the Fortran basic linear algebra subprograms ACM Trans. Math. Software 17 253–263

5 Arguments

1: nz Integer Input
On entry: the number of nonzeros in the compressed sparse vector x.
2: y(*) Real (Kind=nag_wp) array Input/Output
Note: the dimension of the array y must be at least maxk{indx(k)} .
On entry: the vector y. Only elements corresponding to indices in indx are accessed.
On exit: the elements of y corresponding to indices in indx are set to zero.
3: x(*) Real (Kind=nag_wp) array Output
Note: the dimension of the array x must be at least max(1,nz).
On exit: the compressed vector x.
4: indx(*) Integer array Input
Note: the dimension of the array indx must be at least max(1,nz) .
On entry: indx(i) must contain the index y(i), for i=1,2,,nz, which is to be gathered into x.
Constraint: the indices must be distinct.

6 Error Indicators and Warnings

None.

7 Accuracy

Not applicable.

8 Parallelism and Performance

f06evf is not threaded in any implementation.

9 Further Comments

None.

10 Example

None.