1c4762a1bSJed Brown 2c4762a1bSJed Brown static char help[] = "Extract submatrices using unsorted indices. For SEQSBAIJ either sort both rows and columns, or sort none.\n\n"; 3c4762a1bSJed Brown /* 4c4762a1bSJed Brown Take a 4x4 grid and form a 5-point stencil graph Laplacian over it. 5c4762a1bSJed Brown Partition the grid into two subdomains by splitting into two in the j-direction (slowest varying). 6c4762a1bSJed Brown Impose an overlap of 1 and order the subdomains with the j-direction varying fastest. 7c4762a1bSJed Brown Extract the subdomain submatrices, one per rank. 8c4762a1bSJed Brown */ 9c4762a1bSJed Brown /* Results: 10c4762a1bSJed Brown Sequential: 11c4762a1bSJed Brown - seqaij: will error out, if rows or columns are unsorted 12c4762a1bSJed Brown - seqbaij: will extract submatrices correctly even for unsorted row or column indices 13c4762a1bSJed Brown - seqsbaij: will extract submatrices correctly even for unsorted row and column indices (both must be sorted or not); 14c4762a1bSJed Brown CANNOT automatically report inversions, because MatGetRow is not available. 15c4762a1bSJed Brown MPI: 16c4762a1bSJed Brown - mpiaij: will error out, if columns are unsorted 17c4762a1bSJed Brown - mpibaij: will error out, if columns are unsorted. 18c4762a1bSJed Brown - mpisbaij: will error out, if columns are unsorted; even with unsorted rows will produce correct submatrices; 19c4762a1bSJed Brown CANNOT automatically report inversions, because MatGetRow is not available. 20c4762a1bSJed Brown */ 21c4762a1bSJed Brown 22c4762a1bSJed Brown #include <petscmat.h> 23c4762a1bSJed Brown #include <petscis.h> 24c4762a1bSJed Brown 25c4762a1bSJed Brown int main(int argc,char **args) 26c4762a1bSJed Brown { 27c4762a1bSJed Brown Mat A, *S; 28c4762a1bSJed Brown IS rowis[2], colis[2]; 29c4762a1bSJed Brown PetscInt n,N,i,j,k,l,nsub,Jlow[2] = {0,1}, *jlow, Jhigh[2] = {3,4}, *jhigh, row, col, *subindices, ncols; 30c4762a1bSJed Brown const PetscInt *cols; 31c4762a1bSJed Brown PetscScalar v; 32c4762a1bSJed Brown PetscMPIInt rank, size, p, inversions, total_inversions; 33c4762a1bSJed Brown PetscBool sort_rows, sort_cols, show_inversions; 34c4762a1bSJed Brown PetscErrorCode ierr; 35c4762a1bSJed Brown 36c4762a1bSJed Brown ierr = PetscInitialize(&argc,&args,(char*)0,help);if (ierr) return ierr; 37*5f80ce2aSJacob Faibussowitsch CHKERRMPI(MPI_Comm_rank(PETSC_COMM_WORLD,&rank)); 38*5f80ce2aSJacob Faibussowitsch CHKERRMPI(MPI_Comm_size(PETSC_COMM_WORLD,&size)); 392c71b3e2SJacob Faibussowitsch PetscCheckFalse(size>2,PETSC_COMM_WORLD,PETSC_ERR_ARG_WRONG, "A uniprocessor or two-processor example only."); 40c4762a1bSJed Brown 41*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatCreate(PETSC_COMM_WORLD,&A)); 42c4762a1bSJed Brown if (size > 1) { 43c4762a1bSJed Brown n = 8; N = 16; 44c4762a1bSJed Brown } else { 45c4762a1bSJed Brown n = 16; N = 16; 46c4762a1bSJed Brown } 47*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetSizes(A,n,n,N,N)); 48*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetFromOptions(A)); 49*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetUp(A)); 50c4762a1bSJed Brown 51c4762a1bSJed Brown /* Don't care if the entries are set multiple times by different procs. */ 52c4762a1bSJed Brown for (i=0; i<4; ++i) { 53c4762a1bSJed Brown for (j = 0; j<4; ++j) { 54c4762a1bSJed Brown row = j*4+i; 55c4762a1bSJed Brown v = -1.0; 56c4762a1bSJed Brown if (i>0) { 57*5f80ce2aSJacob Faibussowitsch col = row-1; CHKERRQ(MatSetValues(A,1,&row,1,&col,&v,INSERT_VALUES)); 58c4762a1bSJed Brown } 59c4762a1bSJed Brown if (i<3) { 60*5f80ce2aSJacob Faibussowitsch col = row+1; CHKERRQ(MatSetValues(A,1,&row,1,&col,&v,INSERT_VALUES)); 61c4762a1bSJed Brown } 62c4762a1bSJed Brown if (j>0) { 63*5f80ce2aSJacob Faibussowitsch col = row-4; CHKERRQ(MatSetValues(A,1,&row,1,&col,&v,INSERT_VALUES)); 64c4762a1bSJed Brown } 65c4762a1bSJed Brown if (j<3) { 66*5f80ce2aSJacob Faibussowitsch col = row+4; CHKERRQ(MatSetValues(A,1,&row,1,&col,&v,INSERT_VALUES)); 67c4762a1bSJed Brown } 68c4762a1bSJed Brown v = 4.0; 69*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetValues(A,1,&row,1,&row,&v,INSERT_VALUES)); 70c4762a1bSJed Brown } 71c4762a1bSJed Brown } 72*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY)); 73*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY)); 74*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_WORLD, "Original matrix\n")); 75*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatView(A,PETSC_VIEWER_STDOUT_WORLD)); 76c4762a1bSJed Brown 77c4762a1bSJed Brown if (size > 1) { 78c4762a1bSJed Brown nsub = 1; /* one subdomain per rank */ 79c4762a1bSJed Brown } 80c4762a1bSJed Brown else { 81c4762a1bSJed Brown nsub = 2; /* both subdomains on rank 0 */ 82c4762a1bSJed Brown } 83c4762a1bSJed Brown if (rank) { 84c4762a1bSJed Brown jlow = Jlow+1; jhigh = Jhigh+1; 85c4762a1bSJed Brown } 86c4762a1bSJed Brown else { 87c4762a1bSJed Brown jlow = Jlow; jhigh = Jhigh; 88c4762a1bSJed Brown } 89c4762a1bSJed Brown sort_rows = PETSC_FALSE; 90*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscOptionsGetBool(NULL,NULL, "-sort_rows", &sort_rows, NULL)); 91c4762a1bSJed Brown sort_cols = PETSC_FALSE; 92*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscOptionsGetBool(NULL,NULL, "-sort_cols", &sort_cols, NULL)); 93c4762a1bSJed Brown for (l = 0; l < nsub; ++l) { 94*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscMalloc1(12, &subindices)); 95c4762a1bSJed Brown k = 0; 96c4762a1bSJed Brown for (i = 0; i < 4; ++i) { 97c4762a1bSJed Brown for (j = jlow[l]; j < jhigh[l]; ++j) { 98c4762a1bSJed Brown subindices[k] = j*4+i; 99c4762a1bSJed Brown k++; 100c4762a1bSJed Brown } 101c4762a1bSJed Brown } 102*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISCreateGeneral(PETSC_COMM_SELF, 12, subindices, PETSC_OWN_POINTER, rowis+l)); 103c4762a1bSJed Brown if ((sort_rows && !sort_cols) || (!sort_rows && sort_cols)) { 104*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISDuplicate(rowis[l],colis+l)); 105c4762a1bSJed Brown } else { 106*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscObjectReference((PetscObject)rowis[l])); 107c4762a1bSJed Brown colis[l] = rowis[l]; 108c4762a1bSJed Brown } 109c4762a1bSJed Brown if (sort_rows) { 110*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISSort(rowis[l])); 111c4762a1bSJed Brown } 112c4762a1bSJed Brown if (sort_cols) { 113*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISSort(colis[l])); 114c4762a1bSJed Brown } 115c4762a1bSJed Brown } 116c4762a1bSJed Brown 117*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatCreateSubMatrices(A,nsub,rowis,colis,MAT_INITIAL_MATRIX, &S)); 118c4762a1bSJed Brown 119c4762a1bSJed Brown show_inversions = PETSC_FALSE; 120c4762a1bSJed Brown 121*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscOptionsGetBool(NULL,NULL, "-show_inversions", &show_inversions, NULL)); 122c4762a1bSJed Brown 123c4762a1bSJed Brown inversions = 0; 124c4762a1bSJed Brown for (p = 0; p < size; ++p) { 125c4762a1bSJed Brown if (p == rank) { 126*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_SELF, "[%" PetscInt_FMT ":%" PetscInt_FMT "]: Number of subdomains: %" PetscInt_FMT ":\n", rank, size, nsub)); 127c4762a1bSJed Brown for (l = 0; l < nsub; ++l) { 128c4762a1bSJed Brown PetscInt i0, i1; 129*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_SELF, "[%" PetscInt_FMT ":%" PetscInt_FMT "]: Subdomain row IS %" PetscInt_FMT ":\n", rank, size, l)); 130*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISView(rowis[l],PETSC_VIEWER_STDOUT_SELF)); 131*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_SELF, "[%" PetscInt_FMT ":%" PetscInt_FMT "]: Subdomain col IS %" PetscInt_FMT ":\n", rank, size, l)); 132*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISView(colis[l],PETSC_VIEWER_STDOUT_SELF)); 133*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_SELF, "[%" PetscInt_FMT ":%" PetscInt_FMT "]: Submatrix %" PetscInt_FMT ":\n", rank, size, l)); 134*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatView(S[l],PETSC_VIEWER_STDOUT_SELF)); 135c4762a1bSJed Brown if (show_inversions) { 136*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatGetOwnershipRange(S[l], &i0,&i1)); 137c4762a1bSJed Brown for (i = i0; i < i1; ++i) { 138*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatGetRow(S[l], i, &ncols, &cols, NULL)); 139c4762a1bSJed Brown for (j = 1; j < ncols; ++j) { 140c4762a1bSJed Brown if (cols[j] < cols[j-1]) { 141*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_SELF, "***Inversion in row %" PetscInt_FMT ": col[%" PetscInt_FMT "] = %" PetscInt_FMT " < %" PetscInt_FMT " = col[%" PetscInt_FMT "]\n", i, j, cols[j], cols[j-1], j-1)); 142c4762a1bSJed Brown inversions++; 143c4762a1bSJed Brown } 144c4762a1bSJed Brown } 145*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatRestoreRow(S[l], i, &ncols, &cols, NULL)); 146c4762a1bSJed Brown } 147c4762a1bSJed Brown } 148c4762a1bSJed Brown } 149c4762a1bSJed Brown } 150*5f80ce2aSJacob Faibussowitsch CHKERRMPI(MPI_Barrier(PETSC_COMM_WORLD)); 151c4762a1bSJed Brown } 152c4762a1bSJed Brown if (show_inversions) { 153*5f80ce2aSJacob Faibussowitsch CHKERRMPI(MPI_Reduce(&inversions,&total_inversions,1,MPIU_INT, MPI_SUM,0,PETSC_COMM_WORLD)); 154*5f80ce2aSJacob Faibussowitsch CHKERRQ(PetscPrintf(PETSC_COMM_WORLD, "*Total inversions: %" PetscInt_FMT "\n", total_inversions)); 155c4762a1bSJed Brown } 156*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatDestroy(&A)); 157c4762a1bSJed Brown 158c4762a1bSJed Brown for (l = 0; l < nsub; ++l) { 159*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISDestroy(&(rowis[l]))); 160*5f80ce2aSJacob Faibussowitsch CHKERRQ(ISDestroy(&(colis[l]))); 161c4762a1bSJed Brown } 162*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatDestroySubMatrices(nsub,&S)); 163c4762a1bSJed Brown ierr = PetscFinalize(); 164c4762a1bSJed Brown return ierr; 165c4762a1bSJed Brown } 166