1 #ifndef lint 2 static char vcid[] = "$Id: convert.c,v 1.17 1995/05/18 22:46:31 bsmith Exp curfman $"; 3 #endif 4 5 /* Matrix conversion routines. For now, this supports only AIJ */ 6 7 #include "mpiaij.h" 8 #define ABS(a) ((a > 0) ? a : -a) 9 10 /* Determines the block diagonals within a subset of a matrix */ 11 /* For now this is just sequential -- not parallel */ 12 13 /* 14 MatDetermineDiagonals_Private - Determines the diagonal structure 15 of a matrix. 16 17 Input Parameters: 18 . mat - the matrix 19 . nb - block size 20 . irows - rows to use 21 . icols - columns to use 22 23 Output Parameters: 24 . ndiag - number of diagonals 25 . diagonals - the diagonal numbers 26 27 Note: The user must free the diagonals array. 28 */ 29 30 int MatDetermineDiagonals_Private(Mat mat,int nb,int newr,int newc, 31 int *rowrange, int *colrange,int *ndiag, int **diagonals) 32 { 33 int nd, clast, cfirst, ierr, nnc, maxd, nz, *col, *cwork, *diag; 34 int i, j, k, jdiag, cshift, row, dnew, temp; 35 Scalar *v; 36 37 VALIDHEADER(mat,MAT_COOKIE); 38 if ((newr%nb) || (newc%nb)) SETERR(1,"Invalid block size."); 39 cfirst = colrange[0]; 40 clast = colrange[newc-1]; 41 nnc = clast - cfirst + 1; 42 cwork = (int *) MALLOC( nnc * sizeof(int) ); CHKPTR(cwork); 43 for (i=0; i<nnc; i++) cwork[i] = -1; 44 for (i=0; i<newc; i++) cwork[colrange[i]-cfirst] = i; 45 46 /* Determine which diagonals exist: compute nd, diag[]: */ 47 /* Temporarily ssume diag[0] = 0 (main diagonal) */ 48 maxd = newr + newc - 1; /* maximum possible diagonals */ 49 diag = (int *)MALLOC( maxd * sizeof(int) ); CHKPTR(diag); 50 nd = 1; 51 for (i=0; i<maxd; i++) diag[i] = 0; 52 for (i=0; i<newr; i++) { 53 ierr = MatGetRow( mat, rowrange[i], &nz, &col, &v ); CHKERR(ierr); 54 row = i; 55 j = 0; 56 /* Skip values until we reach the first column */ 57 while (j < nz && col[j] < cfirst) j++; 58 while (j < nz) { 59 if (clast < col[j]) break; 60 cshift = cwork[col[j] - cfirst]; 61 if (cshift >= 0) { 62 /* Determine if diagonal block already exits for valid colum */ 63 dnew = 1; 64 jdiag = row/nb - cshift/nb; 65 for (k=0; k<nd; k++) { 66 if (diag[k] == jdiag) { /* diagonal exists */ 67 dnew = 0; break; 68 } 69 } 70 if (dnew) { 71 diag[nd] = jdiag; 72 nd++; 73 if (ABS(jdiag) > newr/nb) 74 { printf("ERROR jdiag\n"); } 75 } 76 } 77 j++; 78 } 79 ierr = MatRestoreRow( mat, rowrange[i], &nz, &col, &v ); CHKERR(ierr); 80 } 81 /* Sort diagonals in decreasing order. */ 82 for (k=0; k<nd; k++) { 83 for (j=k+1; j<nd; j++) { 84 if (diag[k] < diag[j]) { 85 temp = diag[k]; 86 diag[k] = diag[j]; 87 diag[j] = temp; 88 } 89 } 90 } 91 FREE( cwork ); 92 *ndiag = nd; 93 *diagonals = diag; 94 return 0; 95 } 96 97 /* 98 MatConvert_AIJ - Converts from MATAIJ format to another format. For 99 parallel formats, the new matrix distribution is determined by PETSc. 100 */ 101 int MatConvert_AIJ(Mat mat, MatType newtype, Mat *newmat) 102 { 103 Mat_AIJ *aij = (Mat_AIJ *) mat->data; 104 Scalar *vwork; 105 int i, ierr, nz, m = aij->m, n = aij->n, *cwork, rstart, rend; 106 107 if (mat->type != MATAIJ) SETERR(1,"Input matrix must be MATAIJ."); 108 switch (newtype) { 109 case MATROW: 110 ierr = MatCreateSequentialRow(mat->comm,m,n,0,aij->ilen,newmat); 111 CHKERR(ierr); break; 112 case MATMPIROW: 113 ierr = MatCreateMPIRow(MPI_COMM_WORLD,PETSC_DECIDE,PETSC_DECIDE, 114 m,n,0,0,0,0,newmat); /* Could do smarter memory allocation */ 115 CHKERR(ierr); break; 116 case MATMPIAIJ: 117 ierr = MatCreateMPIAIJ(MPI_COMM_WORLD,PETSC_DECIDE,PETSC_DECIDE, 118 m,n,0,0,0,0,newmat); /* Could do smarter memory allocation */ 119 CHKERR(ierr); break; 120 case MATDENSE: 121 ierr = MatCreateSequentialDense(mat->comm,m,n,newmat); 122 CHKERR(ierr); break; 123 case MATBDIAG: 124 { int nb = 1; /* Default block size = 1 */ 125 int ndiag, *diag, *rr, *cr; 126 rr = (int *) MALLOC( (m+n) * sizeof(int) ); CHKPTR(rr); 127 cr = rr + m; 128 for (i=0; i<m; i++) rr[i] = i; 129 for (i=0; i<n; i++) cr[i] = i; 130 OptionsGetInt(0,"-mat_bdiag_bsize",&nb); 131 ierr = MatDetermineDiagonals_Private(mat,nb,m,n,rr,cr,&ndiag,&diag); 132 CHKERR(ierr); 133 ierr = MatCreateSequentialBDiag(mat->comm,m,n,ndiag,nb,diag,0,newmat); 134 CHKERR(ierr); 135 FREE(rr), FREE(diag); 136 break; 137 } 138 case MATMPIBDIAG: 139 { int nb = 1; /* Default block size = 1 */ 140 int ndiag, *diag, *rr, *cr; 141 rr = (int *) MALLOC( (m+n) * sizeof(int) ); CHKPTR(rr); 142 cr = rr + m; 143 for (i=0; i<m; i++) rr[i] = i; 144 for (i=0; i<n; i++) cr[i] = i; 145 OptionsGetInt(0,"-mat_bdiag_bsize",&nb); 146 ierr = MatDetermineDiagonals_Private(mat,nb,m,n,rr,cr,&ndiag,&diag); 147 CHKERR(ierr); 148 ierr = MatCreateMPIBDiag(MPI_COMM_WORLD,PETSC_DECIDE,m,n,ndiag,nb, 149 diag,0,newmat); CHKERR(ierr); 150 FREE(rr), FREE(diag); 151 CHKERR(ierr); break; 152 } 153 default: 154 SETERR(1,"Matrix type is not currently supported."); 155 } 156 ierr = MatGetOwnershipRange(*newmat,&rstart,&rend); CHKERR(ierr); 157 for (i=rstart; i<rend; i++) { 158 ierr = MatGetRow(mat,i,&nz,&cwork,&vwork); CHKERR(ierr); 159 ierr = MatSetValues(*newmat,1,&i,nz,cwork,vwork,INSERTVALUES); 160 CHKERR(ierr); 161 ierr = MatRestoreRow(mat,i,&nz,&cwork,&vwork); CHKERR(ierr); 162 } 163 ierr = MatAssemblyBegin(*newmat,FINAL_ASSEMBLY); CHKERR(ierr); 164 ierr = MatAssemblyEnd(*newmat,FINAL_ASSEMBLY); CHKERR(ierr); 165 return 0; 166 } 167 /* ------------------------------------------------------------------ */ 168 /* 169 MatConvert_MPIAIJ - Converts from MATMPIAIJ format to another 170 parallel format. 171 */ 172 int MatConvert_MPIAIJ(Mat mat, MatType newtype, Mat *newmat) 173 { 174 Mat_MPIAIJ *aij = (Mat_MPIAIJ *) mat->data; 175 Mat_AIJ *Ad = (Mat_AIJ *)(aij->A->data), *Bd = (Mat_AIJ *)(aij->B->data); 176 int ierr, nz, i, ig,rstart = aij->rstart, m = aij->m, *cwork; 177 Scalar *vwork; 178 179 if (mat->type != MATMPIAIJ) SETERR(1,"Input matrix must be MATMPIAIJ."); 180 switch (newtype) { 181 case MATMPIROW: 182 for (i=0; i<m; i++) 183 {ierr = MatCreateMPIRow(mat->comm,m,aij->n,aij->M,aij->N,0,Ad->ilen, 184 0,Bd->ilen,newmat); CHKERR(ierr); } 185 break; 186 default: 187 SETERR(1,"Only MATMPIROW is currently suported."); 188 } 189 /* Each processor converts its local rows */ 190 for (i=0; i<m; i++) { 191 ig = i + rstart; 192 ierr = MatGetRow(mat,ig,&nz,&cwork,&vwork); CHKERR(ierr); 193 ierr = MatSetValues(*newmat,1,&ig,nz,cwork,vwork, 194 INSERTVALUES); CHKERR(ierr); 195 ierr = MatRestoreRow(mat,ig,&nz,&cwork,&vwork); CHKERR(ierr); 196 } 197 ierr = MatAssemblyBegin(*newmat,FINAL_ASSEMBLY); CHKERR(ierr); 198 ierr = MatAssemblyEnd(*newmat,FINAL_ASSEMBLY); CHKERR(ierr); 199 return 0; 200 } 201