SuperLU 6.0.1
|
CGSSVX to solve systems repeatedly with the same sparsity pattern of matrix A. More...
Functions | |
int | main (int argc, char *argv[]) |
The driver program CLINSOLX2. More... | |
void | parse_command_line (int argc, char *argv[], int *lwork, double *u, yes_no_t *equil, trans_t *trans) |
Parse command line options to get relaxed snode size, panel size, etc. More... | |
int main | ( | int | argc, |
char * | argv[] | ||
) |
This example illustrates how to use CGSSVX to solve systems repeatedly with the same sparsity pattern and similar values of matrix A. In this case, the permutation vectors perm_r and perm_c are computed once. The following data structures will be reused in the subsequent call to CGSSVX: perm_r, perm_c, etree, L, U.