Skip to main content
`Ctrl`+`K`

# Sparse matrix functions

Sparse matrix routines solve complex numerical linear algebra problems for sparse matrices.

## Combined factorization and linear-system solvers

### hipsolverSp<type>csrlsvchol()

hipsolverStatus_t hipsolverSpDcsrlsvchol(hipsolverSpHandle_t handle, int n, int nnzA, const hipsparseMatDescr_t descrA, const double *csrVal, const int *csrRowPtr, const int *csrColInd, const double *b, double tolerance, int reorder, double *x, int *singularity)

hipsolverStatus_t hipsolverSpScsrlsvchol(hipsolverSpHandle_t handle, int n, int nnzA, const hipsparseMatDescr_t descrA, const float *csrVal, const int *csrRowPtr, const int *csrColInd, const float *b, float tolerance, int reorder, float *x, int *singularity)

### hipsolverSp<type>csrlsvcholHost()

hipsolverStatus_t hipsolverSpDcsrlsvcholHost(hipsolverSpHandle_t handle, int n, int nnzA, const hipsparseMatDescr_t descrA, const double *csrVal, const int *csrRowPtr, const int *csrColInd, const double *b, double tolerance, int reorder, double *x, int *singularity)

hipsolverStatus_t hipsolverSpScsrlsvcholHost(hipsolverSpHandle_t handle, int n, int nnzA, const hipsparseMatDescr_t descrA, const float *csrVal, const int *csrRowPtr, const int *csrColInd, const float *b, float tolerance, int reorder, float *x, int *singularity)

### hipsolverSp<type>csrlsvqr()

hipsolverStatus_t hipsolverSpDcsrlsvqr(hipsolverSpHandle_t handle, int n, int nnz, const hipsparseMatDescr_t descrA, const double *csrVal, const int *csrRowPts, const int *csrColInd, const double *b, double tolerance, int reorder, double *x, int *singularity)

hipsolverStatus_t hipsolverSpScsrlsvqr(hipsolverSpHandle_t handle, int n, int nnz, const hipsparseMatDescr_t descrA, const float *csrVal, const int *csrRowPts, const int *csrColInd, const float *b, double tolerance, int reorder, float *x, int *singularity)