Department of Scientific Computing    Institute for Numerical Simulation    University of Bonn

Documentation

Download

Programming References

Bug Reports / Suggestions

FAQ

Authors

           

---

LevelAdaptiveGrid.hpp

//
// implementation for ActiveSubSpaces
//

#ifndef _ACTIVESUBSPACES_
# define _ACTIVESUBSPACES_

#include "LevelAdaptive.hpp"

template<int DIM>
LevelAdaptiveGrid<DIM>::LevelAdaptiveGrid() {
 int i ;
 for (i=0; i<DIM; i++) Level0[i]=L[i]=0 ;
 a=NULL ;
 nLAD=nBW=0 ;
}

template<int DIM>
LevelAdaptiveGrid<DIM>::LevelAdaptiveGrid(int *L0, int *LL, Wavelets *WC) {
 int i ;
 for (i=0; i<DIM; i++) Level0[i]=L[i]=0 ;
 a=NULL ;
 Init(L0,LL,WC) ;  
}

template<int DIM>
void LevelAdaptiveGrid<DIM>::Init(int *L0 , int *LL, Wavelets *WC) {

 // copy 
 int i ;
 for (i=0; i<DIM; i++) { 
   Level0[i]=L0[i] ; 
   L[i]=LL[i] ;
   assert(L[i]<=LMAX) ;
  }
 
 // allocate
 a=new Matrix<bool,DIM> ;
 int A[DIM]={0} ;
 a->Init(A,L)   ;

 Matrix<bool,DIM>::iterator it(a) ;
 for (it=(*a).begin(); it <= (*a).end(); ++it) (*a)[it]=false ;

 W=WC   ;
 nLAD=0 ;
}

template<int DIM>
LevelAdaptiveGrid<DIM>::~LevelAdaptiveGrid() {
 int i ;
 for (i=0; i<DIM; i++) Level0[i]=L[i]=0 ;
 delete a ;
}

template<int DIM>
void LevelAdaptiveGrid<DIM>::Attach(LevelAdaptiveData<DIM> *AD) {
  int i ;
  for (i=0; i<nLAD; i++) if (LAD[i]==AD) break;
  if (i==nLAD) LAD[nLAD++]=AD ;
}

template<int DIM>
void LevelAdaptiveGrid<DIM>::Attach(BlendingWeights<DIM> *B) {
  int i ;
  for (i=0; i<nBW; i++) if (BW[i]==B) break;
  if (i==nBW) BW[nBW++]=B ;
}

template<int DIM>
void LevelAdaptiveGrid<DIM>::Print() {
 int i ;
 std::cout <<"Flags:\n" ;

 Matrix<bool,DIM>::iterator it(a,DIM-1) ;
 for (it=(*a).begin(DIM-1); it <= (*a).end(); ++it) {
   std::cout<<'('<<it.i[0] ;
   for (i=1; i<DIM-1; i++) std::cout<<','<<it.i[i] ;
   std::cout<<",.)=" ;
   
   int in[DIM] ;
   for (i=0; i<DIM-1; i++) in[i]=it.i[i] ;
   for (in[DIM-1]=0; in[DIM-1]<=L[DIM-1]; in[DIM-1]++)
     if ((*a)[in]) std::cout<<"1 " ;
              else std::cout<<"0 " ;

   std::cout<<'\n';
 }
}


template<int DIM>
size_t LevelAdaptiveGrid<DIM>::Size() {
 int i,s=0 ; 
 Matrix<bool , DIM>::iterator it(a) ;
 for (it=(*a).begin(); it<=(*a).end(); ++it) 
   if ( (*a)[it.i] ) {
     int q=1 ;
     for (i=0; i<DIM; i++) { q *= (it.i[i]==Level0[i]) ? (1<<Level0[i])+1 : (1<<(it.i[i]-1)) ; }
     s+=q ;
    }
 return s ;
}



template<int DIM>
void LevelAdaptiveGrid<DIM>::Set(Function *F , double n) {
 int i ;
 double x[DIM] ;

 if (a==NULL) { std::cout<<"LevelAdaptiveGrid<"<<DIM<<">::Set(F,n) : (*this) not initialized\n"; exit(-1) ;} 

 Matrix<bool,DIM>::iterator it(a) ;
 for (it=(*a).begin(); it <= (*a).end(); ++it) {
   bool lev0=true ;
   for (i=0; i<DIM; i++) {
     x[i]=(double)it.i[i] ;
     if (it.i[i]<Level0[i]) lev0=false ;
    }
   if ((F->Eval(x) <= n+1e-10) && lev0) (*a)[it]=true  ;
                                 else   (*a)[it]=false ;
 }

 for (i=0; i<nLAD; i++) LAD[i]->Allocate() ;
 for (i=0; i<nBW ; i++) BW[i]->Set(this) ;
}

template<int DIM>
void LevelAdaptiveGrid<DIM>::Clear() {
 Matrix<bool,DIM>::iterator it(a) ;
 for (it=(*a).begin(); it <= (*a).end(); ++it) (*a)[it]=false  ;
}
#endif

---