File: grid_matrix.h

package info (click to toggle)
ergo 3.5-1
  • links: PTS, VCS
  • area: main
  • in suites: buster, stretch
  • size: 17,044 kB
  • ctags: 6,813
  • sloc: cpp: 91,488; ansic: 15,728; sh: 6,416; makefile: 1,287; yacc: 123; lex: 108
file content (78 lines) | stat: -rw-r--r-- 2,450 bytes parent folder | download
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
/* Ergo, version 3.5, a program for linear scaling electronic structure
 * calculations.
 * Copyright (C) 2016 Elias Rudberg, Emanuel H. Rubensson, Pawel Salek,
 * and Anastasia Kruchinina.
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 * 
 * Primary academic reference:
 * Kohn−Sham Density Functional Theory Electronic Structure Calculations 
 * with Linearly Scaling Computational Time and Memory Usage,
 * Elias Rudberg, Emanuel H. Rubensson, and Pawel Salek,
 * J. Chem. Theory Comput. 7, 340 (2011),
 * <http://dx.doi.org/10.1021/ct100611z>
 * 
 * For further information about Ergo, see <http://www.ergoscf.org>.
 */
#if !defined(_GRID_MATRIX_H_)
#define _GRID_MATRIX_H_ 1

#include "sparse_matrix.h"

namespace Dft {
  /** Generic matrix interface. It is not optimized for speed. */

  class Matrix {
  public:
    virtual ergo_real at(int row, int col) const = 0;
    virtual bool isSparse() const = 0;
    virtual const SparseMatrix* asSparse() const = 0;
    virtual const ergo_real* asFull() const = 0;
    virtual ~Matrix() {}
  };

  class FullMatrix {
  public:
    ergo_real* mat;
    int nbast;
    bool owned;
  explicit FullMatrix(int nbast_)
    : mat(new ergo_real[nbast_*nbast_]), nbast(nbast_), owned(true)
      {
        for(int i= nbast*nbast-1; i >=0; --i) mat[i] = 0.0;
      }
  FullMatrix(ergo_real *m, int nbast_)
    : mat(m), nbast(nbast_), owned(false)
      {
      }
    /** ugly-hack constructor. Remove it! */
  FullMatrix(const ergo_real *m, int nbast_)
    : mat( (ergo_real*)(m)), nbast(nbast_), owned(false)
      {
      }

    ~FullMatrix() { if (owned && mat) delete []mat; }
    void add(int row, int col, ergo_real val)
    { 
      mat[row + col*nbast] += val;
    }
    ergo_real at(int row, int col) const
    {
      return mat[row + col*nbast];
    }
  };

};

#endif /* _GRID_MATRIX_H_ */