csc_zusmm csc_zusmv csc_zussm csc_zussv csr_zusmm csr_zusmv csr_zussm csr_zussv hsc_zusmv hsr_zusmv ssc_zusmv ssr_zusmv

ssr_zusmv() void ssr_zusmv ( char  uplo, int  n, doublecomplex  alpha, const doublecomplex  val[], const int  rowptr[], const int  colind[], int  base, const doublecomplex  x[], int  incx, doublecomplex  beta, doublecomplex  y[], int  incy, int *  info  ) y <- αAx + βy (Complex symmetric matrices) (CSR) Purpose This function performs the following matrix-vector operation for a complex symmetric sparse matrix A in CSR format. y <- αAx + βy where α and β are scalars, x and y are vectors. A is an n x n complex symmetric sparse matrix. The order of elements in each row of input matrix A must be ascending order of column index. The triangular elements (not including diagonal elements) other than specified by uplo will be ignored. Parameters [in] uplo Specifies whether the upper or lower triangular part of input matrix A is stored. = 'U': Upper triangular part. = 'L': Lower triangular part. [in] n Number of rows and columns of matrix A. (n >= 0) (If n = 0, returns without computation) [in] alpha Scalar α [in] val[] Array val[lval] (lval >= nnz) Values of nonzero elements of matrix A (where nnz is the number of nonzero elements). [in] rowptr[] Array rowptr[lrowptr] (lrowptr >= n + 1) Row pointers of matrix A. [in] colind[] Array colind[lcolind] (lcolind >= nnz) Column indices of matrix A (where nnz is the number of nonzero elements). [in] base Indexing of rowptr[] and colind[]. = 0: Zero-based (C style) indexing: Starting index is 0. = 1: One-based (Fortran style) indexing: Starting index is 1. [in] x[] Array x[lx] (lx >= 1 + (n - 1)*|incx|) Vector x. [in] incx Storage spacing between elements of x[]. [in] beta Scalar β. [in,out] y[] Array y[ly] (ly >= 1 + (m - 1)*|incy|) [in] Input vector y (If beta is supplied as zero, y[] needs not be set on input). [out] Output vector. (= αAx + βy) [in] incy Storage spacing between elements of y[]. [out] info = 0: Successful exit. = i < 0: The (-i)-th argument is invalid.