矩阵求逆的并行算法.docVIP

.矩阵求逆的并行算法： #include stdio.h #include stdlib.h #include mpi.h #define intsize sizeof(int) #define floatsize sizeof(float) #define A(x,y) A[x*N+y] #define Q(x,y) Q[x*N+y] #define a(x,y) a[x*N+y] #define f(x) f[x] float *A,*Q; float *a,*f; int N,v,m; int p; int myid; MPI_Status status; FILE *dataFile; double starttime,endtime,time1; void readData() { int i,j; starttime = MPI_Wtime(); dataFile = fopen(dataIn.txt,r); fscanf(dataFile,%d,N); A = (float *)malloc(floatsize*N*N); for(i = 0; i N; i++) { for(j = 0; j N; j++)