1 #include "sbaij.h" 2 #include "src/inline/ilu.h" 3 4 /* 5 Version for when blocks are 5 by 5 Using natural ordering 6 */ 7 #undef __FUNC__ 8 #define __FUNC__ "MatCholeskyFactorNumeric_SeqSBAIJ_5_NaturalOrdering" 9 int MatCholeskyFactorNumeric_SeqSBAIJ_5_NaturalOrdering(Mat A,Mat *B) 10 { 11 Mat C = *B; 12 Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)A->data,*b = (Mat_SeqSBAIJ *)C->data; 13 int ierr,i,j,mbs=a->mbs,*bi=b->i,*bj=b->j; 14 int *ai,*aj,k,k1,jmin,jmax,*jl,*il,vj,nexti,ili; 15 MatScalar *ba = b->a,*aa,*ap,*dk,*uik; 16 MatScalar *u,*d,*rtmp,*rtmp_ptr; 17 18 PetscFunctionBegin; 19 20 /* initialization */ 21 ierr = PetscMalloc(25*mbs*sizeof(MatScalar),&rtmp);CHKERRQ(ierr); 22 ierr = PetscMemzero(rtmp,25*mbs*sizeof(MatScalar));CHKERRQ(ierr); 23 ierr = PetscMalloc(2*mbs*sizeof(int),&il);CHKERRQ(ierr); 24 jl = il + mbs; 25 for (i=0; i<mbs; i++) { 26 jl[i] = mbs; il[0] = 0; 27 } 28 ierr = PetscMalloc(50*sizeof(MatScalar),&dk);CHKERRQ(ierr); 29 uik = dk + 25; 30 31 ai = a->i; aj = a->j; aa = a->a; 32 33 /* for each row k */ 34 for (k = 0; k<mbs; k++){ 35 36 /*initialize k-th row with elements nonzero in row k of A */ 37 jmin = ai[k]; jmax = ai[k+1]; 38 if (jmin < jmax) { 39 ap = aa + jmin*25; 40 for (j = jmin; j < jmax; j++){ 41 vj = aj[j]; /* block col. index */ 42 rtmp_ptr = rtmp + vj*25; 43 for (i=0; i<25; i++) *rtmp_ptr++ = *ap++; 44 } 45 } 46 47 /* modify k-th row by adding in those rows i with U(i,k) != 0 */ 48 ierr = PetscMemcpy(dk,rtmp+k*25,25*sizeof(MatScalar));CHKERRQ(ierr); 49 i = jl[k]; /* first row to be added to k_th row */ 50 51 while (i < mbs){ 52 nexti = jl[i]; /* next row to be added to k_th row */ 53 54 /* compute multiplier */ 55 ili = il[i]; /* index of first nonzero element in U(i,k:bms-1) */ 56 57 /* uik = -inv(Di)*U_bar(i,k) */ 58 d = ba + i*25; 59 u = ba + ili*25; 60 61 uik[0] = -(d[0]*u[0] + d[5]*u[1] + d[10]*u[2] + d[15]*u[3] + d[20]*u[4]); 62 uik[1] = -(d[1]*u[0] + d[6]*u[1] + d[11]*u[2] + d[16]*u[3] + d[21]*u[4]); 63 uik[2] = -(d[2]*u[0] + d[7]*u[1] + d[12]*u[2] + d[17]*u[3] + d[22]*u[4]); 64 uik[3] = -(d[3]*u[0] + d[8]*u[1] + d[13]*u[2] + d[18]*u[3] + d[23]*u[4]); 65 uik[4] = -(d[4]*u[0] + d[9]*u[1] + d[14]*u[2] + d[19]*u[3] + d[24]*u[4]); 66 67 uik[5] = -(d[0]*u[5] + d[5]*u[6] + d[10]*u[7] + d[15]*u[8] + d[20]*u[9]); 68 uik[6] = -(d[1]*u[5] + d[6]*u[6] + d[11]*u[7] + d[16]*u[8] + d[21]*u[9]); 69 uik[7] = -(d[2]*u[5] + d[7]*u[6] + d[12]*u[7] + d[17]*u[8] + d[22]*u[9]); 70 uik[8] = -(d[3]*u[5] + d[8]*u[6] + d[13]*u[7] + d[18]*u[8] + d[23]*u[9]); 71 uik[9] = -(d[4]*u[5] + d[9]*u[6] + d[14]*u[7] + d[19]*u[8] + d[24]*u[9]); 72 73 uik[10]= -(d[0]*u[10] + d[5]*u[11] + d[10]*u[12] + d[15]*u[13] + d[20]*u[14]); 74 uik[11]= -(d[1]*u[10] + d[6]*u[11] + d[11]*u[12] + d[16]*u[13] + d[21]*u[14]); 75 uik[12]= -(d[2]*u[10] + d[7]*u[11] + d[12]*u[12] + d[17]*u[13] + d[22]*u[14]); 76 uik[13]= -(d[3]*u[10] + d[8]*u[11] + d[13]*u[12] + d[18]*u[13] + d[23]*u[14]); 77 uik[14]= -(d[4]*u[10] + d[9]*u[11] + d[14]*u[12] + d[19]*u[13] + d[24]*u[14]); 78 79 uik[15]= -(d[0]*u[15] + d[5]*u[16] + d[10]*u[17] + d[15]*u[18] + d[20]*u[19]); 80 uik[16]= -(d[1]*u[15] + d[6]*u[16] + d[11]*u[17] + d[16]*u[18] + d[21]*u[19]); 81 uik[17]= -(d[2]*u[15] + d[7]*u[16] + d[12]*u[17] + d[17]*u[18] + d[22]*u[19]); 82 uik[18]= -(d[3]*u[15] + d[8]*u[16] + d[13]*u[17] + d[18]*u[18] + d[23]*u[19]); 83 uik[19]= -(d[4]*u[15] + d[9]*u[16] + d[14]*u[17] + d[19]*u[18] + d[24]*u[19]); 84 85 uik[20]= -(d[0]*u[20] + d[5]*u[21] + d[10]*u[22] + d[15]*u[23] + d[20]*u[24]); 86 uik[21]= -(d[1]*u[20] + d[6]*u[21] + d[11]*u[22] + d[16]*u[23] + d[21]*u[24]); 87 uik[22]= -(d[2]*u[20] + d[7]*u[21] + d[12]*u[22] + d[17]*u[23] + d[22]*u[24]); 88 uik[23]= -(d[3]*u[20] + d[8]*u[21] + d[13]*u[22] + d[18]*u[23] + d[23]*u[24]); 89 uik[24]= -(d[4]*u[20] + d[9]*u[21] + d[14]*u[22] + d[19]*u[23] + d[24]*u[24]); 90 91 92 /* update D(k) += -U(i,k)^T * U_bar(i,k) */ 93 dk[0] += uik[0]*u[0] + uik[1]*u[1] + uik[2]*u[2] + uik[3]*u[3] + uik[4]*u[4]; 94 dk[1] += uik[5]*u[0] + uik[6]*u[1] + uik[7]*u[2] + uik[8]*u[3] + uik[9]*u[4]; 95 dk[2] += uik[10]*u[0]+ uik[11]*u[1]+ uik[12]*u[2]+ uik[13]*u[3]+ uik[14]*u[4]; 96 dk[3] += uik[15]*u[0]+ uik[16]*u[1]+ uik[17]*u[2]+ uik[18]*u[3]+ uik[19]*u[4]; 97 dk[4] += uik[20]*u[0]+ uik[21]*u[1]+ uik[22]*u[2]+ uik[23]*u[3]+ uik[24]*u[4]; 98 99 dk[5] += uik[0]*u[5] + uik[1]*u[6] + uik[2]*u[7] + uik[3]*u[8] + uik[4]*u[9]; 100 dk[6] += uik[5]*u[5] + uik[6]*u[6] + uik[7]*u[7] + uik[8]*u[8] + uik[9]*u[9]; 101 dk[7] += uik[10]*u[5]+ uik[11]*u[6]+ uik[12]*u[7]+ uik[13]*u[8]+ uik[14]*u[9]; 102 dk[8] += uik[15]*u[5]+ uik[16]*u[6]+ uik[17]*u[7]+ uik[18]*u[8]+ uik[19]*u[9]; 103 dk[9] += uik[20]*u[5]+ uik[21]*u[6]+ uik[22]*u[7]+ uik[23]*u[8]+ uik[24]*u[9]; 104 105 dk[10] += uik[0]*u[10] + uik[1]*u[11] + uik[2]*u[12] + uik[3]*u[13] + uik[4]*u[14]; 106 dk[11] += uik[5]*u[10] + uik[6]*u[11] + uik[7]*u[12] + uik[8]*u[13] + uik[9]*u[14]; 107 dk[12] += uik[10]*u[10]+ uik[11]*u[11]+ uik[12]*u[12]+ uik[13]*u[13]+ uik[14]*u[14]; 108 dk[13] += uik[15]*u[10]+ uik[16]*u[11]+ uik[17]*u[12]+ uik[18]*u[13]+ uik[19]*u[14]; 109 dk[14] += uik[20]*u[10]+ uik[21]*u[11]+ uik[22]*u[12]+ uik[23]*u[13]+ uik[24]*u[14]; 110 111 dk[15] += uik[0]*u[15] + uik[1]*u[16] + uik[2]*u[17] + uik[3]*u[18] + uik[4]*u[19]; 112 dk[16] += uik[5]*u[15] + uik[6]*u[16] + uik[7]*u[17] + uik[8]*u[18] + uik[9]*u[19]; 113 dk[17] += uik[10]*u[15]+ uik[11]*u[16]+ uik[12]*u[17]+ uik[13]*u[18]+ uik[14]*u[19]; 114 dk[18] += uik[15]*u[15]+ uik[16]*u[16]+ uik[17]*u[17]+ uik[18]*u[18]+ uik[19]*u[19]; 115 dk[19] += uik[20]*u[15]+ uik[21]*u[16]+ uik[22]*u[17]+ uik[23]*u[18]+ uik[24]*u[19]; 116 117 dk[20] += uik[0]*u[20] + uik[1]*u[21] + uik[2]*u[22] + uik[3]*u[23] + uik[4]*u[24]; 118 dk[21] += uik[5]*u[20] + uik[6]*u[21] + uik[7]*u[22] + uik[8]*u[23] + uik[9]*u[24]; 119 dk[22] += uik[10]*u[20]+ uik[11]*u[21]+ uik[12]*u[22]+ uik[13]*u[23]+ uik[14]*u[24]; 120 dk[23] += uik[15]*u[20]+ uik[16]*u[21]+ uik[17]*u[22]+ uik[18]*u[23]+ uik[19]*u[24]; 121 dk[24] += uik[20]*u[20]+ uik[21]*u[21]+ uik[22]*u[22]+ uik[23]*u[23]+ uik[24]*u[24]; 122 123 /* update -U(i,k) */ 124 ierr = PetscMemcpy(ba+ili*25,uik,25*sizeof(MatScalar));CHKERRQ(ierr); 125 126 /* add multiple of row i to k-th row ... */ 127 jmin = ili + 1; jmax = bi[i+1]; 128 if (jmin < jmax){ 129 for (j=jmin; j<jmax; j++) { 130 /* rtmp += -U(i,k)^T * U_bar(i,j) */ 131 rtmp_ptr = rtmp + bj[j]*25; 132 u = ba + j*25; 133 rtmp_ptr[0] += uik[0]*u[0] + uik[1]*u[1] + uik[2]*u[2] + uik[3]*u[3] + uik[4]*u[4]; 134 rtmp_ptr[1] += uik[5]*u[0] + uik[6]*u[1] + uik[7]*u[2] + uik[8]*u[3] + uik[9]*u[4]; 135 rtmp_ptr[2] += uik[10]*u[0]+ uik[11]*u[1]+ uik[12]*u[2]+ uik[13]*u[3]+ uik[14]*u[4]; 136 rtmp_ptr[3] += uik[15]*u[0]+ uik[16]*u[1]+ uik[17]*u[2]+ uik[18]*u[3]+ uik[19]*u[4]; 137 rtmp_ptr[4] += uik[20]*u[0]+ uik[21]*u[1]+ uik[22]*u[2]+ uik[23]*u[3]+ uik[24]*u[4]; 138 139 rtmp_ptr[5] += uik[0]*u[5] + uik[1]*u[6] + uik[2]*u[7] + uik[3]*u[8] + uik[4]*u[9]; 140 rtmp_ptr[6] += uik[5]*u[5] + uik[6]*u[6] + uik[7]*u[7] + uik[8]*u[8] + uik[9]*u[9]; 141 rtmp_ptr[7] += uik[10]*u[5]+ uik[11]*u[6]+ uik[12]*u[7]+ uik[13]*u[8]+ uik[14]*u[9]; 142 rtmp_ptr[8] += uik[15]*u[5]+ uik[16]*u[6]+ uik[17]*u[7]+ uik[18]*u[8]+ uik[19]*u[9]; 143 rtmp_ptr[9] += uik[20]*u[5]+ uik[21]*u[6]+ uik[22]*u[7]+ uik[23]*u[8]+ uik[24]*u[9]; 144 145 rtmp_ptr[10] += uik[0]*u[10] + uik[1]*u[11] + uik[2]*u[12] + uik[3]*u[13] + uik[4]*u[14]; 146 rtmp_ptr[11] += uik[5]*u[10] + uik[6]*u[11] + uik[7]*u[12] + uik[8]*u[13] + uik[9]*u[14]; 147 rtmp_ptr[12] += uik[10]*u[10]+ uik[11]*u[11]+ uik[12]*u[12]+ uik[13]*u[13]+ uik[14]*u[14]; 148 rtmp_ptr[13] += uik[15]*u[10]+ uik[16]*u[11]+ uik[17]*u[12]+ uik[18]*u[13]+ uik[19]*u[14]; 149 rtmp_ptr[14] += uik[20]*u[10]+ uik[21]*u[11]+ uik[22]*u[12]+ uik[23]*u[13]+ uik[24]*u[14]; 150 151 rtmp_ptr[15] += uik[0]*u[15] + uik[1]*u[16] + uik[2]*u[17] + uik[3]*u[18] + uik[4]*u[19]; 152 rtmp_ptr[16] += uik[5]*u[15] + uik[6]*u[16] + uik[7]*u[17] + uik[8]*u[18] + uik[9]*u[19]; 153 rtmp_ptr[17] += uik[10]*u[15]+ uik[11]*u[16]+ uik[12]*u[17]+ uik[13]*u[18]+ uik[14]*u[19]; 154 rtmp_ptr[18] += uik[15]*u[15]+ uik[16]*u[16]+ uik[17]*u[17]+ uik[18]*u[18]+ uik[19]*u[19]; 155 rtmp_ptr[19] += uik[20]*u[15]+ uik[21]*u[16]+ uik[22]*u[17]+ uik[23]*u[18]+ uik[24]*u[19]; 156 157 rtmp_ptr[20] += uik[0]*u[20] + uik[1]*u[21] + uik[2]*u[22] + uik[3]*u[23] + uik[4]*u[24]; 158 rtmp_ptr[21] += uik[5]*u[20] + uik[6]*u[21] + uik[7]*u[22] + uik[8]*u[23] + uik[9]*u[24]; 159 rtmp_ptr[22] += uik[10]*u[20]+ uik[11]*u[21]+ uik[12]*u[22]+ uik[13]*u[23]+ uik[14]*u[24]; 160 rtmp_ptr[23] += uik[15]*u[20]+ uik[16]*u[21]+ uik[17]*u[22]+ uik[18]*u[23]+ uik[19]*u[24]; 161 rtmp_ptr[24] += uik[20]*u[20]+ uik[21]*u[21]+ uik[22]*u[22]+ uik[23]*u[23]+ uik[24]*u[24]; 162 } 163 164 /* ... add i to row list for next nonzero entry */ 165 il[i] = jmin; /* update il(i) in column k+1, ... mbs-1 */ 166 j = bj[jmin]; 167 jl[i] = jl[j]; jl[j] = i; /* update jl */ 168 } 169 i = nexti; 170 } 171 172 /* save nonzero entries in k-th row of U ... */ 173 174 /* invert diagonal block */ 175 d = ba+k*25; 176 ierr = PetscMemcpy(d,dk,25*sizeof(MatScalar));CHKERRQ(ierr); 177 ierr = Kernel_A_gets_inverse_A_5(d);CHKERRQ(ierr); 178 179 jmin = bi[k]; jmax = bi[k+1]; 180 if (jmin < jmax) { 181 for (j=jmin; j<jmax; j++){ 182 vj = bj[j]; /* block col. index of U */ 183 u = ba + j*25; 184 rtmp_ptr = rtmp + vj*25; 185 for (k1=0; k1<25; k1++){ 186 *u++ = *rtmp_ptr; 187 *rtmp_ptr++ = 0.0; 188 } 189 } 190 191 /* ... add k to row list for first nonzero entry in k-th row */ 192 il[k] = jmin; 193 i = bj[jmin]; 194 jl[k] = jl[i]; jl[i] = k; 195 } 196 } 197 198 ierr = PetscFree(rtmp);CHKERRQ(ierr); 199 ierr = PetscFree(il);CHKERRQ(ierr); 200 ierr = PetscFree(dk);CHKERRQ(ierr); 201 202 C->factor = FACTOR_CHOLESKY; 203 C->assembled = PETSC_TRUE; 204 C->preallocated = PETSC_TRUE; 205 PetscLogFlops(1.3333*125*b->mbs); /* from inverting diagonal blocks */ 206 PetscFunctionReturn(0); 207 } 208