File: MAdLinearSystemGmm.h

package info (click to toggle)
madlib 1.3.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 8,196 kB
  • sloc: cpp: 39,851; sh: 10,041; makefile: 473
file content (111 lines) | stat: -rw-r--r-- 2,953 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
// -*- C++ -*-
// -------------------------------------------------------------------
// MAdLib - Copyright (C) 2008-2009 Universite catholique de Louvain
//
// See the Copyright.txt and License.txt files for license information. 
// You should have received a copy of these files along with MAdLib. 
// If not, see <http://www.madlib.be/license/>
//
// Please report all bugs and problems to <contrib@madlib.be>
//
// Authors: Gaetan Compere, Jean-Francois Remacle
// -------------------------------------------------------------------

#ifndef _H_LINEARSYSTEMGMM_MAD
#define _H_LINEARSYSTEMGMM_MAD

#ifdef _HAVE_GMM_

// Interface to GMM++

#include "MAdLinearSystem.h"

#include <gmm.h>

namespace MAd {

  // -------------------------------------------------------------------
  class MAdLinearSystemGmm : public MAdLinearSystem {

  public :

    MAdLinearSystemGmm () : MAdLinearSystem(), _a(0), _b(0), _x(0), _prec(1.e-8), _noisy(0) {}
    ~MAdLinearSystemGmm ()
    {
      delete _a;
      delete _b;
      delete _x;
    }

  public:

    bool isAllocated () const {return _a != 0;}
    void allocate (int _nbRows)
    {
      if (_a) delete _a;
      if (_x) delete _x;
      if (_b) delete _b;
      _a = new  gmm::row_matrix< gmm::wsvector<double> >(_nbRows,_nbRows);
      _b = new  std::vector<double>(_nbRows);
      _x = new  std::vector<double>(_nbRows);    
    }
    void  addToMatrix    (int _row, int _col, double _val) 
    {
      if (_val != 0.0) (*_a)(_row, _col) += _val;
    }
    double getFromMatrix (int _row, int _col) const
    {
      return (*_a)(_row, _col);
    }
    void  addToRightHandSide    (int _row, double _val) 
    {
      if (_val != 0.0) (*_b)[_row]+=_val;
    }
    double getFromRightHandSide (int _row) const 
    {
      return (*_b)[_row];
    }
    double getFromSolution (int _row) const 
    {
      return (*_x)[_row];
    }
    void zeroMatrix () 
    {
      gmm::clear(*_a);
    }
    void zeroRightHandSide () 
    {
      for (unsigned int i = 0; i < _b->size(); i++) (*_b)[i] = 0;
    }
    void reorder () {
    
    }
    void setPrec(double p){_prec=p;}
    void setNoisy(int n){_noisy=n;}
    int systemSolve () 
    {
      //gmm::ilut_precond< gmm::row_matrix< gmm::wsvector<double> > > P(*_a, fill, _prec);
      gmm::ildltt_precond< gmm::row_matrix< gmm::wsvector<double> > > P(*_a, fill, _prec);
      gmm::iteration iter(eps);
      iter.set_noisy(_noisy);
      //     gmm::sequential_additive_schwarz(*_a, *_x, *_b, P, vB, iter, local_solver, global_solver)
      if (sType==GMRES)gmm::gmres(*_a, *_x, *_b, P, 100, iter);  // execute the GMRES algorithm
      else gmm::cg(*_a, *_x, *_b, P, iter);  // execute the CG algorithm
      return 1;
    }

  private:

    gmm::row_matrix<gmm::wsvector<double> > *_a;
    std::vector<double> *_b, *_x;
    double _prec;
    int _noisy;
  };

  // -------------------------------------------------------------------

#endif

}

#endif