1*957e4c30SSatish Balay /* $Id: aij.h,v 1.17 1995/11/02 04:21:32 bsmith Exp balay $ */ 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*957e4c30SSatish Balay /* Stores info about inodes - no of inodes, and size of each inode */ 10*957e4c30SSatish Balay typedef struct { 11*957e4c30SSatish Balay int node_count; 12*957e4c30SSatish Balay int *size; 13*957e4c30SSatish Balay } Mat_SeqAIJ_Node; 14*957e4c30SSatish Balay 152d40f771SBarry Smith /* 16ec8511deSBarry Smith MATSEQAIJ format - Compressed row storage (also called Yale sparse matrix 17d35516d3SLois Curfman McInnes format), compatible with Fortran. The i[] and j[] arrays start at 1, 18d5d45c9bSBarry Smith or 0, depending on the value of shift. For example, in Fortran 1963b91edcSBarry Smith j[i[k]+p+shift] is the pth column in row k. 202d40f771SBarry Smith */ 21d35516d3SLois Curfman McInnes 22b8a66259SBarry Smith typedef struct { 23d35516d3SLois Curfman McInnes int sorted; /* if true, rows are sorted by increasing columns */ 24d35516d3SLois Curfman McInnes int roworiented; /* if true, row-oriented storage */ 25d35516d3SLois Curfman McInnes int nonew; /* if true, don't allow new elements to be added */ 26d35516d3SLois Curfman McInnes int singlemalloc; /* if true a, i, and j have been obtained with 27d35516d3SLois Curfman McInnes one big malloc */ 28d35516d3SLois Curfman McInnes int assembled; /* if true, matrix is fully assembled */ 291a1c3055SLois Curfman McInnes int m, n; /* rows, columns */ 3080b4ade8SLois Curfman McInnes int nz, maxnz; /* nonzeros, allocated nonzeros */ 31d35516d3SLois Curfman McInnes int *diag; /* pointers to diagonal elements */ 32d35516d3SLois Curfman McInnes int *i; /* pointer to beginning of each row */ 33d35516d3SLois Curfman McInnes int *imax; /* maximum space allocated for each row */ 34d35516d3SLois Curfman McInnes int *ilen; /* actual length of each row */ 35d35516d3SLois Curfman McInnes int *j; /* column values: j + i[k] - 1 is start of row k */ 36d35516d3SLois Curfman McInnes Scalar *a; /* nonzero elements */ 37d35516d3SLois Curfman McInnes IS row, col; /* index sets, used for reorderings */ 38f6fb444dSLois Curfman McInnes Scalar *solve_work; /* work space used in MatSolve */ 39dbb450caSBarry Smith void *spptr; /* pointer for special library like SuperLU */ 40dbb450caSBarry Smith int indexshift; /* zero or -one for C or Fortran indexing */ 41*957e4c30SSatish Balay Mat_SeqAIJ_Node inode; /* identical node informaton */ 42ec8511deSBarry Smith } Mat_SeqAIJ; 43b8a66259SBarry Smith 4408480c60SBarry Smith extern int MatILUFactorSymbolic_SeqAIJ(Mat,IS,IS,double,int,Mat *); 4508480c60SBarry Smith extern int MatConvert_SeqAIJ(Mat,MatType,Mat *); 4608480c60SBarry Smith extern int MatCopyPrivate_SeqAIJ(Mat, Mat*,int); 4708480c60SBarry Smith extern int MatMarkDiag_SeqAIJ(Mat); 4808480c60SBarry Smith 4908480c60SBarry Smith 502d40f771SBarry Smith #endif 51