1 #ifndef lint 2 static char vcid[] = "$Id: convert.c,v 1.25 1995/09/12 03:26:11 bsmith Exp bsmith $"; 3 #endif 4 5 /* Matrix conversion routines. For now, this supports only AIJ */ 6 7 #include "mpiaij.h" 8 9 /* Determines the block diagonals within a subset of a matrix */ 10 /* For now this is just sequential -- not parallel */ 11 12 /* 13 MatDetermineDiagonals_Private - Determines the diagonal structure 14 of a matrix. 15 16 Input Parameters: 17 . mat - the matrix 18 . nb - block size 19 . irows - rows to use 20 . icols - columns to use 21 22 Output Parameters: 23 . ndiag - number of diagonals 24 . diagonals - the diagonal numbers 25 26 Note: The user must free the diagonals array. 27 */ 28 29 int MatDetermineDiagonals_Private(Mat mat,int nb,int newr,int newc, 30 int *rowrange, int *colrange,int *ndiag, int **diagonals) 31 { 32 int nd, clast, cfirst, ierr, nnc, maxd, nz, *col, *cwork, *diag; 33 int i, j, k, jdiag, cshift, row, dnew, temp; 34 Scalar *v; 35 36 PETSCVALIDHEADERSPECIFIC(mat,MAT_COOKIE); 37 if ((newr%nb) || (newc%nb)) 38 SETERRQ(1,"MatDetermineDiagonals_Private:Invalid block size"); 39 cfirst = colrange[0]; 40 clast = colrange[newc-1]; 41 nnc = clast - cfirst + 1; 42 cwork = (int *) PETSCMALLOC( nnc * sizeof(int) ); CHKPTRQ(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 *)PETSCMALLOC( maxd * sizeof(int) ); CHKPTRQ(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 ); CHKERRQ(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 (PETSCABS(jdiag) > newr/nb) 74 { printf("ERROR jdiag\n"); } 75 } 76 } 77 j++; 78 } 79 ierr = MatRestoreRow( mat, rowrange[i], &nz, &col, &v ); CHKERRQ(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 PETSCFREE( cwork ); 92 *ndiag = nd; 93 *diagonals = diag; 94 return 0; 95 } 96 97 /* 98 MatConvert_SeqAIJ - Converts from MATSEQAIJ format to another format. For 99 parallel formats, the new matrix distribution is determined by PETSc. 100 */ 101 int MatConvert_SeqAIJ(Mat mat, MatType newtype, Mat *newmat) 102 { 103 Mat_SeqAIJ *aij = (Mat_SeqAIJ *) mat->data; 104 Scalar *vwork; 105 int i, ierr, nz, m = aij->m, n = aij->n, *cwork, rstart, rend; 106 107 switch (newtype) { 108 case MATSEQROW: 109 ierr = MatCreateSeqRow(mat->comm,m,n,0,aij->ilen,newmat); 110 CHKERRQ(ierr); break; 111 case MATMPIROW: 112 if (m != n) SETERRQ(1,"MatConvert_SeqAIJ: MPIRowbs matrix must be square"); 113 ierr = MatCreateMPIRow(MPI_COMM_WORLD,PETSC_DECIDE,PETSC_DECIDE, 114 m,n,0,0,0,0,newmat); /* Could do smarter memory allocation */ 115 CHKERRQ(ierr); break; 116 case MATMPIROWBS: 117 ierr = MatCreateMPIRowbs(MPI_COMM_WORLD,PETSC_DECIDE, 118 m,0,0,0,newmat); /* Could do smarter memory allocation */ 119 CHKERRQ(ierr); break; 120 case MATMPIAIJ: 121 ierr = MatCreateMPIAIJ(MPI_COMM_WORLD,PETSC_DECIDE,PETSC_DECIDE, 122 m,n,0,0,0,0,newmat); /* Could do smarter memory allocation */ 123 CHKERRQ(ierr); break; 124 case MATSEQDENSE: 125 ierr = MatCreateSeqDense(mat->comm,m,n,newmat); 126 CHKERRQ(ierr); break; 127 case MATSEQBDIAG: 128 { int nb = 1; /* Default block size = 1 */ 129 int ndiag, *diag, *rr, *cr; 130 rr = (int *) PETSCMALLOC( (m+n) * sizeof(int) ); CHKPTRQ(rr); 131 cr = rr + m; 132 for (i=0; i<m; i++) rr[i] = i; 133 for (i=0; i<n; i++) cr[i] = i; 134 OptionsGetInt(0,"-mat_bdiag_bsize",&nb); 135 ierr = MatDetermineDiagonals_Private(mat,nb,m,n,rr,cr,&ndiag,&diag); 136 CHKERRQ(ierr); 137 ierr = MatCreateSeqBDiag(mat->comm,m,n,ndiag,nb,diag,0,newmat); 138 CHKERRQ(ierr); 139 PETSCFREE(rr), PETSCFREE(diag); 140 break; 141 } 142 case MATMPIBDIAG: 143 { int nb = 1; /* Default block size = 1 */ 144 int ndiag, *diag, *rr, *cr; 145 rr = (int *) PETSCMALLOC( (m+n) * sizeof(int) ); CHKPTRQ(rr); 146 cr = rr + m; 147 for (i=0; i<m; i++) rr[i] = i; 148 for (i=0; i<n; i++) cr[i] = i; 149 OptionsGetInt(0,"-mat_bdiag_bsize",&nb); 150 ierr = MatDetermineDiagonals_Private(mat,nb,m,n,rr,cr,&ndiag,&diag); 151 CHKERRQ(ierr); 152 ierr = MatCreateMPIBDiag(MPI_COMM_WORLD,PETSC_DECIDE,m,n,ndiag,nb, 153 diag,0,newmat); CHKERRQ(ierr); 154 PETSCFREE(rr), PETSCFREE(diag); 155 CHKERRQ(ierr); break; 156 } 157 default: 158 SETERRQ(1,"MatConvert_SeqAIJ:Matrix type is not currently supported"); 159 } 160 ierr = MatGetOwnershipRange(*newmat,&rstart,&rend); CHKERRQ(ierr); 161 for (i=rstart; i<rend; i++) { 162 ierr = MatGetRow(mat,i,&nz,&cwork,&vwork); CHKERRQ(ierr); 163 ierr = MatSetValues(*newmat,1,&i,nz,cwork,vwork,INSERT_VALUES); 164 CHKERRQ(ierr); 165 ierr = MatRestoreRow(mat,i,&nz,&cwork,&vwork); CHKERRQ(ierr); 166 } 167 ierr = MatAssemblyBegin(*newmat,FINAL_ASSEMBLY); CHKERRQ(ierr); 168 ierr = MatAssemblyEnd(*newmat,FINAL_ASSEMBLY); CHKERRQ(ierr); 169 return 0; 170 } 171 /* ------------------------------------------------------------------ */ 172 /* 173 MatConvert_MPIAIJ - Converts from MATMPIAIJ format to another 174 parallel format. 175 */ 176 int MatConvert_MPIAIJ(Mat mat, MatType newtype, Mat *newmat) 177 { 178 Mat_MPIAIJ *aij = (Mat_MPIAIJ *) mat->data; 179 Mat_SeqAIJ *Ad = (Mat_SeqAIJ *)(aij->A->data), *Bd = (Mat_SeqAIJ *)(aij->B->data); 180 int ierr, nz, i, ig,rstart = aij->rstart, m = aij->m, *cwork; 181 Scalar *vwork; 182 183 switch (newtype) { 184 case MATMPIROW: 185 ierr = MatCreateMPIRow(mat->comm,m,aij->n,aij->M,aij->N,0,Ad->ilen, 186 0,Bd->ilen,newmat); CHKERRQ(ierr); 187 break; 188 default: 189 SETERRQ(1,"MatConvert_MPIAIJ:Only MATMPIROW is currently suported"); 190 } 191 /* Each processor converts its local rows */ 192 for (i=0; i<m; i++) { 193 ig = i + rstart; 194 ierr = MatGetRow(mat,ig,&nz,&cwork,&vwork); CHKERRQ(ierr); 195 ierr = MatSetValues(*newmat,1,&ig,nz,cwork,vwork, 196 INSERT_VALUES); CHKERRQ(ierr); 197 ierr = MatRestoreRow(mat,ig,&nz,&cwork,&vwork); CHKERRQ(ierr); 198 } 199 ierr = MatAssemblyBegin(*newmat,FINAL_ASSEMBLY); CHKERRQ(ierr); 200 ierr = MatAssemblyEnd(*newmat,FINAL_ASSEMBLY); CHKERRQ(ierr); 201 return 0; 202 } 203 204 205