1 static char help[] = "Test Mat products \n\n"; 2 3 #include <petscmat.h> 4 int main(int argc,char **args) 5 { 6 Mat A=NULL,B=NULL,C=NULL,D=NULL,E=NULL; 7 PetscErrorCode ierr; 8 PetscInt k; 9 const PetscInt M = 18,N = 18; 10 PetscMPIInt rank; 11 12 /* A, B are 18 x 18 nonsymmetric matrices and have the same sparsity pattern but different values. 13 Big enough to have complex communication patterns but still small enough for debugging. 14 */ 15 PetscInt Ai[] = {0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17}; 16 PetscInt Aj[] = {0, 1, 2, 7, 3, 8, 4, 9, 5, 8, 2, 6, 11, 0, 7, 1, 6, 2, 4, 10, 16, 11, 15, 12, 17, 12, 13, 14, 15, 17, 11, 13, 3, 16, 9, 15, 11, 13}; 17 PetscInt Bi[] = {0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17}; 18 PetscInt Bj[] = {0, 1, 2, 7, 3, 8, 4, 9, 5, 8, 2, 6, 11, 0, 7, 1, 6, 2, 4, 10, 16, 11, 15, 12, 17, 12, 13, 14, 15, 17, 11, 13, 3, 16, 9, 15, 11, 13}; 19 20 PetscInt Annz = sizeof(Ai)/sizeof(PetscInt); 21 PetscInt Bnnz = sizeof(Bi)/sizeof(PetscInt); 22 23 ierr = PetscInitialize(&argc,&args,(char*)0,help);if (ierr) return ierr; 24 ierr = MPI_Comm_rank(PETSC_COMM_WORLD,&rank);CHKERRMPI(ierr); 25 26 ierr = MatCreate(PETSC_COMM_WORLD,&A);CHKERRQ(ierr); 27 ierr = MatSetSizes(A,PETSC_DECIDE,PETSC_DECIDE,M,N); 28 ierr = MatSetFromOptions(A);CHKERRQ(ierr); 29 ierr = MatSeqAIJSetPreallocation(A,2,NULL); 30 ierr = MatMPIAIJSetPreallocation(A,2,NULL,2,NULL);CHKERRQ(ierr); 31 ierr = MatSetOption(A,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr); 32 33 if (rank == 0) { 34 for (k=0; k<Annz; k++) {ierr = MatSetValue(A,Ai[k],Aj[k],Ai[k]+Aj[k]+1.0,INSERT_VALUES);CHKERRQ(ierr);} 35 } 36 37 ierr = MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 38 ierr = MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 39 40 ierr = MatCreate(PETSC_COMM_WORLD,&B);CHKERRQ(ierr); 41 ierr = MatSetSizes(B,PETSC_DECIDE,PETSC_DECIDE,M,N); 42 ierr = MatSetFromOptions(B);CHKERRQ(ierr); 43 ierr = MatSeqAIJSetPreallocation(B,2,NULL); 44 ierr = MatMPIAIJSetPreallocation(B,2,NULL,2,NULL);CHKERRQ(ierr); 45 ierr = MatSetOption(B,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr); 46 47 if (rank == 0) { 48 for (k=0; k<Bnnz; k++) {ierr = MatSetValue(B,Bi[k],Bj[k],Bi[k]+Bj[k]+2.0,INSERT_VALUES);CHKERRQ(ierr);} 49 } 50 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 51 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 52 53 ierr = MatMatMult(A,B,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&C);CHKERRQ(ierr); 54 ierr = MatView(C,PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 55 56 /* B, A have the same nonzero pattern, so it is legitimate to do so */ 57 ierr = MatMatMult(B,A,MAT_REUSE_MATRIX,PETSC_DEFAULT,&C);CHKERRQ(ierr); 58 ierr = MatView(C,PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 59 60 ierr = MatTransposeMatMult(A,B,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&D);CHKERRQ(ierr); 61 ierr = MatView(D, PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 62 63 ierr = MatPtAP(A,B,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&E);CHKERRQ(ierr); 64 ierr = MatView(E,PETSC_VIEWER_STDOUT_WORLD);CHKERRQ(ierr); 65 66 ierr = MatDestroy(&A);CHKERRQ(ierr); 67 ierr = MatDestroy(&B);CHKERRQ(ierr); 68 ierr = MatDestroy(&C);CHKERRQ(ierr); 69 ierr = MatDestroy(&D);CHKERRQ(ierr); 70 ierr = MatDestroy(&E);CHKERRQ(ierr); 71 72 ierr = PetscFinalize(); 73 return ierr; 74 } 75 76 /*TEST 77 testset: 78 filter: grep -ve type -ve "Mat Object" 79 output_file: output/ex250_1.out 80 81 test: 82 suffix: 1 83 nsize: {{1 3}} 84 args: -mat_type aij 85 86 test: 87 suffix: 2 88 nsize: {{3 4}} 89 args: -mat_type aij -matmatmult_via backend -matptap_via backend -mattransposematmult_via backend 90 91 test: 92 suffix: cuda 93 requires: cuda 94 nsize: {{1 3 4}} 95 args: -mat_type aijcusparse 96 97 test: 98 suffix: kok 99 requires: !sycl kokkos_kernels 100 nsize: {{1 3 4}} 101 args: -mat_type aijkokkos 102 103 TEST*/ 104 105