/* Inverts 7 by 7 matrix using partial pivoting. Used by the sparse factorization routines in src/mat/impls/baij/seq This is a combination of the Linpack routines dgefa() and dgedi() specialized for a size of 7. */ #include #undef __FUNCT__ #define __FUNCT__ "PetscKernel_A_gets_inverse_A_7" PetscErrorCode PetscKernel_A_gets_inverse_A_7(MatScalar *a,PetscReal shift) { PetscInt i__2,i__3,kp1,j,k,l,ll,i,ipvt[7],kb,k3; PetscInt k4,j3; MatScalar *aa,*ax,*ay,work[49],stmp; MatReal tmp,max; /* gaussian elimination with partial pivoting */ PetscFunctionBegin; shift = .25*shift*(1.e-12 + PetscAbsScalar(a[0]) + PetscAbsScalar(a[8]) + PetscAbsScalar(a[16]) + PetscAbsScalar(a[24]) + PetscAbsScalar(a[32]) + PetscAbsScalar(a[40]) + PetscAbsScalar(a[48])); /* Parameter adjustments */ a -= 8; for (k = 1; k <= 6; ++k) { kp1 = k + 1; k3 = 7*k; k4 = k3 + k; /* find l = pivot index */ i__2 = 8 - k; aa = &a[k4]; max = PetscAbsScalar(aa[0]); l = 1; for (ll=1; ll max) { max = tmp; l = ll+1;} } l += k - 1; ipvt[k-1] = l; if (a[l + k3] == 0.0) { if (shift == 0.0) { SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_MAT_LU_ZRPVT,"Zero pivot, row %D",k-1); } else { /* SHIFT is applied to SINGLE diagonal entry; does this make any sense? */ a[l + k3] = shift; } } /* interchange if necessary */ if (l != k) { stmp = a[l + k3]; a[l + k3] = a[k4]; a[k4] = stmp; } /* compute multipliers */ stmp = -1. / a[k4]; i__2 = 7 - k; aa = &a[1 + k4]; for (ll=0; ll