naginterfaces.library.sparse.complex_​herm_​matvec

naginterfaces.library.sparse.complex_herm_matvec(a, irow, icol, x, check='N')

complex_herm_matvec computes a matrix-vector product involving a complex sparse Hermitian matrix stored in symmetric coordinate storage format.

For full information please refer to the NAG Library document for f11xs

https://support.nag.com/numeric/nl/nagdoc_30.1/flhtml/f11/f11xsf.html

Parameters

acomplex, array-like, shape $\left(\text{nnz}\right)$

The nonzero elements in the lower triangular part of the matrix $A$, ordered by increasing row index, and by increasing column index within each row. Multiple entries for the same row and column indices are not permitted. The function complex_herm_sort() may be used to order the elements in this way.

irowint, array-like, shape $\left(\text{nnz}\right)$

The row indices of the nonzero elements supplied in array $a$.

icolint, array-like, shape $\left(\text{nnz}\right)$

The column indices of the nonzero elements supplied in array $a$.

xcomplex, array-like, shape $\left(n\right)$

The vector $x$.

checkstr, length 1, optional

Specifies whether or not the SCS representation of the matrix $A$, values of $\text{n}$, $\text{nnz}$, $irow$ and $icol$ should be checked.

$check=\text{'C'}$

Checks are carried out on the values of $\text{n}$, $\text{nnz}$, $irow$ and $icol$.

$check=\text{'N'}$

None of these checks are carried out.

Returns

ycomplex, ndarray, shape $\left(n\right)$

The vector $y$.

Raises

NagValueError

(errno $1$)

On entry, $check=⟨value⟩$.

Constraint: $check=\text{'C'}$ or $\text{'N'}$.

(errno $2$)

On entry, $\text{nnz}=⟨value⟩$ and $n=⟨value⟩$.

Constraint: $\text{nnz}\le n\times (n+1)/2$.

(errno $2$)

On entry, $\text{nnz}=⟨value⟩$.

Constraint: $\text{nnz}\ge 1$.

(errno $2$)

On entry, $n=⟨value⟩$.

Constraint: $n\ge 1$.

(errno $3$)

On entry, the location ($irow[\text{I}-1],icol[\text{I}-1]$) is a duplicate: $\text{I}=⟨value⟩$.

(errno $3$)

On entry, $a[i-1]$ is out of order: $i=⟨value⟩$.

(errno $3$)

On entry, $\text{I}=⟨value⟩$, $icol[\text{I}-1]=⟨value⟩$ and $irow[\text{I}-1]=⟨value⟩$.

Constraint: $icol[\text{I}-1]\ge 1$ and $icol[\text{I}-1]\le irow[\text{I}-1]$.

(errno $3$)

On entry, $i=⟨value⟩$, $irow[i-1]=⟨value⟩$ and $n=⟨value⟩$.

Constraint: $irow[i-1]\ge 1$ and $irow[i-1]\le n$.

Notes

complex_herm_matvec computes the matrix-vector product

$$y=Ax$$

where $A$ is an $n\times n$ complex Hermitian sparse matrix, of arbitrary sparsity pattern, stored in symmetric coordinate storage (SCS) format (see the F11 Introduction). The array $a$ stores all the nonzero elements in the lower triangular part of $A$, while arrays $irow$ and $icol$ store the corresponding row and column indices respectively.