xref: /petsc/src/mat/impls/sbaij/seq/sbaij.h (revision ffac6cdb671c711dabb6f689a6a2ffdf24fad51a)
1 /* $Id: sbaij.h,v 1.15 2000/10/24 20:26:00 bsmith Exp hzhang $ */
2 
3 #include "src/mat/matimpl.h"
4 
5 #if !defined(__SBAIJ_H)
6 #define __SBAIJ_H
7 
8 /*
9   MATSEQSBAIJ format - Block compressed row storage. The i[] and j[]
10   arrays start at 0.
11 */
12 
13 typedef struct {
14   PetscTruth       sorted;       /* if true, rows are sorted by increasing columns */
15   PetscTruth       roworiented;  /* if true, row-oriented input, default */
16   int              nonew;        /* 1 don't add new nonzeros, -1 generate error on new */
17   PetscTruth       singlemalloc; /* if true a, i, and j have been obtained with
18                                         one big malloc */
19   int              bs,bs2;       /* block size, square of block size */
20   int              mbs,nbs;      /* rows/bs or columns/bs */
21   int              s_nz,s_maxnz; /* total diagonal and superdiagonal nonzero blocks,
22                                     total allocated diagonal and superdiagonal nonzero blocks*/
23   int              *diag;        /* pointers to diagonal elements */
24   int              *i,*inew;     /* pointer to beginning of each row */
25   int              *imax;        /* maximum space allocated for each row */
26   int              *ilen;        /* actual length of each row */
27   int              *j,*jnew;     /* column values: j + i[k] is start of row k */
28   MatScalar        *a,*anew;     /* nonzero diagonal and subdiagonal elements */
29   IS               row,icol;     /* index sets, used for reorderings */
30   Scalar           *solve_work;  /* work space used in MatSolve */
31   void             *spptr;       /* pointer for special library like SuperLU */
32   int              reallocs;     /* number of mallocs done during MatSetValues()
33                                     as more values are set then were preallocated */
34   Scalar           *mult_work;   /* work array for matrix vector product*/
35   Scalar           *saved_values;
36 
37   PetscTruth       keepzeroedrows; /* if true, MatZeroRows() will not change nonzero structure */
38   int              *a2anew;        /* map used for symm permutation */
39   PetscTruth       permute;        /* if true, a non-trivial permutation is used for factorization */
40 } Mat_SeqSBAIJ;
41 
42 extern int MatIncompleteCholeskyFactorSymbolic_SeqSBAIJ(Mat,IS,PetscReal,int,Mat *);
43 extern int MatDuplicate_SeqSBAIJ(Mat,MatDuplicateOption,Mat*);
44 extern int MatMarkDiagonal_SeqSBAIJ(Mat);
45 
46 extern int MatSolveTranspose_SeqSBAIJ_1_NaturalOrdering(Mat,Vec,Vec);
47 
48 extern int MatCholeskyFactorNumeric_SeqSBAIJ_2_NaturalOrdering(Mat,Mat*);
49 extern int MatSolve_SeqSBAIJ_2(Mat,Vec,Vec);
50 extern int MatSolve_SeqSBAIJ_2_NaturalOrdering(Mat,Vec,Vec);
51 extern int MatSolveTranspose_SeqSBAIJ_2_NaturalOrdering(Mat,Vec,Vec);
52 
53 extern int MatCholeskyFactorNumeric_SeqSBAIJ_3_NaturalOrdering(Mat,Mat*);
54 extern int MatSolve_SeqSBAIJ_3_NaturalOrdering(Mat,Vec,Vec);
55 extern int MatSolveTranspose_SeqSBAIJ_3_NaturalOrdering(Mat,Vec,Vec);
56 
57 extern int MatCholeskyFactorNumeric_SeqSBAIJ_4_NaturalOrdering(Mat,Mat*);
58 extern int MatSolve_SeqSBAIJ_4_NaturalOrdering(Mat,Vec,Vec);
59 extern int MatSolveTranspose_SeqSBAIJ_4_NaturalOrdering(Mat,Vec,Vec);
60 
61 extern int MatCholeskyFactorNumeric_SeqSBAIJ_5_NaturalOrdering(Mat,Mat*);
62 extern int MatSolve_SeqSBAIJ_5_NaturalOrdering(Mat,Vec,Vec);
63 extern int MatSolveTranspose_SeqSBAIJ_5_NaturalOrdering(Mat,Vec,Vec);
64 
65 extern int MatCholeskyFactorNumeric_SeqSBAIJ_6_NaturalOrdering(Mat,Mat*);
66 extern int MatSolve_SeqSBAIJ_6_NaturalOrdering(Mat,Vec,Vec);
67 extern int MatSolveTranspose_SeqSBAIJ_6_NaturalOrdering(Mat,Vec,Vec);
68 
69 extern int MatCholeskyFactorNumeric_SeqSBAIJ_7_NaturalOrdering(Mat,Mat*);
70 extern int MatSolve_SeqSBAIJ_7_NaturalOrdering(Mat,Vec,Vec);
71 extern int MatSolveTranspose_SeqSBAIJ_7_NaturalOrdering(Mat,Vec,Vec);
72 
73 extern int MatReorderingSeqSBAIJ(Mat,IS);
74 
75 #endif
76