/* Solution of hw1 with OpenMP */

#include "omp.h"
#include "math.h"
#include <stdio.h>


/* All this is part of the student's work */

void power_distribute(double *A, double *b, long n);
void power_method(long k);
double power_answer(void);

int main(int argc, char *argv[])
{
  int i=0, n=4;

  double *A, *b, norm_b;
  
  /* Create the matrix on the first node */
  A = (double *) malloc (n * n * sizeof(double));
  b = (double *) malloc (n * sizeof(double));
  
  if (NULL == A || NULL == b){
    printf ("Rank 0 has a problem with allocating memory\n");
    exit (-1);
  }
      
  for (i=0; i<n*n; i++){
    A[i] = i;
  }
  
  for (i=0; i<n; i++){
    b[i] = i+1;
  }

  /* Initialize the matrix using my matrix */
  power_distribute(A, b, n);
  
  /* Invoke the power method on it.  100 times */
  power_method(100);

  norm_b = power_answer();

  printf ("norm(b) = %e\n", norm_b);

  return 0;
}