1*ed2daf61SLois Curfman McInnes /* $Id: aij.h,v 1.19 1995/11/06 21:04:31 balay Exp curfman $ */ 2b8a66259SBarry Smith 3b8a66259SBarry Smith #include "matimpl.h" 40068c123SLois Curfman McInnes #include <math.h> 5b8a66259SBarry Smith 62d40f771SBarry Smith #if !defined(__AIJ_H) 72d40f771SBarry Smith #define __AIJ_H 82d40f771SBarry Smith 9*ed2daf61SLois Curfman McInnes /* Info about i-nodes (identical nodes) */ 10957e4c30SSatish Balay typedef struct { 11*ed2daf61SLois Curfman McInnes int node_count; /* number of inodes */ 12*ed2daf61SLois Curfman McInnes int *size; /* size of each inode */ 13*ed2daf61SLois Curfman McInnes int limit; /* inode limit */ 14*ed2daf61SLois Curfman McInnes int max_limit; /* maximum supported inode limit */ 1576dd722bSSatish Balay } Mat_SeqAIJ_Inode; 16957e4c30SSatish Balay 172d40f771SBarry Smith /* 18ec8511deSBarry Smith MATSEQAIJ format - Compressed row storage (also called Yale sparse matrix 19d35516d3SLois Curfman McInnes format), compatible with Fortran. The i[] and j[] arrays start at 1, 20d5d45c9bSBarry Smith or 0, depending on the value of shift. For example, in Fortran 2163b91edcSBarry Smith j[i[k]+p+shift] is the pth column in row k. 222d40f771SBarry Smith */ 23d35516d3SLois Curfman McInnes 24b8a66259SBarry Smith typedef struct { 25d35516d3SLois Curfman McInnes int sorted; /* if true, rows are sorted by increasing columns */ 26d35516d3SLois Curfman McInnes int roworiented; /* if true, row-oriented storage */ 27d35516d3SLois Curfman McInnes int nonew; /* if true, don't allow new elements to be added */ 28d35516d3SLois Curfman McInnes int singlemalloc; /* if true a, i, and j have been obtained with 29d35516d3SLois Curfman McInnes one big malloc */ 30d35516d3SLois Curfman McInnes int assembled; /* if true, matrix is fully assembled */ 311a1c3055SLois Curfman McInnes int m, n; /* rows, columns */ 3280b4ade8SLois Curfman McInnes int nz, maxnz; /* nonzeros, allocated nonzeros */ 33d35516d3SLois Curfman McInnes int *diag; /* pointers to diagonal elements */ 34d35516d3SLois Curfman McInnes int *i; /* pointer to beginning of each row */ 35d35516d3SLois Curfman McInnes int *imax; /* maximum space allocated for each row */ 36d35516d3SLois Curfman McInnes int *ilen; /* actual length of each row */ 37d35516d3SLois Curfman McInnes int *j; /* column values: j + i[k] - 1 is start of row k */ 38d35516d3SLois Curfman McInnes Scalar *a; /* nonzero elements */ 39d35516d3SLois Curfman McInnes IS row, col; /* index sets, used for reorderings */ 40f6fb444dSLois Curfman McInnes Scalar *solve_work; /* work space used in MatSolve */ 41dbb450caSBarry Smith void *spptr; /* pointer for special library like SuperLU */ 42dbb450caSBarry Smith int indexshift; /* zero or -one for C or Fortran indexing */ 4376dd722bSSatish Balay Mat_SeqAIJ_Inode inode; /* identical node informaton */ 44ec8511deSBarry Smith } Mat_SeqAIJ; 45b8a66259SBarry Smith 4608480c60SBarry Smith extern int MatILUFactorSymbolic_SeqAIJ(Mat,IS,IS,double,int,Mat *); 4708480c60SBarry Smith extern int MatConvert_SeqAIJ(Mat,MatType,Mat *); 4808480c60SBarry Smith extern int MatCopyPrivate_SeqAIJ(Mat, Mat*,int); 4908480c60SBarry Smith extern int MatMarkDiag_SeqAIJ(Mat); 5008480c60SBarry Smith 5108480c60SBarry Smith 522d40f771SBarry Smith #endif 53