Homec4science
Diffusion PHPC_final project_SLWang (master) Browse

R9010/serial/cg_blas.c
fa69394e25aemaster

Last Change
Raw File

cg_blas.c
View Options

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdbool.h>
#include "mmio_wrapper.h"
#include "util.h"
#include "parameters.h"
#include "cg.h"
#include "second.h"
/*
Implementation of a simple CG solver using matrix in the mtx format (Matrix market)
Any matrix in that format can be used to test the code
*/
int main ( int argc, char **argv ) {
double * A;
double * x;
double * b;
double t1,t2;
// Arrays and parameters to read and store the sparse matrix
double * val = NULL;
int * Irn = NULL;
int * Jcn = NULL;
int N;
int nz;
const char * element_type ="d";
int symmetrize=0;
int m,n;
struct size_m sA;
double h;
if (argc < 2)
{
fprintf(stderr, "Usage: %s [martix-market-filename]\n", argv[0]);
exit(1);
}
else
{
A = read_mat(argv[1]);
sA = get_size(argv[1]);
}
if (loadMMSparseMatrix(argv[1], *element_type, true, &N, &N, &nz, &val, &Irn, &Jcn, symmetrize)){
fprintf (stderr, "!!!! loadMMSparseMatrix FAILED\n");
return EXIT_FAILURE;
}else{
printf("Matrix loaded from file %s\n",argv[1]);
printf("N = %d \n",N);
printf("nz = %d \n",nz);
printf("val[0] = %f \n",val[0]);
}
m = sA.m;
n = sA.n;
h = 1./(double)n;
b = init_source_term(n,h);
x = (double*) malloc(n * sizeof(double));
printf("Call cgsolver() on matrix size (%d x %d)\n",m,n);
t1 = second();
cgsolver( A, b, x, m, n );
t2 = second();
printf("Time for CG (dense solver) = %f [s]\n",(t2-t1));
/**
printf("Call cgsolver_sparse() on matrix size (%d x %d)\n",m,n);
t1 = second();
cgsolver_sparse( val, Irn, Jcn, b, x, N );
t2 = second();
printf("Time for CG (sparse solver) = %f [s]\n",(t2-t1));
**/
free(A);
free(b);
free(x);
free(val);
free(Irn);
free(Jcn);
// free(x0);
return 0;
}
c4science · Help