F06GTF (ZAXPYI) (PDF version)
F06 Chapter Contents
F06 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

F06GTF (ZAXPYI)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

 Contents

    1  Purpose
    7  Accuracy
    10  Example

1  Purpose

F06GTF (ZAXPYI) adds a scaled sparse complex vector to an unscaled complex vector.

2  Specification

SUBROUTINE F06GTF ( NZ, A, X, INDX, Y)
INTEGER  NZ, INDX(*)
COMPLEX (KIND=nag_wp)  A, X(*), Y(*)
The routine may be called by its BLAS name zaxpyi.

3  Description

F06GTF (ZAXPYI) performs the operation
yαx+y  
where x is a sparse complex vector stored in compressed form, and y is a complex vector in full storage form.

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  Parameters

1:     NZ – INTEGERInput
On entry: the number of nonzeros in the sparse vector x.
2:     A – COMPLEX (KIND=nag_wp)Input
On entry: the scalar α.
3:     X* – COMPLEX (KIND=nag_wp) arrayInput
Note: the dimension of the array X must be at least max1,NZ .
On entry: the compressed vector x. X contains xi for iJ.
4:     INDX* – INTEGER arrayInput
Note: the dimension of the array INDX must be at least max1,NZ .
On entry: the indices of the elements in the compressed vector x.
Constraint: the indices must be distinct.
5:     Y* – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array Y must be at least maxkINDXk .
On entry: the vector y. Only elements corresponding to indices in INDX are accessed.
On exit: the updated vector y.

6  Error Indicators and Warnings

None.

7  Accuracy

Not applicable.

8  Parallelism and Performance

Not applicable.

9  Further Comments

None.

10  Example

None.

F06GTF (ZAXPYI) (PDF version)
F06 Chapter Contents
F06 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2015