Skip to main content
`Ctrl`+`K`

# Refactorization functions

Refactoring routines are used to solve complex numerical linear algebra problems for sparse matrices. These functions are organized into the following categories:

- Triangular factorizations

- Linear-systems solvers

## Triangular factorizations

### hipsolverRfRefactor()

hipsolverStatus_t hipsolverRfRefactor(hipsolverRfHandle_t handle)

### hipsolverRfBatchRefactor()

hipsolverStatus_t hipsolverRfBatchRefactor(hipsolverRfHandle_t handle)

## Linear-systems solvers

### hipsolverRfSolve()

hipsolverStatus_t hipsolverRfSolve(hipsolverRfHandle_t handle, int *P, int *Q, int nrhs, double *Temp, int ldt, double *XF, int ldxf)

### hipsolverRfBatchSolve()

hipsolverStatus_t hipsolverRfBatchSolve(hipsolverRfHandle_t handle, int *P, int *Q, int nrhs, double *Temp, int ldt, double *XF_array[], int ldxf)