Actual source code: test18.c
slepc-3.18.2 2023-01-26
1: /*
2: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
3: SLEPc - Scalable Library for Eigenvalue Problem Computations
4: Copyright (c) 2002-, Universitat Politecnica de Valencia, Spain
6: This file is part of SLEPc.
7: SLEPc is distributed under a 2-clause BSD license (see LICENSE).
8: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
9: */
11: static char help[] = "Test DSSynchronize() on a NHEP.\n\n";
13: #include <slepcds.h>
15: PetscErrorCode CheckArray(PetscScalar *A,const char *label,PetscInt k)
16: {
17: PetscInt j;
18: PetscMPIInt p,size,rank;
19: PetscScalar dif,*buf;
20: PetscReal error;
23: MPI_Comm_size(PETSC_COMM_WORLD,&size);
24: MPI_Comm_rank(PETSC_COMM_WORLD,&rank);
25: if (rank) MPI_Send(A,k,MPIU_SCALAR,0,111,PETSC_COMM_WORLD);
26: else {
27: PetscMalloc1(k,&buf);
28: for (p=1;p<size;p++) {
29: MPI_Recv(buf,k,MPIU_SCALAR,p,111,PETSC_COMM_WORLD,MPI_STATUS_IGNORE);
30: dif = 0.0;
31: for (j=0;j<k;j++) dif += A[j]-buf[j];
32: error = PetscAbsScalar(dif);
33: if (error>10*PETSC_MACHINE_EPSILON) PetscPrintf(PETSC_COMM_WORLD," Array %s differs in proc %d: %g\n",label,(int)p,(double)error);
34: }
35: PetscFree(buf);
36: }
37: return 0;
38: }
40: int main(int argc,char **argv)
41: {
42: DS ds;
43: SlepcSC sc;
44: PetscScalar *A,*Q,*wr,*wi;
45: PetscReal re,im;
46: PetscInt i,j,n=10;
47: PetscMPIInt size;
50: SlepcInitialize(&argc,&argv,(char*)0,help);
51: PetscOptionsGetInt(NULL,NULL,"-n",&n,NULL);
52: PetscPrintf(PETSC_COMM_WORLD,"Solve a Dense System of type NHEP - dimension %" PetscInt_FMT ".\n",n);
54: /* Create DS object */
55: DSCreate(PETSC_COMM_WORLD,&ds);
56: DSSetType(ds,DSNHEP);
57: DSSetFromOptions(ds);
58: DSAllocate(ds,n);
59: DSSetDimensions(ds,n,0,0);
61: /* Fill with Grcar matrix */
62: DSGetArray(ds,DS_MAT_A,&A);
63: for (i=1;i<n;i++) A[i+(i-1)*n]=-1.0;
64: for (j=0;j<4;j++) {
65: for (i=0;i<n-j;i++) A[i+(i+j)*n]=1.0;
66: }
67: DSRestoreArray(ds,DS_MAT_A,&A);
68: DSSetState(ds,DS_STATE_INTERMEDIATE);
70: /* Solve */
71: PetscMalloc2(n,&wr,n,&wi);
72: DSGetSlepcSC(ds,&sc);
73: sc->comparison = SlepcCompareLargestMagnitude;
74: sc->comparisonctx = NULL;
75: sc->map = NULL;
76: sc->mapobj = NULL;
77: DSSolve(ds,wr,wi);
78: DSSort(ds,wr,wi,NULL,NULL,NULL);
80: /* Print eigenvalues */
81: PetscPrintf(PETSC_COMM_WORLD,"Computed eigenvalues =\n");
82: for (i=0;i<n;i++) {
83: #if defined(PETSC_USE_COMPLEX)
84: re = PetscRealPart(wr[i]);
85: im = PetscImaginaryPart(wr[i]);
86: #else
87: re = wr[i];
88: im = wi[i];
89: #endif
90: if (PetscAbs(im)<1e-10) PetscPrintf(PETSC_COMM_WORLD," %.5f\n",(double)re);
91: else PetscPrintf(PETSC_COMM_WORLD," %.5f%+.5fi\n",(double)re,(double)im);
92: }
94: /* Synchronize data and check */
95: DSSynchronize(ds,wr,wi);
96: MPI_Comm_size(PETSC_COMM_WORLD,&size);
97: if (size>1) {
98: CheckArray(wr,"wr",n);
99: #if !defined(PETSC_USE_COMPLEX)
100: CheckArray(wi,"wi",n);
101: #endif
102: DSGetArray(ds,DS_MAT_A,&A);
103: CheckArray(A,"A",n*n);
104: DSRestoreArray(ds,DS_MAT_A,&A);
105: DSGetArray(ds,DS_MAT_Q,&Q);
106: CheckArray(Q,"Q",n*n);
107: DSRestoreArray(ds,DS_MAT_Q,&Q);
108: }
110: PetscFree2(wr,wi);
111: DSDestroy(&ds);
112: SlepcFinalize();
113: return 0;
114: }
116: /*TEST
118: testset:
119: nsize: {{1 2 3}}
120: filter: sed -e "s/[+-]\([0-9]\.[0-9]*i\)/+-\\1/" | sed -e "s/1.58254/1.58255/" | sed -e "s/1.75989/1.75988/"
121: output_file: output/test18_1.out
122: test:
123: suffix: 1
124: args: -ds_parallel redundant
125: test:
126: suffix: 2
127: args: -ds_parallel synchronized
129: TEST*/