xref: /petsc/src/mat/impls/aij/seq/aij.h (revision 2b36279985d181bf1ae28d424577ae2c2fbebdf4)
1 /* $Id: aij.h,v 1.29 1996/08/08 14:42:46 bsmith Exp bsmith $ */
2 
3 #include "src/mat/matimpl.h"
4 #include <math.h>
5 
6 #if !defined(__AIJ_H)
7 #define __AIJ_H
8 
9 /* Info about i-nodes (identical nodes) */
10 typedef struct {
11   int node_count;                    /* number of inodes */
12   int *size;                         /* size of each inode */
13   int limit;                         /* inode limit */
14   int max_limit;                     /* maximum supported inode limit */
15 } Mat_SeqAIJ_Inode;
16 
17 /*
18   MATSEQAIJ format - Compressed row storage (also called Yale sparse matrix
19   format), compatible with Fortran.  The i[] and j[] arrays start at 1,
20   or 0, depending on the value of shift.  For example, in Fortran
21   j[i[k]+p+shift] is the pth column in row k.  Note that the diagonal
22   matrix elements are stored with the rest of the nonzeros (not separately).
23 */
24 
25 typedef struct {
26   int              sorted;           /* if true, rows are sorted by increasing columns */
27   int              roworiented;      /* if true, row-oriented input, default */
28   int              nonew;            /* 1 don't add new nonzeros, -1 generate error on new */
29   int              singlemalloc;     /* if true a, i, and j have been obtained with
30                                         one big malloc */
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;         /* 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   PetscTruth       ilu_preserve_row_sums;
47 } Mat_SeqAIJ;
48 
49 extern int MatILUFactorSymbolic_SeqAIJ(Mat,IS,IS,double,int,Mat *);
50 extern int MatConvert_SeqAIJ(Mat,MatType,Mat *);
51 extern int MatConvertSameType_SeqAIJ(Mat, Mat*,int);
52 extern int MatMarkDiag_SeqAIJ(Mat);
53 
54 extern int MatMult_SeqAIJ(Mat A,Vec,Vec);
55 extern int MatMultAdd_SeqAIJ(Mat A,Vec,Vec,Vec);
56 extern int MatMultTrans_SeqAIJ(Mat A,Vec,Vec);
57 extern int MatMultTransAdd_SeqAIJ(Mat A,Vec,Vec,Vec);
58 extern int MatRelax_SeqAIJ(Mat,Vec,double,MatSORType,double,int,Vec);
59 
60 #endif
61