![]() |
SenK
SenK is a C++ library for high-performance linear solvers.
|
Functions related to sparse matrices are written. More...
Go to the source code of this file.
Namespaces | |
namespace | senk |
The top-level namespace of SenK. | |
namespace | senk::sparse |
Functions related to sparse matrices and sparse vectors are defined. | |
Functions | |
template<typename T > | |
void | senk::sparse::SpmvCsr (T *val, int *cind, int *rptr, T *x, T *y, int N) |
Perform SpMV using the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SpmvCsr (T *val, int *cind, int *rptr, T *diag, T *x, T *y, int N) |
Perform SpMV using the CSR format, which stores diagonal elements separately. More... | |
template<typename T , int bnl, int bnw> | |
void | senk::sparse::SpmvBcsr (T *bval, int *bcind, int *brptr, T *x, T *y, int N) |
Perform SpMV using the BCSR format. More... | |
template<typename T > | |
void | senk::sparse::SpmvSell (T *val, int *cind, int *wid, int len, T *x, T *y, int N) |
Perform SpMV using the sliced-ELLPACK (SELL-c) format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_l (T *val, int *cind, int *rptr, T *x, T *y, int N) |
Perform the sparse lower triangular solve on a matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_u (T *val, int *cind, int *rptr, T *x, T *y, int N) |
Perform the sparse upper triangular solve on a matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_l (T *val, int *cind, int *rptr, T *x, T *y, int N, int *cptr, int cnum) |
Perform the sparse lower triangular solve in parallel on a AMC ordered matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_u (T *val, int *cind, int *rptr, T *x, T *y, int N, int *cptr, int cnum) |
Perform the sparse upper triangular solve in parallel on a AMC ordered matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_l (T *val, int *cind, int *rptr, T *x, T *y, int N, int *cptr, int cnum, int bsize) |
Perform the sparse lower triangular solve in parallel on a ABMC ordered matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_u (T *val, int *cind, int *rptr, T *x, T *y, int N, int *cptr, int cnum, int bsize) |
Perform the sparse upper triangular solve in parallel on a ABMC ordered matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_l (T *val, int *cind, int *rptr, T *x, T *y, int N, int bnum) |
Perform the block Jacobi sparse lower triangular solve on a matrix stored in the CSR format. More... | |
template<typename T > | |
void | senk::sparse::SptrsvCsr_u (T *val, int *cind, int *rptr, T *x, T *y, int N, int bnum) |
Perform the block Jacobi sparse upper triangular solve on a matrix stored in the CSR format. More... | |
template<typename T , int bnl, int bnw> | |
void | senk::sparse::SptrsvBcsr_l (T *bval, int *bcind, int *brptr, T *x, T *y, int N) |
Perform the sparse lower triangular solve for a matrix stored in the BCSR format. More... | |
template<typename T , int bnl, int bnw> | |
void | senk::sparse::SptrsvBcsr_u (T *bval, int *bcind, int *brptr, T *x, T *y, int N) |
Perform the sparse upper triangular solve for a matrix stored in the CSR format. More... | |
template<typename T , int bnl, int bnw> | |
void | senk::sparse::SptrsvBcsr_l (T *bval, int *bcind, int *brptr, T *x, T *y, int N, int *cptr, int cnum, int bsize) |
Perform the sparse lower triangular solve for a ABMC reordered matrix stored in the BCSR format. More... | |
template<typename T , int bnl, int bnw> | |
void | senk::sparse::SptrsvBcsr_u (T *bval, int *bcind, int *brptr, T *x, T *y, int N, int *cptr, int cnum, int bsize) |
Perform the sparse upper triangular solve for a ABMC reordered matrix stored in the CSR format. More... | |