#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
Go to the source code of this file.
Data Structures | |
struct | superlu_options_t |
struct | SuperLUStat_t |
struct | mem_usage_t |
Defines | |
#define | FIRSTCOL_OF_SNODE(i) (xsup[i]) |
#define | NO_MARKER 3 |
#define | NUM_TEMPV(m, w, t, b) ( SUPERLU_MAX(m, (t + b)*w) ) |
#define | USER_ABORT(msg) superlu_abort_and_exit(msg) |
#define | ABORT(err_msg) |
#define | USER_MALLOC(size) superlu_malloc(size) |
#define | SUPERLU_MALLOC(size) USER_MALLOC(size) |
#define | USER_FREE(addr) superlu_free(addr) |
#define | SUPERLU_FREE(addr) USER_FREE(addr) |
#define | CHECK_MALLOC(where) |
#define | SUPERLU_MAX(x, y) ( (x) > (y) ? (x) : (y) ) |
#define | SUPERLU_MIN(x, y) ( (x) < (y) ? (x) : (y) ) |
#define | L_SUB_START(col) ( Lstore->rowind_colptr[col] ) |
#define | L_SUB(ptr) ( Lstore->rowind[ptr] ) |
#define | L_NZ_START(col) ( Lstore->nzval_colptr[col] ) |
#define | L_FST_SUPC(superno) ( Lstore->sup_to_col[superno] ) |
#define | U_NZ_START(col) ( Ustore->colptr[col] ) |
#define | U_SUB(ptr) ( Ustore->rowind[ptr] ) |
#define | EMPTY (-1) |
#define | FALSE 0 |
#define | TRUE 1 |
Typedefs | |
typedef float | flops_t |
typedef unsigned char | Logical |
Enumerations | |
enum | yes_no_t { NO, YES } |
enum | fact_t { DOFACT, SamePattern, SamePattern_SameRowPerm, FACTORED } |
enum | rowperm_t { NOROWPERM, LargeDiag, MY_PERMR } |
enum | colperm_t { NATURAL, MMD_ATA, MMD_AT_PLUS_A, COLAMD, MY_PERMC } |
enum | trans_t { NOTRANS, TRANS, CONJ } |
enum | DiagScale_t { NOEQUIL, ROW, COL, BOTH } |
enum | IterRefine_t { NOREFINE, SINGLE = 1, DOUBLE, EXTRA } |
enum | MemType { LUSUP, UCOL, LSUB, USUB } |
enum | stack_end_t { HEAD, TAIL } |
enum | LU_space_t { SYSTEM, USER } |
enum | PhaseType { COLPERM, RELAX, ETREE, EQUIL, FACT, RCOND, SOLVE, REFINE, TRSV, GEMV, FERR, NPHASES } |
Functions | |
void | Destroy_SuperMatrix_Store (SuperMatrix *) |
Deallocate the structure pointing to the actual storage of the matrix. | |
void | Destroy_CompCol_Matrix (SuperMatrix *) |
void | Destroy_CompRow_Matrix (SuperMatrix *) |
void | Destroy_SuperNode_Matrix (SuperMatrix *) |
void | Destroy_CompCol_Permuted (SuperMatrix *) |
A is of type Stype==NCP. | |
void | Destroy_Dense_Matrix (SuperMatrix *) |
A is of type Stype==DN. | |
void | get_perm_c (int, SuperMatrix *, int *) |
void | set_default_options (superlu_options_t *options) |
Set the default values for the options argument. | |
void | sp_preorder (superlu_options_t *, SuperMatrix *, int *, int *, SuperMatrix *) |
void | superlu_abort_and_exit (char *) |
Global statistics variale. | |
void * | superlu_malloc (size_t) |
int * | intMalloc (int) |
int * | intCalloc (int) |
void | superlu_free (void *) |
void | SetIWork (int, int, int, int *, int **, int **, int **, int **, int **, int **, int **) |
Set up pointers for integer working arrays. | |
int | sp_coletree (int *, int *, int *, int, int, int *) |
void | relax_snode (const int, int *, const int, int *, int *) |
void | heap_relax_snode (const int, int *, const int, int *, int *) |
void | resetrep_col (const int, const int *, int *) |
Reset repfnz[] for the current column. | |
int | spcoletree (int *, int *, int *, int, int, int *) |
int * | TreePostorder (int, int *) |
double | SuperLU_timer_ () |
Timer function. | |
int | sp_ienv (int) |
int | lsame_ (char *, char *) |
int | xerbla_ (char *, int *) |
void | ifill (int *, int, int) |
Fills an integer array with a given value. | |
void | snode_profile (int, int *) |
void | super_stats (int, int *) |
void | PrintSumm (char *, int, int, int) |
Print a summary of the testing results. | |
void | StatInit (SuperLUStat_t *) |
void | StatPrint (SuperLUStat_t *) |
void | StatFree (SuperLUStat_t *) |
void | print_panel_seg (int, int, int, int, int *, int *) |
Diagnostic print of segment info after panel_dfs(). | |
void | check_repfnz (int, int, int, int *) |
Check whether repfnz[] == EMPTY after reset. |
|
Value: { char msg[256];\ sprintf(msg,"%s at line %d in file %s\n",err_msg,__LINE__, __FILE__);\ USER_ABORT(msg); } |
|
Value: { \ extern int superlu_malloc_total; \ printf("%s: malloc_total %d Bytes\n", \ where, superlu_malloc_total); \ } |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Purpose =======
GET_PERM_C obtains a permutation matrix Pc, by applying the multiple minimum degree ordering code by Joseph Liu to matrix A'*A or A+A'. or using approximate minimum degree column ordering by Davis et. al. The LU factorization of A*Pc tends to have less fill than the LU factorization of A.
Arguments =========
ispec (input) int Specifies the type of column ordering to reduce fill: = 1: minimum degree on the structure of A^T * A = 2: minimum degree on the structure of A^T + A = 3: approximate minimum degree for unsymmetric matrices If ispec == 0, the natural ordering (i.e., Pc = I) is returned.
A (input) SuperMatrix* Matrix A in A*X=B, of dimension (A->nrow, A->ncol). The number of the linear equations is A->nrow. Currently, the type of A can be: Stype = NC; Dtype = _D; Mtype = GE. In the future, more general A can be handled.
perm_c (output) int* Column permutation vector of size A->ncol, which defines the permutation matrix Pc; perm_c[i] = j means column i of A is in position j in A*Pc. |
|
Purpose ======= relax_snode() - Identify the initial relaxed supernodes, assuming that the matrix has been reordered according to the postorder of the etree. |
|
|
|
|
|
|
|
Purpose =======
LSAME returns .TRUE. if CA is the same letter as CB regardless of case.
Arguments =========
CA (input) CHARACTER*1 CB (input) CHARACTER*1 CA and CB specify the single characters to be compared.
===================================================================== |
|
|
|
|
|
Purpose ======= relax_snode() - Identify the initial relaxed supernodes, assuming that the matrix has been reordered according to the postorder of the etree. |
|
|
|
|
|
|
|
|
|
|
|
Purpose =======
sp_ienv() is inquired to choose machine-dependent parameters for the local environment. See ISPEC for a description of the parameters.
This version provides a set of parameters which should give good, but not optimal, performance on many of the currently available computers. Users are encouraged to modify this subroutine to set the tuning parameters for their particular machine using the option and problem size information in the arguments.
Arguments =========
ISPEC (input) int Specifies the parameter to be returned as the value of SP_IENV. = 1: the panel size w; a panel consists of w consecutive columns of matrix A in the process of Gaussian elimination. The best value depends on machine's cache characters. = 2: the relaxation parameter relax; if the number of nodes (columns) in a subtree of the elimination tree is less than relax, this subtree is considered as one supernode, regardless of their row structures. = 3: the maximum size for a supernode; = 4: the minimum row dimension for 2-D blocking to be used; = 5: the minimum column dimension for 2-D blocking to be used; = 6: the estimated fills factor for L and U, compared with A;
(SP_IENV) (output) int >= 0: the value of the parameter specified by ISPEC < 0: if SP_IENV = -k, the k-th argument had an illegal value.
===================================================================== |
|
Purpose =======
sp_preorder() permutes the columns of the original matrix. It performs the following steps:
1. Apply column permutation perm_c[] to A's column pointers to form AC;
2. If options->Fact = DOFACT, then (1) Compute column elimination tree etree[] of AC'AC; (2) Post order etree[] to get a postordered elimination tree etree[], and a postorder permutation post[]; (3) Apply post[] permutation to columns of AC; (4) Overwrite perm_c[] with the product perm_c * post.
Arguments =========
options (input) superlu_options_t* Specifies whether or not the elimination tree will be re-used. If options->Fact == DOFACT, this means first time factor A, etree is computed, postered, and output. Otherwise, re-factor A, etree is input, unchanged on exit.
A (input) SuperMatrix* Matrix A in A*X=B, of dimension (A->nrow, A->ncol). The number of the linear equations is A->nrow. Currently, the type of A can be: Stype = NC or SLU_NCP; Mtype = SLU_GE. In the future, more general A may be handled.
perm_c (input/output) int* Column permutation vector of size A->ncol, which defines the permutation matrix Pc; perm_c[i] = j means column i of A is in position j in A*Pc. If options->Fact == DOFACT, perm_c is both input and output. On output, it is changed according to a postorder of etree. Otherwise, perm_c is input.
etree (input/output) int* Elimination tree of Pc'*A'*A*Pc, dimension A->ncol. If options->Fact == DOFACT, etree is an output argument, otherwise it is an input argument. Note: etree is a vector of parent pointers for a forest whose vertices are the integers 0 to A->ncol-1; etree[root]==A->ncol.
AC (output) SuperMatrix* The resulting matrix after applied the column permutation perm_c[] to matrix A. The type of AC can be: Stype = SLU_NCP; Dtype = A->Dtype; Mtype = SLU_GE. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Precision-independent memory-related routines. (Shared by [sdcz]memory.c) |
|
|
|
|
|
|