Actual source code: baijfact4.c
petsc-3.3-p7 2013-05-11
2: /*
3: Factorization code for BAIJ format.
4: */
5: #include <../src/mat/impls/baij/seq/baij.h>
6: #include <../src/mat/blockinvert.h>
8: /* ----------------------------------------------------------- */
11: PetscErrorCode MatLUFactorNumeric_SeqBAIJ_N_inplace(Mat C,Mat A,const MatFactorInfo *info)
12: {
13: Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data,*b = (Mat_SeqBAIJ *)C->data;
14: IS isrow = b->row,isicol = b->icol;
16: const PetscInt *r,*ic;
17: PetscInt i,j,n = a->mbs,*bi = b->i,*bj = b->j;
18: PetscInt *ajtmpold,*ajtmp,nz,row,bslog,*ai=a->i,*aj=a->j,k,flg;
19: PetscInt *diag_offset=b->diag,diag,bs=A->rmap->bs,bs2 = a->bs2,*pj,*v_pivots;
20: MatScalar *ba = b->a,*aa = a->a,*pv,*v,*rtmp,*multiplier,*v_work,*pc,*w;
23: ISGetIndices(isrow,&r);
24: ISGetIndices(isicol,&ic);
25: PetscMalloc(bs2*(n+1)*sizeof(MatScalar),&rtmp);
26: PetscMemzero(rtmp,(bs2*n+1)*sizeof(MatScalar));
27: /* generate work space needed by dense LU factorization */
28: PetscMalloc3(bs,MatScalar,&v_work,bs2,MatScalar,&multiplier,bs,PetscInt,&v_pivots);
30: /* flops in while loop */
31: bslog = 2*bs*bs2;
33: for (i=0; i<n; i++) {
34: nz = bi[i+1] - bi[i];
35: ajtmp = bj + bi[i];
36: for (j=0; j<nz; j++) {
37: PetscMemzero(rtmp+bs2*ajtmp[j],bs2*sizeof(MatScalar));
38: }
39: /* load in initial (unfactored row) */
40: nz = ai[r[i]+1] - ai[r[i]];
41: ajtmpold = aj + ai[r[i]];
42: v = aa + bs2*ai[r[i]];
43: for (j=0; j<nz; j++) {
44: PetscMemcpy(rtmp+bs2*ic[ajtmpold[j]],v+bs2*j,bs2*sizeof(MatScalar));
45: }
46: row = *ajtmp++;
47: while (row < i) {
48: pc = rtmp + bs2*row;
49: /* if (*pc) { */
50: for (flg=0,k=0; k<bs2; k++) { if (pc[k]!=0.0) { flg = 1; break; }}
51: if (flg) {
52: pv = ba + bs2*diag_offset[row];
53: pj = bj + diag_offset[row] + 1;
54: PetscKernel_A_gets_A_times_B(bs,pc,pv,multiplier);
55: nz = bi[row+1] - diag_offset[row] - 1;
56: pv += bs2;
57: for (j=0; j<nz; j++) {
58: PetscKernel_A_gets_A_minus_B_times_C(bs,rtmp+bs2*pj[j],pc,pv+bs2*j);
59: }
60: PetscLogFlops(bslog*(nz+1.0)-bs);
61: }
62: row = *ajtmp++;
63: }
64: /* finished row so stick it into b->a */
65: pv = ba + bs2*bi[i];
66: pj = bj + bi[i];
67: nz = bi[i+1] - bi[i];
68: for (j=0; j<nz; j++) {
69: PetscMemcpy(pv+bs2*j,rtmp+bs2*pj[j],bs2*sizeof(MatScalar));
70: }
71: diag = diag_offset[i] - bi[i];
72: /* invert diagonal block */
73: w = pv + bs2*diag;
74: PetscKernel_A_gets_inverse_A(bs,w,v_pivots,v_work);
75: }
77: PetscFree(rtmp);
78: PetscFree3(v_work,multiplier,v_pivots);
79: ISRestoreIndices(isicol,&ic);
80: ISRestoreIndices(isrow,&r);
81: C->ops->solve = MatSolve_SeqBAIJ_N_inplace;
82: C->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_N_inplace;
83: C->assembled = PETSC_TRUE;
84: PetscLogFlops(1.333333333333*bs*bs2*b->mbs); /* from inverting diagonal blocks */
85: return(0);
86: }