File: simple_lanczos.cc

package info (click to toggle)
ergo 3.8.2-1.1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 17,568 kB
  • sloc: cpp: 94,763; ansic: 17,785; sh: 10,701; makefile: 1,403; yacc: 127; lex: 116; awk: 23
file content (101 lines) | stat: -rw-r--r-- 2,994 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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/* Ergo, version 3.8.2, a program for linear scaling electronic structure
 * calculations.
 * Copyright (C) 2023 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:
 * Ergo: An open-source program for linear-scaling electronic structure
 * calculations,
 * Elias Rudberg, Emanuel H. Rubensson, Pawel Salek, and Anastasia
 * Kruchinina,
 * SoftwareX 7, 107 (2018),
 * <http://dx.doi.org/10.1016/j.softx.2018.03.005>
 * 
 * For further information about Ergo, see <http://www.ergoscf.org>.
 */

/** @file simple_lanczos.cc

    @brief Simple implementation of the Lanczos method.

    @author: Elias Rudberg <em>responsible</em>
*/

#include "../matrix/mat_gblas.h"
#include "simple_lanczos.h"
#include "output.h"
#include <cmath>
#include <cstring>

namespace simple_lanczos {

  ergo_real simple_lanczos_get_vector_norm(int n, const ergo_real* v) {
    ergo_real sqSum = 0;
    for(int i = 0; i < n; i++)
      sqSum += v[i] * v[i];
    return template_blas_sqrt(sqSum);
  }

  void simple_lanczos_normalize_vector(int n, ergo_real* v) {
    ergo_real factor = 1.0 / simple_lanczos_get_vector_norm(n, v);
    for(int i = 0; i < n; i++)
      v[i] *= factor;
  }

  void simple_lanczos_get_eigs(int n, ergo_real* M, 
			       ergo_real & currEig_lo, ergo_real* bestVector_lo, 
			       ergo_real & currEig_hi, ergo_real* bestVector_hi, 
			       ergo_real* eigValListResult)
  {
    int lwork = 3*n*n;
    ergo_real* work = new ergo_real[lwork];
    ergo_real* eigvalList = new ergo_real[n];
    ergo_real* A = new ergo_real[n*n];
    memcpy(A, M, n*n*sizeof(ergo_real));
    int info = 0;
    mat::syev("V", "U", &n, A,
	      &n, eigvalList, work, &lwork, 
	      &info);
    if(info != 0)
      {
	do_output(LOG_CAT_ERROR, LOG_AREA_CI, "error in syev, info = %i", info);
	throw("error in syev");
      }

    if(bestVector_lo) {
      for(int i = 0; i < n; i++)
	bestVector_lo[i] = A[0*n+i];
    }
    if(bestVector_hi) {
      for(int i = 0; i < n; i++)
	bestVector_hi[i] = A[(n-1)*n+i];
    }

    if(eigValListResult)
      {
	for(int i = 0; i < n; i++)
	  eigValListResult[i] = eigvalList[i];
      }

    currEig_lo = eigvalList[0];
    currEig_hi = eigvalList[n-1];

    delete [] work;
    delete [] eigvalList;
    delete [] A;
  }

} // end namespace simple_lanczos