pressure.h

Go to the documentation of this file.

#ifndef PRESSURE_H
#define PRESSURE_H

#include <iostream>
#include <string>
#include <cmath>
#include "petscksp.h"
#include "PetscLinearSolver.h"
using namespace std;

#ifdef SINGLE
#define real float
#else
#define real double
#endif


class pressure {

 public:

  pressure();

  void initialize(int numberOfPatches, 
                  int cellNumberPerPatch, 
                  int ** StartIndex, 
                  int ** pointNumberMeshP, 
                  int dimension,
                  real ***xP, 
                  real *h,
                  real ****fp, 
                  real ****exactPressure, 
                  int ****pUnknowns,
                  real ****p,
                  int ****pCagePoint,
                  PetscLinearSolver &pSolver,
                  int &zeroInitialGuess
                  );
  ~pressure();
  
 private: 

  void coarseGhostPoint(real *h,
                        real ****fp);
  void fineGhostPoint(real ix, // 0 for odd; 1 for even in x direction
                      real iy, // 0 for odd; 1 for even in y direction
                      real iz, // 0 for odd; 1 for even in z direction
                      real *h,
                      real ****fp);
 
  int * allocate1dIntArray(int size);
  int **** allocate4dIntArray(int nMeshes, int **pointNumberMesh);
  real * allocate1dRealArray(int size);
  real ** allocateValueMatrix();
  int ** allocateColumnMatrix();

  void deleteMatrix(real **x, int n);
  void delete4dArray(int ****x, int nMeshes, int **pointNumberMesh);
  void delete1dArray(real *x);
  void delete1dArray(int *x);
  void deleteMatrix(real **x);
  void deleteMatrix(int **x);

  void deallocateMemory(int ** pointNumberMesh);
 // total points in coarse mesh inside the patch not included
  int n; // total number of unknowns

  int nStencil; // total number of unknowns

  int dim;

  // all points including in the original coarse and mesh points.
  // including points considerred in the linear system and those unconsiderred
  int originalTotalPoints;

  // iRHS for index in matrix A = totalUnknowns x totalUnknowns
  // jRHS
  int i, j, k;

  int ib; //dummy index for b=RHS
  int iD; //dummy index for anything

  int iFine, jFine, kFine;
  int iWSB, iESB,iWNB,iENB; // four bottom corners
  int iWST, iEST,iWNT,iENT; // four top corners

  // m for mesh iteration: meshes for patchs and coarse grid
  int m;

  int nPatch; // each patch carries a square fine mesh
  int nMeshes;   // including the coarse mesh
  // the coarse mesh is the zeroth mesh and fine meshes are from 1st to the last

  // indices on the b for 
  // center, 
  // west, east, 
  // south, north,
  // bottom, and top
  int iC,iW,iE,iS,iN,iB,iT;  
 


  int nCellPerPatch; // cell number in the coarse mesh that a patch uses

  int * indexM;  // indexM[n]
  int * indexI;  // indexI[n]
  int * indexJ;  // indexJ[n]
  int * indexK;  // indexK[n]

  
  int  ****index;


  // solving linear system
  
  real **valueA;   // values of A matrix
  int **columnA;   // corrsponding column of A matrix

  real tol;  // tolerance
  real *b; // right hand side
  real *sol;  // solution

  /*
  real *xCoord; // x coordinate
  real *yCoord; // y coordinate
  real *zCoord; // y coordinate
  */

  // checking accuracy
  real maxError;



};

#endif

---