1c4762a1bSJed Brown 2c4762a1bSJed Brown static char help[] = "Test saving SeqSBAIJ matrix that is missing diagonal entries."; 3c4762a1bSJed Brown 4c4762a1bSJed Brown #include <petscmat.h> 5c4762a1bSJed Brown 6c4762a1bSJed Brown int main(int argc,char **args) 7c4762a1bSJed Brown { 8c4762a1bSJed Brown Mat A; 9c4762a1bSJed Brown PetscInt bs=3,m=4,i,j,val = 10,row[2],col[3],rstart; 10c4762a1bSJed Brown PetscErrorCode ierr; 11c4762a1bSJed Brown PetscMPIInt size; 12c4762a1bSJed Brown PetscScalar x[6][9]; 13c4762a1bSJed Brown 14c4762a1bSJed Brown ierr = PetscInitialize(&argc,&args,(char*)0,help);if (ierr) return ierr; 15*5f80ce2aSJacob Faibussowitsch CHKERRMPI(MPI_Comm_size(PETSC_COMM_WORLD,&size)); 162c71b3e2SJacob Faibussowitsch PetscCheckFalse(size > 1,PETSC_COMM_WORLD,PETSC_ERR_SUP,"Test is only for sequential"); 17*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatCreateSeqSBAIJ(PETSC_COMM_SELF,bs,m*bs,m*bs,1,NULL,&A)); 18*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetOption(A,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE)); 19c4762a1bSJed Brown rstart = 0; 20c4762a1bSJed Brown 21c4762a1bSJed Brown row[0] =rstart+0; row[1] =rstart+2; 22c4762a1bSJed Brown col[0] =rstart+0; col[1] =rstart+1; col[2] =rstart+3; 23c4762a1bSJed Brown for (i=0; i<6; i++) { 24c4762a1bSJed Brown for (j =0; j< 9; j++) x[i][j] = (PetscScalar)val++; 25c4762a1bSJed Brown } 26*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatSetValuesBlocked(A,2,row,3,col,&x[0][0],INSERT_VALUES)); 27*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY)); 28*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY)); 29*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatView(A,PETSC_VIEWER_BINARY_WORLD)); 30c4762a1bSJed Brown 31*5f80ce2aSJacob Faibussowitsch CHKERRQ(MatDestroy(&A)); 32c4762a1bSJed Brown ierr = PetscFinalize(); 33c4762a1bSJed Brown return ierr; 34c4762a1bSJed Brown } 35