1 /* $Id: aij.h,v 1.36 1999/11/24 21:53:47 bsmith Exp bsmith $ */ 2 3 #include "src/mat/matimpl.h" 4 5 #if !defined(__AIJ_H) 6 #define __AIJ_H 7 8 /* Info about i-nodes (identical nodes) */ 9 typedef struct { 10 int node_count; /* number of inodes */ 11 int *size; /* size of each inode */ 12 int limit; /* inode limit */ 13 int max_limit; /* maximum supported inode limit */ 14 } Mat_SeqAIJ_Inode; 15 16 /* 17 MATSEQAIJ format - Compressed row storage (also called Yale sparse matrix 18 format), compatible with Fortran. The i[] and j[] arrays start at 1, 19 or 0, depending on the value of shift. For example, in Fortran 20 j[i[k]+p+shift] is the pth column in row k. Note that the diagonal 21 matrix elements are stored with the rest of the nonzeros (not separately). 22 */ 23 24 typedef struct { 25 PetscTruth sorted; /* if true, rows are sorted by increasing columns */ 26 PetscTruth roworiented; /* if true, row-oriented input, default */ 27 int nonew; /* 1 don't add new nonzeros, -1 generate error on new */ 28 PetscTruth singlemalloc; /* if true a, i, and j have been obtained with 29 one big malloc */ 30 PetscTruth freedata; /* free the i,j,a data when the matrix is destroyed; true by default */ 31 int m,n; /* rows, columns */ 32 int nz,maxnz; /* nonzeros, allocated nonzeros */ 33 int *diag; /* pointers to diagonal elements */ 34 int *i; /* pointer to beginning of each row */ 35 int *imax; /* maximum space allocated for each row */ 36 int *ilen; /* actual length of each row */ 37 int *j; /* column values: j + i[k] - 1 is start of row k */ 38 Scalar *a; /* nonzero elements */ 39 IS row,col,icol; /* index sets, used for reorderings */ 40 Scalar *solve_work; /* work space used in MatSolve */ 41 void *spptr; /* pointer for special library like SuperLU */ 42 int indexshift; /* zero or -one for C or Fortran indexing */ 43 Mat_SeqAIJ_Inode inode; /* identical node informaton */ 44 int reallocs; /* number of mallocs done during MatSetValues() 45 as more values are set than were prealloced */ 46 int rmax; /* max nonzeros in any row */ 47 PetscTruth ilu_preserve_row_sums; 48 Scalar *saved_values; /* location for stashing nonzero values of matrix */ 49 Scalar *idiag,*ssor; /* inverse of diagonal entries; space for eisen */ 50 51 PetscTruth keepzeroedrows; /* keeps matrix structure same in calls to MatZeroRows()*/ 52 PetscTruth ignorezeroentries; 53 } Mat_SeqAIJ; 54 55 extern int MatILUFactorSymbolic_SeqAIJ(Mat,IS,IS,MatILUInfo*,Mat *); 56 extern int MatConvert_SeqAIJ(Mat,MatType,Mat *); 57 extern int MatDuplicate_SeqAIJ(Mat,MatDuplicateOption,Mat*); 58 extern int MatMarkDiagonal_SeqAIJ(Mat); 59 60 extern int MatMult_SeqAIJ(Mat A,Vec,Vec); 61 extern int MatMultAdd_SeqAIJ(Mat A,Vec,Vec,Vec); 62 extern int MatMultTranspose_SeqAIJ(Mat A,Vec,Vec); 63 extern int MatMultTransposeAdd_SeqAIJ(Mat A,Vec,Vec,Vec); 64 extern int MatRelax_SeqAIJ(Mat,Vec,double,MatSORType,double,int,Vec); 65 66 #endif 67