fluidf.h

Go to the documentation of this file.

/* -------------------------------------------------------------------------- */
/* 
   $Id: fluidf.h 620 2007-03-22 07:31:27Z svacek $
   $Author: svacek $
*/
/* -------------------------------------------------------------------------- */
#ifndef _FLUIDF_SVH
#define _FLUIDF_SVH
/*
  functions fakt/power()
    funkce pro vypocet faktorialu nebo n-te mocniny, kde n - prirozene cislo
*/
double fakt(int k);
double power(double x,int k);
/*
  function maxside()
  function minside()
  computes the maximal length of sides in triangulations
 */
double maxside();
double minside();
long nodedegree(long i);
/*
  functions triangle_volume()
           element_volume()
           edge_volume()

  computes the volume of triangle/element (i-th)
 */
double triangle_volume(long i);
double element_volume(long i);  /* << FE volume at time level n   */
double element_volume1(long i); /* << FE volume at time level n-1 */
double element_volume2(long i); /* << FE volume at time level n-2 */
double element_volume_original(long i);
double edge_volume(long i);
/*
 functions load_node/edge/ele/triang()

 loads NODE/ELE/EDGE or whole triangulations
*/
void load_node(const char *FileName);
void load_ele(const char *FileName);
void load_edge(const char *FileName);
void load_triang();
/* angener */
long check_side(long IA,long IB,long nsid);
void load_angener(const char fname[]);
void load_triang_angener();
void write_angener(char fname[]);

/*
  function AddEdge2Bndr()
           BoundaryStructure()
           BoundaryEdges()

  pomocne funkce pro vytrideni hranicnich stran 
     ( naplnuji BndrTypes,BndrId[] a BndrEdges[] )
     
  AddEdge2Bndr -> hleda, zda dany typ hranice je uz registrovan, pripadne ho registruje, a zvysi pocet stran na danem typu hranice

  BoundaryStructure -> vypise vsechny typy hranice a take kolik hran obsahuji

  BoundaryEdges -> pocet hran na hranici

 */
int AddEdge2Bndr(int BM);
void BoundaryStructure();
long BoundaryEdges();
/*
  function edge_number()
   - najde hranu ZK v seznamu a vrati jeji index
 */
long edge_number(long Z,long K);
/*
  function destruct_all()
  dealokuje vsechny promenne
 */
void destruct_all();
/*
  function fill_elements_edges()
   naplnuje ELEMENT_BOUNDARY_SIDES[][]
 */
void fill_elements_edges();
void CheckNeighbours();
/*
  function SortBoundarySides()
   naplni BSIDE_INDEX[]
 */
void SortBoundarySides();
/*
  functions node/side/bubble() a derivace ...
   vraci hodnoty bazovych funkci v barycentrickych souradnicich
 */
double node(double L1);
double side(double L1,double L2,int idx);
double bubble(double L1,double L2,double L3,int idx);
double Dnode(double L1);
double D2node(double L1);
void Dside(vector grad,double L1,double L2,int idx,int iL1,int iL2);
void D2side(matrix hes,double L1,double L2,int idx,int iL1,int iL2);
void Dbubble(vector grad,double L1,double L2,double L3,int idx);
void D2bubble(matrix hes,double L1,double L2,double L3,int idx);
/*
  functions LegendreP,fcefi() a derivace.
   vraci hodnoty Legendrova polynomu nebo funkce fi 
   (fce fi je 
        fi(j,x)=\int_{-1}^1 LegendreP(j+1,x) dx  /  (1-x^2) 
 */
double LegendreP(int j,double x);
double DLegendreP(int j,double x);
double D2LegendreP(int j,double x);
double fcefi(int j,double x);
double Dfcefi(int j,double x);
double D2fcefi(int j,double x);

long unique_ijklm(long *_II,long *_JJ,long *_KK,long *_LL,short *_MM,const long _nz);
void quicksort_ijklm(long *_II,long *_JJ,long *_KK,long *_LL,short *_MM, long _lo, long _hi);

/* ----------------------------------------------------------------------------------------- */
void ComputesNormal2Solid(); /**< Computes approximation of normal to solid (SOLID means airfoil in this stage ) */
void NegativePartMatrix(const double *A,double *Anegative);
void PositivePartMatrix(const double *A,double *Anegative);

double HeavysideFunction(double _arg);
double HeavysideFunctionR(double _arg);
long NeighbouringElement(long i,short k);
double SegmentDistance(double pointx,double pointy,double *SEGX,double *SEGY);


#endif

---