fem.h

Go to the documentation of this file.

#ifndef fem_h
#define fem_h
 
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <sstream>
#include <utility>
#include <vector>
 
#include <sys/times.h>
#include <time.h>
#include <unistd.h>
 
#include "mesh.h"
 
#include "ANN.h"
#include "feellgoodSettings.h"
 
const int NB_ENERGY_TERMS = 4;
 
enum ENERGY_TYPE
    {
    EXCHANGE = 0,
    ANISOTROPY = 1,
    DEMAG = 2,
    ZEEMAN = 3
    };
 
class Fem
    {
public:
    inline Fem(Settings const &mySets, timing &t_prm) : msh(mySets)
        {
        vmax = 0.0;
        std::fill(E.begin(),E.end(),0);
        Etot0 = INFINITY;  // avoid "WARNING: energy increased" on first time step
        Etot = 0.0;
 
        recenter_mem = false;
        if (mySets.recenter)
            {
            if (mySets.verbose)
                {
                std::cout << "Approximate nearest neighbors:\n";
                }
            pts = annAllocPts(msh.getNbNodes(), Nodes::DIM);
            if (!pts)
                {
                std::cout << "ANN memory error while allocating points" << std::endl;
                SYSTEM_ERROR;
                }
            else if (mySets.verbose)
                {
                std::cout << "  points allocated\n";
                }
 
            for (int i = 0; i < msh.getNbNodes(); i++)
                {
                this->pts[i][0] = msh.getNode_p(i).x();
                this->pts[i][1] = msh.getNode_p(i).y();
                this->pts[i][2] = msh.getNode_p(i).z();
                }
 
            if (mySets.verbose)
                {
                std::cout << "  building kd_tree\n";
                }
 
            kdtree = new ANNkd_tree(pts, msh.getNbNodes(), Nodes::DIM);
            if (!kdtree)
                {
                std::cout << "ANN memory error while allocating kd_tree" << std::endl;
                SYSTEM_ERROR;
                }
            recenter_mem = true;
 
            if (mySets.verbose)
                {
                std::cout << "  kd_tree allocated\n";
                }
            }
        else if (mySets.verbose)
            {
            std::cout << "No recentering.\n";
            }
 
        if (mySets.restoreFileName == "")
            {
            msh.init_distrib(mySets);
            }
        else
            {
            t_prm.set_t(msh.readSol(mySets.verbose, mySets.restoreFileName));
            }
 
        /* This potentially overrides the initial time set above by msh.readSol(). */
        if (!isnan(mySets.initial_time))
            {
            t_prm.set_t(mySets.initial_time);
            }
 
        if (mySets.recenter)
            {
            direction(Nodes::IDX_Z);
            } /* DW propagation direction for recentering */
        }
 
    ~Fem()
        {
        if (recenter_mem)
            {
            annDeallocPts(pts);
            delete kdtree;
            }
        }
 
    double vmax;
 
    std::array<double,NB_ENERGY_TERMS> E;
 
    double DW_dir;
 
    double Etot0;
    
    double Etot;
 
    Mesh::mesh msh;
 
    void energy(double const t 
                ,Settings &settings );
 
    inline void evolution(void)
        {
        msh.evolution();
        Etot0 = Etot;
        }
 
    void saver(Settings &settings , timing const &t_prm ,
               std::ofstream &fout , const int nt ) const;
 
    bool recenter(double thres ,
                  char recentering_direction );
 
private:
    bool recenter_mem;  
    ANNkd_tree *kdtree; 
    ANNpointArray pts;  
    void direction(enum Nodes::index idx_dir );
    };  // end class
 
#endif