Skip to content
Snippets Groups Projects
Select Git revision
  • c478e9b29a8a29f19538690022f70a5741c3956f
  • master default protected
  • bl
  • pluginMeshQuality
  • fixBugsAmaury
  • hierarchical-basis
  • alphashapes
  • relaying
  • new_export_boris
  • oras_vs_osm
  • reassign_partitions
  • distributed_fwi
  • rename-classes
  • fix/fortran-api-example-t4
  • robust_partitions
  • reducing_files
  • fix_overlaps
  • 3115-issue-fix
  • 3023-Fillet2D-Update
  • convert_fdivs
  • tmp_jcjc24
  • gmsh_4_14_0
  • gmsh_4_13_1
  • gmsh_4_13_0
  • gmsh_4_12_2
  • gmsh_4_12_1
  • gmsh_4_12_0
  • gmsh_4_11_1
  • gmsh_4_11_0
  • gmsh_4_10_5
  • gmsh_4_10_4
  • gmsh_4_10_3
  • gmsh_4_10_2
  • gmsh_4_10_1
  • gmsh_4_10_0
  • gmsh_4_9_5
  • gmsh_4_9_4
  • gmsh_4_9_3
  • gmsh_4_9_2
  • gmsh_4_9_1
  • gmsh_4_9_0
41 results

GenericVertex.h

Blame
  • Eigenvectors.cpp 4.43 KiB
    // Gmsh - Copyright (C) 1997-2011 C. Geuzaine, J.-F. Remacle
    //
    // See the LICENSE.txt file for license information. Please report all
    // bugs and problems to <gmsh@geuz.org>.
    
    #include "Eigenvectors.h"
    #include "Numeric.h"
    #include "fullMatrix.h"
    #include "GmshDefines.h"
    
    StringXNumber EigenvectorsOptions_Number[] = {
      {GMSH_FULLRC, "ScaleByEigenvalues", NULL, 1.},
      {GMSH_FULLRC, "View", NULL, -1.}
    };
    
    extern "C"
    {
      GMSH_Plugin *GMSH_RegisterEigenvectorsPlugin()
      {
        return new GMSH_EigenvectorsPlugin();
      }
    }
    
    std::string GMSH_EigenvectorsPlugin::getHelp() const
    {
      return "Plugin(Eigenvectors) computes the three (right) "
        "eigenvectors of each tensor in the view `View' "
        "and sorts them according to the value of the "
        "associated eigenvalues.\n\n"
        "If `ScaleByEigenvalues' is set, each eigenvector is "
        "scaled by its associated eigenvalue. The plugin "
        "gives an error if the eigenvectors are complex.\n\n"
        "If `View' < 0, the plugin is run on the current view.\n\n"
        "Plugin(Eigenvectors) creates three new vector view.";
    }
    
    int GMSH_EigenvectorsPlugin::getNbOptions() const
    {
      return sizeof(EigenvectorsOptions_Number) / sizeof(StringXNumber);
    }
    
    StringXNumber *GMSH_EigenvectorsPlugin::getOption(int iopt)
    {
      return &EigenvectorsOptions_Number[iopt];
    }
    
    PView *GMSH_EigenvectorsPlugin::execute(PView *v)
    {
      int scale = (int)EigenvectorsOptions_Number[0].def;
      int iView = (int)EigenvectorsOptions_Number[1].def;
    
      PView *v1 = getView(iView, v);
      if(!v1) return v;
    
      PViewData *data1 = getPossiblyAdaptiveData(v1);
      if(data1->hasMultipleMeshes()){
        Msg::Error("Eigenvectors plugin cannot be run on multi-mesh views");
        return v;
      }
    
      PView *min = new PView();
      PView *mid = new PView();
      PView *max = new PView();
    
      PViewDataList *dmin = getDataList(min);
      PViewDataList *dmid = getDataList(mid);
      PViewDataList *dmax = getDataList(max);
    
      int nbcomplex = 0;
      fullMatrix<double> mat(3, 3), vl(3, 3), vr(3, 3);
      fullVector<double> dr(3), di(3);
      for(int ent = 0; ent < data1->getNumEntities(0); ent++){
        for(int ele = 0; ele < data1->getNumElements(0, ent); ele++){
          if(data1->skipElement(0, ent, ele)) continue;
          int numComp = data1->getNumComponents(0, ent, ele);
          if(numComp != 9) continue;
          int type = data1->getType(0, ent, ele);
          std::vector<double> *outmin = dmin->incrementList(3, type);
          std::vector<double> *outmid = dmid->incrementList(3, type);
          std::vector<double> *outmax = dmax->incrementList(3, type);
          if(!outmin || !outmid || !outmax) continue;
          int numNodes = data1->getNumNodes(0, ent, ele);
          double xyz[3][8];
          for(int nod = 0; nod < numNodes; nod++)
            data1->getNode(0, ent, ele, nod, xyz[0][nod], xyz[1][nod], xyz[2][nod]);
          for(int i = 0; i < 3; i++){
            for(int nod = 0; nod < numNodes; nod++){
              outmin->push_back(xyz[i][nod]);
              outmid->push_back(xyz[i][nod]);
              outmax->push_back(xyz[i][nod]);
            }
          }
          for(int step = 0; step < data1->getNumTimeSteps(); step++){
            for(int nod = 0; nod < numNodes; nod++){
              for(int i = 0; i < 3; i++)
                for(int j = 0; j < 3; j++)
                  data1->getValue(step, ent, ele, nod, 3 * i + j, mat(i, j));
              if(mat.eig(dr, di, vl, vr, true)){
                if(!scale) dr(0) = dr(1) = dr(2) = 1.;
                for(int i = 0; i < 3; i++){
                  double res;
                  res = dr(0) * vr(i, 0); outmin->push_back(res);
                  res = dr(1) * vr(i, 1); outmid->push_back(res);
                  res = dr(2) * vr(i, 2); outmax->push_back(res);
                }
                if(di(0) || di(1) || di(2)) nbcomplex++;
              }
              else{
                Msg::Error("Could not compute eigenvalues/vectors");
              }
            }
          }
        }
      }
    
      if(nbcomplex)
        Msg::Error("%d tensors have complex eigenvalues", nbcomplex);
      
      for(int i = 0; i < data1->getNumTimeSteps(); i++){
        double time = data1->getTime(i);
        dmin->Time.push_back(time);
        dmid->Time.push_back(time);
        dmax->Time.push_back(time);
      }
      dmin->setName(data1->getName() + "_MinEigenvectors");
      dmin->setFileName(data1->getName() + "_MinEigenvectors.pos");
      dmin->finalize();
      dmid->setName(data1->getName() + "_MidEigenvectors");
      dmid->setFileName(data1->getName() + "_MidEigenvectors.pos");
      dmid->finalize();
      dmax->setName(data1->getName() + "_MaxEigenvectors");
      dmax->setFileName(data1->getName() + "_MaxEigenvectors.pos");
      dmax->finalize();
    
      return 0;
    }